hdu

http://acm.hdu.edu.cn/showproblem.php?pid=5007

 1 #include<iostream>
 2 #include<stdio.h>
 3 #include<string.h>
 4 #include<string>
 5 #include<stack>
 6 #include<queue>
 7 #include<map>
 8 #include<set>
 9 #include<vector>
10 #include<math.h>
11 #include<climits>
12 using namespace std;
13 #define lson 2*i
14 #define rson 2*i+1
15 #define LS l,mid,lson
16 #define RS mid+1,r,rson
17 #define UP(i,x,y) for(i=x;i<=y;i++)
18 #define DOWN(i,x,y) for(i=x;i>=y;i--)
19 #define MEM(a,x) memset(a,x,sizeof(a))
20 #define W(a) while(a)
21 #define gcd(a,b) __gcd(a,b)
22 #define LL long long
23 #define N 200005
24 #define INF 0x3f3f3f3f
25 #define EXP 1e-8
26 #define lowbit(x) (x&-x)
27 const int mod = 1e9+7;
28 const int L = 10005;
29 
30 int main()
31 {
32     //freopen("a.txt","r",stdin);
33    string s;
34    while(getline(cin,s))
35    {
36        int l=s.length();
37        for(int i=0;i<l;i++)
38        {
39            if(s[i]=='A'&&(i+1<l&&s[i+1]=='p')&&(i+2<l&&s[i+2]=='p')&&(i+3<l&&s[i+3]=='l')&&(i+4<l&&s[i+4]=='e'))
40               cout<<"MAI MAI MAI!"<<endl;
41            else if(s[i]=='i'&&(i+1<l&&s[i+1]=='P')&&(i+2<l&&s[i+2]=='h')&&(i+3<l&&s[i+3]=='o')&&(i+4<l&&s[i+4]=='n')&&(i+5<l&&s[i+5]=='e'))
42               cout<<"MAI MAI MAI!"<<endl;
43             else if(s[i]=='i'&&(i+1<l&&s[i+1]=='P')&&(i+2<l&&s[i+2]=='o')&&(i+3<l&&s[i+3]=='d'))
44               cout<<"MAI MAI MAI!"<<endl;
45            else if(s[i]=='i'&&(i+1<l&&s[i+1]=='P')&&(i+2<l&&s[i+2]=='a')&&(i+3<l&&s[i+3]=='d'))
46               cout<<"MAI MAI MAI!"<<endl;
47             else if(s[i]=='S'&&(i+1<l&&s[i+1]=='o')&&(i+2<l&&s[i+2]=='n')&&(i+3<l&&s[i+3]=='y'))
48               cout<<"SONY DAFA IS GOOD!"<<endl;
49        }
50    }
51 }
原文地址:https://www.cnblogs.com/nowandforever/p/4720225.html