bnuoj 33647 Angry Grammar Nazi(字符串)

http://www.bnuoj.com/bnuoj/problem_show.php?pid=33647

【题意】:字符串匹配，暴力配就行了

【题解】：截出单词，然后进行匹配就行了

【code】：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

char tstr[100][100];

int main()
{
    int t;
    scanf("%d",&t);
    getchar();
    while(t--)
    {
        char str[1000];
        char ss[100];
        gets(str);
        int len = strlen(str);
        int i,j=0,k=0,flag=1;
        for(i=0;i<len;i++)
        {
            if(str[i]==' ')
                continue;
            while(i<len)
            {
                tstr[j][k]=str[i];
              //cout<<str[i];
                k++;
                i++;
                if(i>=len||str[i]==' ')
                {
                    break;
                }

            }
            tstr[j][k]='\0';
            j++;
            k=0;
        }
       // for(i=0;i<j;i++)cout<<tstr[i]<<endl;
        int size = j;
        int ans = 0;
        for(i=0;i<size;i++)
        {
            if(strcmp(tstr[i],"u")==0||strcmp(tstr[i],"ur")==0)
            {
                ans++;
            }
            else if(strcmp(tstr[i],"should")==0&&i+1<size&&strcmp(tstr[i+1],"of")==0)
            {
                ans++;
            }
            else if(strcmp(tstr[i],"would")==0&&i+1<size&&strcmp(tstr[i+1],"of")==0)
            {
                ans++;
            }
        }
     //   cout<<tstr[0]<<endl;
        for(i=0;i<size;i++)
        {
            int len = strlen(tstr[i]);
            for(j=0;j<len-2;j++)
            {
                if(tstr[i][j]=='l'&&tstr[i][j+1]=='o'&&tstr[i][j+2]=='l')
                {
                    ans++;
                    break;
                }
            }
        }
        printf("%d\n",ans*10);
    }
    return 0;
}