One day, liouzhou_101 got a chat record of Freda and Rainbow. Out of curiosity, he wanted to know which sentences were said by Freda, and which were said by Rainbow. According to his experience, he thought that Freda always said "lala." at the end of her sentences, while Rainbow always said "miao." at the beginning of his sentences. For each sentence in the chat record, help liouzhou_101 find whose sentence it is.
The first line of the input contains an integer n (1 ≤ n ≤ 10), number of sentences in the chat record. Each of the next n lines contains a sentence. A sentence is a string that contains only Latin letters (A-Z, a-z), underline (_), comma (,), point (.) and space ( ). Its length doesn’t exceed 100.
For each sentence, output "Freda's" if the sentence was said by Freda, "Rainbow's" if the sentence was said by Rainbow, or "OMG>.< I don't know!" if liouzhou_101 can’t recognize whose sentence it is. He can’t recognize a sentence if it begins with "miao." and ends with "lala.", or satisfies neither of the conditions.
5 I will go to play with you lala. wow, welcome. miao.lala. miao. miao .
Freda's OMG>.< I don't know! OMG>.< I don't know! Rainbow's OMG>.< I don't know!
解题说明:此题需要对一个字符串中判断前后字串,每个人对应不同的字符串,注意特征叠加的情况,这时无法判断。这里用到一个函数strstr,该函数功能是在串中查找指定字符串的第一次出现的字符串(包括后面所有的字符串),在本题中,strstr(s,"miao.")就是返回以第一个miao.开头直到结尾的的整个子串。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include<set>
#include <algorithm>
using namespace std;
int main()
{
int i,n;
int k,length;
char s[1000];
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)
{
gets(s);
k=0;
length=strlen(s);
if(length>4 && strcmp(s+length-5,"lala.")==0)
{
k++;
}
if(strstr(s,"miao.")==s)
{
k+=10;
}
if(k==1)
{
printf("Freda's\n");
}
else if(k==10)
{
printf("Rainbow's\n");
}
else
{
printf("OMG>.< I don't know!\n");
}
}
return 0;
}