Oulipo（KMP）

The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…

Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.

So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.

Input

The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

• One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
• One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.

Output

For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.

Sample Input

3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

Sample Output

1
3
0

题意：T组数组，每组数组两个字符串，求第一个字符串在第二个字符串中出现的次数。

思路:KMP模板...

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 1000010
using namespace std;
char s[N],t[N];
int next[N];
void getnext(int l)//求模式串的next数组
{
    next[0]=-1;
    next[1]=0;
    int i=1,k=0;
    while(i<l)
    {
        if(k<0||s[i]==s[k])
            next[++i]=++k;
        else
            k=next[k];
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s %s",s,t);
        int l1=strlen(s);
        int l2=strlen(t);
        getnext(l1);
        int ans=0;
        int i=0,k=0;
        while(i<l2)//利用next数组，减少重复匹配
        {
            if(k<0||t[i]==s[k])//匹配上了，两者都 +1
                i++,k++;
            else //失配的话，更新 k
                k=next[k];
            if(k==l1)//完全匹配
            {
                ans++;//次数 +1 
                k=next[k];  //当作失配处理
            }
        }
        printf("%d\n",ans);
    }
}