Oulipo

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

 很明显的kmp，

 就是检测a字符串在b字符串出现的次数。

如果按照暴力的做法，肯定会超时，这时可以用kmp，next数组（小提示，如果在c++环境下，不要设为next[],因为它有被定义过了），就是利用已经比较后知道的字符，来节约时间。

next数组里装的是字符串的前缀和后缀相等的（前缀结束的）下标，

比如abbab

里面分别装的是-1，-1，-1,0,1，

方便母字符串对比，为了在后面比对的时候跳到之前比对好的地方。因为子字符串会有重复的地方，可以在比较的时候再不相同的时候跳到相同的位置。

#include<stdio.h>
#include<string.h>
using namespace std;
int sum=0;
int nextt[1000010];
char str1[1000010],str2[1000010];
 
void Next(char *str,int nex[])
{
    int k=strlen(str);
    nex[0]=-1;
    int i=0,j=-1;
    while (i<k)
    {
        if (j==-1||str[i]==str[j])
        {
            i++;
            j++;
            nex[i]=j;
        }
        else
            j=nex[j];
    }
}
 
void kmp(char *str1,char *str2)
{
    int k=strlen(str1);
    int k2=strlen(str2);
    Next(str2,nextt);
    int i=0,j=0;
    while (i<k)
    {
        if (j==-1||str1[i]==str2[j])
        {
            i++;
            j++;
            if (j==k2)
            {
                sum++;
                j=nextt[j];
            }
        }
        else
            j=nextt[j];
    }
 
}
 
int main()
{
    int n;
    scanf("%d",&n);
    while (n--)
    {
        sum=0;
        scanf("%s%s",str2,str1);
        kmp(str1,str2);
        printf("%d\n",sum);
    }
    return 0;
}