ZOJ 3957 Knuth-Morris-Pratt Algorithm

暴力。

#include<bits/stdc++.h>
using namespace std;

char s[];

int main()
{
    int T; scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        int ans=;
        int len=strlen(s);
        for(int i=;i<len-;i++)
        {
            if(s[i]=='d'&&s[i+]=='o'&&s[i+]=='g') ans++;
            if(s[i]=='c'&&s[i+]=='a'&&s[i+]=='t') ans++;
        }
        printf("%d\n",ans);
    }
    return ;
}