UVa10115_Automatic Editing csdn(小白书字符串专题)
2014-07-31 21:50
453 查看
解题报告
题意:
替换字符串,一个单词可重复替换
思路:
这种题都很恶心。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
using namespace std;
char str[1000][1000],ch[1000][1000],sh[1000],str1[1000];
int main()
{
int n,i,j;
while(~scanf("%d%*c",&n)&&n) {
memset(str,0,sizeof(str));
memset(ch,0,sizeof(ch));
for(i=0; i<n; i++) {
fgets(str[i],100,stdin);
int l=strlen(str[i]);
str[i][l-1]=0;
fgets(ch[i],100,stdin);
l=strlen(ch[i]);
ch[i][l-1]=0;
}
fgets(sh,100,stdin);
int l1=strlen(sh);
sh[l1-1]=0;
for(i=0; i<n; i++) {
while(strstr(sh,str[i])) {
int l=strlen(str[i]);
strcpy(str1,sh);
memset(sh,0,sizeof(sh));
strncat(sh,str1,strstr(str1,str[i])-str1);
strcat(sh,ch[i]);
strcat(sh,strstr(str1,str[i])+l);
}
}
printf("%s\n",sh);
}
return 0;
}
Text-processing tools like awk and sed allow you to automatically perform a sequence of editing operations based on a script. For this problem we consider the specific case in which
we want to perform a series of string replacements, within 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.
To perform the edits for a given line of text, start with the first rule. Replace the first occurrence of the find string within the text by thereplace-by string, then try to perform
the same replacement again on the new text. Continue 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.
The input contains one or more test cases, followed by a line containing only 0 (zero) that signals the end of the file. Each test case begins with a line containing the number of rules, which will be
between 1 and 10. Each rule is specified by a pair of lines, 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-by strings 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:
Example output:
题意:
替换字符串,一个单词可重复替换
思路:
这种题都很恶心。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
using namespace std;
char str[1000][1000],ch[1000][1000],sh[1000],str1[1000];
int main()
{
int n,i,j;
while(~scanf("%d%*c",&n)&&n) {
memset(str,0,sizeof(str));
memset(ch,0,sizeof(ch));
for(i=0; i<n; i++) {
fgets(str[i],100,stdin);
int l=strlen(str[i]);
str[i][l-1]=0;
fgets(ch[i],100,stdin);
l=strlen(ch[i]);
ch[i][l-1]=0;
}
fgets(sh,100,stdin);
int l1=strlen(sh);
sh[l1-1]=0;
for(i=0; i<n; i++) {
while(strstr(sh,str[i])) {
int l=strlen(str[i]);
strcpy(str1,sh);
memset(sh,0,sizeof(sh));
strncat(sh,str1,strstr(str1,str[i])-str1);
strcat(sh,ch[i]);
strcat(sh,strstr(str1,str[i])+l);
}
}
printf("%s\n",sh);
}
return 0;
}
Problem E: Automatic Editing
Source file: | autoedit.{c, cpp, java, pas} |
Input file: | autoedit.in |
Output file: | autoedit.out |
we want to perform a series of string replacements, within 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 |
the same replacement again on the new text. Continue 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 |
between 1 and 10. Each rule is specified by a pair of lines, 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-by strings 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
相关文章推荐
- UVA 10115 (暑假-字符串(2) -F - Automatic Editing)
- UVa10815_Andy's First Dictionary(小白书字符串专题)
- UVa401_Palindromes(小白书字符串专题)
- UVa409_Excuses, Excuses!(小白书字符串专题)
- UVa10361_Automatic Poetry(小白书字符串专题)
- UVa409_Excuses, Excuses!(小白书字符串专题)
- UVa10048_Audiophobia(最短路/floyd)(小白书图论专题)
- UVA 10115 - Automatic Editing(字符串)
- UVa644_Immediate Decodability(小白书字符串专题)
- uva Automatic Editing
- UVA 10115(字符串)
- UVa567_Risk(最短路)(小白书图论专题)
- UVa10034/POJ2560_Freckles(最小生成树)(小白书图论专题)
- UVA 10115 - Automatic Editing(字符串替换问题)
- UVa563_Crimewave(网络流/最大流)(小白书图论专题)
- UVA 10115-Automatic Editing(运用字符串函数对字符串进行替换)
- UVa10099_The Tourist Guide(最短路/floyd)(小白书图论专题)
- UVa10115 - Automatic Editing- 字符串(子串替换)-难度2
- UVa753/POJ1087_A Plug for UNIX(网络流最大流)(小白书图论专题)
- UVa 10115 Automatic Editing (字符串中间替换技巧)