Oulipo kmp

---恢复内容开始---

B - Oulipo

The French author Georges Perec (1936�C1982) 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

//
//  main.cpp
//  pat
//
//  Created by dada on 2017/3/6.
//  Copyright © 2017年 dada. All rights reserved.
//

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

using namespace std;

char a[10005],b[1000005];
int nexta[10005];

void getNext()
{
    nexta[0]=-1;
    int i = 0,j = -1,lena=strlen(a);
    while(i < lena)
    {
        if(j==-1 || a[i]==a[j])
        {
            i++,j++;
            nexta[i]=j;
        }
        else
            j=nexta[j];
        
    }
}

int solve()
{
    int i = 0,j = 0,ans=0,lenb=strlen(b),lena=strlen(a);
    while(i<lenb)
    {
        if(j==-1 || a[j]==b[i])
        {
            if(j==lena-1)
            {
                //i=i-nexta[j],j=0; 这样写TLE
                ans++;
                j=nexta[j];
            }
            else
                i++,j++;
        }
        else
            j=nexta[j];
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s%s",&a,&b);
        getNext();
        printf("%d
",solve());
    }
    return 0;
}

---恢复内容结束---