E - The Marshtomp has seen it all before

Description

fjxmlhx不喜欢网上的 marshtomps 。所以他决定把所有的“marshtomp”（名字不区分大小写） 改为 “fjxmlhx；

Input

输入包含多行，每行字符串不超过200的长度，一个单词不会一半出现在上一行，剩下的在下一行。直到文件结束（EOF）

Output

输出 替换之后的字符串。

Sample Input

The Marshtomp has seen it all before.
marshTomp is beaten by fjxmlhx!
AmarshtompB

Sample Output

The fjxmlhx has seen it all before.
fjxmlhx is beaten by fjxmlhx!
AfjxmlhxB

题目链接http://vjudge.net/contest/142967#problem/E

   
   

    
    #include<stdio.h>
#include<ctype.h>
#include<string.h>
char a[1010],b[10],c[1010],e[1010];
int main()
{
    char d[]= {"fjxmlhx"};
    while(gets(c))
    {
        memset(a,'\0',sizeof(a));
        memset(e,'\0',sizeof(e));
        memset(b,'\0',sizeof(b));
        int len=strlen(c);
        int i,j;
        for(i=0; i<len; i++)
            a[i]=tolower(c[i]);
        int k=0;
        for(i=0; i<len; i++)
        {
            if(i+9<=len)
            {
                int ans=0;
   
   
   
   

    
                    for(j=i; j<i+9; j++)
                    b[ans++]=a[j];
   
   
   
   

    
                    ans=0;
                if(!strcmp(b,"marshtomp"))
                {
                    for(j=i; j<i+7; j++,ans++)
                        e[k++]=d[ans];
                    i+=9;//此处详细看
                }
            }
            e[k++]=c[i];
        }
        puts(e);//注意点
    }
    return 0;
}