poj 3461 Oulipo

Description

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 wordW and a text T, count the number of occurrences of W inT. All the consecutive characters of W must exactly match consecutive characters ofT. 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 stringW).
• 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 wordW in the text T.

Sample Input

3BAPCBAPCAZAAZAZAZAVERDIAVERDXIVYERDIAN

Sample Output

130

#include <iostream>#include <cstdio>#include <cmath>#include <cstring>using namespace std;int next[10010],sum=0;void get_next(char *p){    int j,k,plen=strlen(p);    memset(next,0,sizeof(next));    next[0]=-1;    j=0;    k=-1;    while(j<plen)    {        if(k==-1||p[j]==p[k])        {            j++;            k++;            next[j]=k;        }        else            k=next[k];    }}void KMPMatch(char *s,char *p){    int i=0,j=0,slen=strlen(s),plen=strlen(p);    get_next(p);    while(i<slen)    {        if(j==-1||s[i]==p[j])        {            i++;            j++;        }        else        {            j=next[j];        }        if(j==plen)            sum++,j=next[j];    }}int main(){    char S[10010],T[1000100];    int n;    scanf("%d",&n);    while(n-- )    {        scanf("%s%s",S,T);        sum=0;        KMPMatch(T,S);        printf("%d\n",sum);    }    return 0;}