刚哥遇到了感情问题（二）

题目：

刚哥遇到了感情问题（二）

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 1

描述

上一集我们讲到 作为工作室老大的刚哥遇到很多女生的追求，你帮他个挑选了个英语成绩不错的对象。在你的帮助下，刚哥找到了个    英语学霸村    的小花，刚哥对小花的追求并不是那么一帆风顺。

事情是这样的：为了追求小花，刚哥打算给小花写点情书，然而小花却要求刚哥用英文给她写情书，并且要求刚哥不许使用百度翻译，这可难为刚哥了，刚哥自幼就爱国，对西洋文不怎么感冒，幸得健爷的帮助，刚哥成功把中文的情书翻译成了英文的情书，然而问题来了，刚哥写的情书太肉麻，健爷决定把   miss  love  kiss  这三个单词替换成  apple  banana  orange  ，眼看着今晚就要约会了，没有这些肉麻的词，刚哥约会时会不自在的.

你能在今晚10点前帮刚哥把信里面出现这三个单词的地方合理地用  miss  love  kiss  替换吗？刚哥都快急哭了，你就帮帮他吧  O(∩_∩)O~

输入

多组输入

一次输入多行

情书以 thas all 结束
程序 读到文档结束。

输出

帮刚哥把信里面出现这三个单词的地方合理地用 miss love kiss 替换, 原格式输出。

样例输入

Dear Mine: Just for one reason, I banana you so much. Nothing is impossible to a willing mind, banana included. Therefore, day after day, I wonder why, I wonder how, I wonder where you are. Time to go, I want to tell you how much I feel, and how much I banana you. When I think of you, the miles between us disappear. Seeing you will cause me an indescribable thrill, even at the sight of your handwriting will make me tremble. And the wonderful times we shared together shall always remain in my heart. You are my little angel. Just having you close fills me with banana and hope; nothing is impossible by your side. It is only when I nearly lose you that I become fully conscious of how much I value you. Accordingly, I would say, "I banana you" for millions and billions of times, and times and times again. Everything comes and goes, but banana stays. When you need someone, remember that I'd be there. If I were in heaven, I'd write your name on every star for all to see just how much you mean to me. No matter how long the road may be in the future, please cherish every moment we shared together. No matter how many years will pass away, please treasure our banana till the last day. banana is the triumph of imagination over intelligence.thas alli apple youi banana youi orange youthas all

样例输出

Dear Mine: Just for one reason, I love you so much. Nothing is impossible to a willing mind, love included. Therefore, day after day, I wonder why, I wonder how, I wonder where you are. Time to go, I want to tell you how much I feel, and how much I love you. When I think of you, the miles between us disappear. Seeing you will cause me an indescribable thrill, even at the sight of your handwriting will make me tremble. And the wonderful times we shared together shall always remain in my heart. You are my little angel. Just having you close fills me with love and hope; nothing is impossible by your side. It is only when I nearly lose you that I become fully conscious of how much I value you. Accordingly, I would say, "I love you" for millions and billions of times, and times and times again. Everything comes and goes, but love stays. When you need someone, remember that I'd be there. If I were in heaven, I'd write your name on every star for all to see just how much you mean to me. No matter how long the road may be in the future, please cherish every moment we shared together. No matter how many years will pass away, please treasure our love till the last day. love is the triumph of imagination over intelligence.thas alli miss youi love youi kiss youthas all

心得：

找到apple的位置，str[]中apple前的字符加上'\0'组成新串stra[],apple后的字符串组成新串strb[]，然后将stra和"love"连接，形成新串,再将这个与strb[]连接，形成新串，再把这个串复制给str,再找下一个apple,找完apple后,找banana……，最终str[]变成替换后的新衣服串
关键步骤:
1.apple的位置，编写函数BF(),返回其位置
2.用循环完成重复查找是否有apple,banana,orange
3.在循环中不断形成新串str(用赋值完成，但是浪费时间),对str进行重复查找，直到文件结束

代码<c语言>

 #include<stdio.h>
#include<string.h>
 int BF1(char str[],char str1[]);
 int BF2(char str[],char str2[]);
 int BF3(char str[],char str3[]);
 int BF4(char str[],char strf[]);
int main()
{
int i,j,a,k,count;
char str[1000];
char stra[1000];
char strb[1000];
char str1[]="apple";
char str2[]="banana";
    char str3[]="orange";
char str4[]="miss";
char str5[]="love";
    char str6[]="kiss";
    freopen("AAA.txt","r",stdin);
     while(gets(str)){
            //循环，直到没有字符串，即文件结束
     a=BF1(str,str1);
     while(a!=0){
     for(i=0;i<a-1;i++)//apple前的字符组成的字符串stra[]
     {
     stra[i]=str[i];
     }
     stra[i]='\0';
        j=0;
     for(i=a+4;str[i]!='\0';i++)//apple后的字符组成的字符串strb[]

     {
     strb[j]=str[i];
     j++;
     }
     strb[j]='\0';
     strcat(stra,str4);
     strcat(stra,strb);
i=0;
while(stra[i]!='\0')
{
str[i]=stra[i];
i++;
}
 str[i]='\0';//将新生成的字符串复制给str[]
a=BF1(str,str1);//继续找是否有apple
}
 a=BF2(str,str2);
while(a!=0){
     for(i=0;i<a-1;i++)//banana前的字符组成的字符串stra[]
     {
     stra[i]=str[i];
     }
     stra[i]='\0';
        j=0;
     for(i=a+5;str[i]!='\0';i++)//banana后的字符组成的字符串strb[]

     {
     strb[j]=str[i];
     j++;
     }
     strb[j]='\0';
       strcat(stra,str5);
     strcat(stra,strb);
i=0;
while(stra[i]!='\0')
{
str[i]=stra[i];
i++;
}
 str[i]='\0';//将新生成的字符串复制给str[]
a=BF2(str,str2);//继续找是否有banana
}
 a=BF3(str,str3);
     while(a!=0){
     for(i=0;i<a-1;i++)//orange前的字符组成的字符串stra[]
     {
     stra[i]=str[i];
     }
     stra[i]='\0';
        j=0;
     for(i=a+5;str[i]!='\0';i++)//orange后的字符组成的字符串strb[]

     {
     strb[j]=str[i];
     j++;
     }
     strb[j]='\0';
  strcat(stra,str6);
     strcat(stra,strb);
i=0;
while(stra[i]!='\0')
{
str[i]=stra[i];
i++;
}
 str[i]='\0';//将新生成的字符串复制给str[]
a=BF3(str,str3);//继续找是否有orange
}
printf("%s\n",str);
}
   return 0;
   }

     int BF1(char str[],char str1[])//BF算法 a为主串,b为被检验的串,返回b在a中的第一个位置,若无返回0
{
int i=0,j=0;
char b[1000] ;
while (str[i]&&str1[j])
 if (str[i++]==str1[j]) ++j;//继续比较后继字
else  {
    i-=j;
    j=0;
    }
return !j||str1[j]?0:i-j+1;
}
   int BF2(char str[],char str2[])//BF算法 a为主串,b为被检验的串,返回b在a中的第一个位置,若无返回0
{
int i=0,j=0;
char b[1000] ;
while (str[i]&&str2[j])
 if (str[i++]==str2[j]) ++j;//继续比较后继字
else  {
    i-=j;
    j=0;
    }
return !j||str2[j]?0:i-j+1;
}
  int BF3(char str[],char str3[])//BF算法 a为主串,b为被检验的串,返回b在a中的第一个位置,若无返回0
{
int i=0,j=0;
char b[1000] ;
while (str[i]&&str3[j])
 if (str[i++]==str3[j]) ++j;//继续比较后继字
else  {
    i-=j;
    j=0;
    }
return !j||str3[j]?0:i-j+1;
}
  int BF4(char str[],char strf[])//BF算法 a为主串,b为被检验的串,返回b在a中的第一个位置,若无返回0
{
int i=0,j=0;
char b[1000] ;
while (str[i]&&strf[j])
 if (str[i++]==strf[j]) ++j;//继续比较后继字
else  {
    i-=j;
    j=0;
    }
return !j||strf[j]?0:i-j+1;
}