hdu5007 字符串处理，水题

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
using namespace std;
#define INF 1000000000
#define maxn
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define mset(x) memset(x,0,sizeof(x))
typedef __int64 ll;

string str, tmp;
int main(){
//    freopen("a.txt","r",stdin);
//    freopen(".out","w",stdout);
    while( cin>>str ){
        if(str.length()<4)
            continue;
        for(int i=0; i<str.length(); i++)
        {
            if(str[i]=='A')
            {
                tmp = str.substr(i, 5);
                if(tmp == "Apple")
                    puts("MAI MAI MAI!");
            }
            else if(str[i]=='i'){
                tmp = str.substr(i, 4);
                if(tmp == "iPad" || tmp == "iPod"){
                    puts("MAI MAI MAI!");
                    continue;
                }
                tmp = str.substr(i, 6);
                if(tmp == "iPhone")
                    puts("MAI MAI MAI!");
            }
            else if(str[i]=='S'){
                tmp=str.substr(i, 4);
                if(tmp == "Sony")
                    puts("SONY DAFA IS GOOD!");
            }
        }    
    }
    return 0;
}

/*
DESCRIPTION:
"Apple" = 5
"iPad" = 4
"iPhone" = 6
"iPod" = 4
"Sony"
*/