UVA 10115 Automatic Editing
2013-07-25 22:41
344 查看
Problem E: Automatic Editing
Source file: | autoedit.{c, cpp, java, pas} |
Input file: | autoedit.in |
Output file: | autoedit.out |
a single line of text, based on a fixed set of rules. Each rule specifies the string to find, and the string to replace it with, as shown below.
Rule | Find | Replace-by |
1. | ban | bab |
2. | baba | be |
3. | ana | any |
4. | ba b | hind the g |
until the find string no longer occurs within the text, and then move on to the next rule. Continue until all the rules have been considered. Note that (1) when searching for a findstring, you always start searching at the beginning of the
text, (2) once you have finished using a rule (because the find string no longer occurs) you never use that rule again, and (3) case is significant.
For example, suppose we start with the line
banana boat
and apply these rules. The sequence of transformations is shown below, where occurrences of a find string are underlined and replacements are boldfaced. Note that rule 1 was used twice, then rule 2 was used once, then rule 3 was used zero times, and
then rule 4 was used once.
Before | After | |
banana boat | babana boat | |
babana boat | bababa boat | |
bababa boat | beba boat | |
beba boat | behind the goat |
where the first line is the find string and the second line is the replace-by string. Following all the rules is a line containing the text to edit. For each test case, output a line containing the final edited text.
Both find and replace-by strings will be at most 80 characters long. Find strings will contain at least one character, but replace-bystrings may be empty (indicated in the input file by an empty line). During the edit process
the text may grow as large as 255 characters, but the final output text will be less than 80 characters long.
The first test case in the sample input below corresponds to the example shown above.
Example input:
4 ban bab baba be ana any ba b hind the g banana boat 1 t sh toe or top 0
Example output:
behind the goat shoe or shop
替换字符串。要注意。一定要替换到不能替换为止。。
用strstr妥妥过。。。
#include <stdio.h>
#include <string.h>
int n;
char a[105][105];
char b[105][105];
char sb[305];
int main()
{
while (scanf("%d", &n) != EOF && n)
{
getchar();
for (int i = 0; i < n; i ++)
{
gets(a[i]);
gets(b[i]);
}
gets(sb);
for (int i = 0; i < n ; i++)
{
while (strstr(sb, a[i]) != NULL)
{
char *p;
char t[305];
p = strstr(sb, a[i]);
strcpy(t, p + strlen(a[i]));
strcpy(p, b[i]);
strcpy(p + strlen(b[i]), t);
}
}
printf("%s\n", sb);
}
return 0;
}
相关文章推荐
- uva-10115 - Automatic Editing
- uva10115 - Automatic Editing
- uva 10115 Automatic Editing(strstr函数查找子串)
- UVa_10115 - Automatic Editing(POJ 1572)
- UVa 10115 - Automatic Editing
- UVA - 10115 Automatic Editing
- UVa 10115 - Automatic Editing
- UVA 10115 Automatic Editing
- UVa 10115 - Automatic Editing
- UVa 10115 Automatic Editing
- UVA10115- Automatic Editing
- UVA 10115 (暑假-字符串(2) -F - Automatic Editing)
- uva 10115
- UVa 10115 自动编辑
- UVa 10115 - Automatic Editing
- UVA - 10115 Automatic Editing
- UVA 10115 - Automatic Editing(字符串)
- uva_10115-Automatic Editing
- UVa 10115 Automatic Editing
- UVA 10115 Automatic Editing(字符处理)