uva Automatic Editing

题目如下：

Automatic Editing

Source file: autoedit.{c, cpp, java, pas}
Input file: autoedit.in
Output file: autoedit.out

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.

 

Rule  Find  Replace-by
1.  ban   bab
2.  baba   be
3.  ana   any
4.  ba b   hind the g

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 the replace-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 find string, 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

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:

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

 

 

这题算是字符串问题中较难的了，对每个rule,设计一个while循环，如果能找到该rule，就执行while循环，并且每次找到都及时break,退回到while处重新找。设置两个变量记录该rule的开始和结束位置（以便replace）。难点在else中，即当前字符不是rule中的对应字符，有一些微妙的细节，此时若直接返回for中，由于文本中的循环变量位置已经向前改变，故需要另设一个变量来记录改变的大小，在else中需要减去这个变量已使循环变量只向前进一位。

AC的代码如下：

#include
   
   
    
    
#include
    
    
     
     
char input[20][260],text[260],temp[260];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        getchar();
        if(n==0)
            return 0;
        memset(text,'\0',sizeof(text));
        memset(input,'\0',sizeof(input[0]));
        int i=0,j=0,m=0,ok=0,ok2=1,p=0,g=0,f=0,q=0,s=0;
        for(i=0; i<=2*n-1; i++)
            gets(input[i]);
        gets(text);
        int len,len2;
        for(i=0; i<=2*n-2; i=i+2)
        {
            ok2=1;
            len=strlen(input[i]);
            len2=strlen(input[i+1]);
            while(ok2==1)
            {
                int len1=strlen(text);

                ok2=0;
                m=0;
                ok=0;
                memset(temp,'\0',sizeof(temp));
                for(j=0; j<=len1-1; j++)
                    if(text[j]==input[i][m])
                    {
                        if(ok!=1)
                            g=j;
                        m++;
                        s=m;
                        ok=1;
                        if(m>len-1)
                        {
                            ok2=1;
                            f=j;
                            for(p=f+1,m=0; p<=len1-1; p++,m++)
                                temp[m]=text[p];
                            for(p=g,m=0; m<=len2-1; p++,m++)
                                text[p]=input[i+1][m];
                            for(q=p,m=0; temp[m]!='\0'; q++,m++)
                                text[q]=temp[m];
                            text[q]='\0';
                            break;
                        }
                    }
                    else
                    {
                        m=0;
                        ok=0;
                        j=j-s;
                        s=0;
                    }
            }
        }
        puts(text);
    }
    return 0;
}