ZOJ 17届校赛 Knuth-Morris-Pratt Algorithm( 水题)

In computer science, the Knuth-Morris-Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.

Edward is a fan of mathematics. He just learnt the Knuth-Morris-Pratt algorithm and decides to give the following problem a try:

Find the total number of occurrence of the strings "cat" and "dog" in a given string s.

As Edward is not familiar with the KMP algorithm, he turns to you for help. Can you help Edward to solve this problem?

Input

There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 30), indicating the number of test cases. For each test case:

The first line contains a string s (1 ≤ |s| ≤ 1000).

Output

For each case, you should output one integer, indicating the total number of occurrence of "cat" and "dog" in the string.

Sample Input

7
catcatcatdogggy
docadosfascat
dogdddcat
catcatcatcatccat
dogdogdogddddooog
dcoagtcat
doogdog

Sample Output

4
1
2
5
3
1
1

Hint

For the first test case, there are 3 "cat" and 1 "dog" in the string, so the answer is 4.

For the second test case, there is only 1 "cat" and no "dog" in the string, so the answer is 1.

 水题

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
using namespace std;

char  a[1005];

int main()
{
    int T,len,sum,i;
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%s",&a);
            len=strlen(a);
            sum=0;
            for(i=0;i<len-2;i++)
            {
                if(a[i]=='c'&&a[i+1]=='a'&&a[i+2]=='t')
                    sum++;
                else if(a[i]=='d'&&a[i+1]=='o'&&a[i+2]=='g')
                    sum++;
            }
            printf("%d
",sum);
        }
    }
    return 0;
}