HDU_1686_POJ_3461_Oulipo

Oulipo

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8752    Accepted Submission(s): 3534

Problem 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 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

3BAPCBAPCAZAAZAZAZAVERDIAVERDXIVYERDIAN

 

Sample Output

130

 

Source

华东区大学生程序设计邀请赛_热身赛

 

Recommend

lcy

输入两个串计算第一个串在第二个串中出现的次数

KMP不在第一次找到时跳出，而且需要记下数

#include <iostream>#include <stdio.h>#include <string>#include <string.h>using namespace std;const int MN=1e6+5;const int MM=1e4+5;char s1[MN],s2[MM];int nex[MM];int f;void getnext(int m){    int j=0,k=-1;    nex[0]=-1;    while(j<m)    {        if(k==-1||s2[k]==s2[j])            nex[++j]=++k;        else            k=nex[k];    }}void getp(int m,int n){    int j=0,k=0;    while(j<n)    {        if(k==-1||s2[k]==s1[j])        {            k++;j++;            if(k==m)            {                f++;                k=nex[k];            }        }        else            k=nex[k];    }    if(k==m)    {        f++;        k=0;    }}int main(){    int t;    int n,m;    scanf("%d",&t);    while(t--)    {        f=0;        memset(nex,0,sizeof(nex));        scanf("%s%s",s2,s1);        m=strlen(s2);        n=strlen(s1);        getnext(m);        getp(m,n);        //for(int i=0;i<10;i++)        //   cout<<i<<" "<<nex[i]<<endl;        printf("%d\n",f);    }    return 0;}