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 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字符串匹配，match函数用于计算子串出现次数，直接在主函数中计算next函数

<pre name="code" class="cpp">#include<cstdio>
#include<cstring>
#define maxw 10010
#define maxt 1000010
char w[maxw],t[maxt];
int next[maxw];
void getn()//写成函数降为94MS
{
    int i=0,j=-1;
    next[0]=-1;
    while(w[i])
    {
        if(j==-1||w[i]==w[j])
        {
            i++;//i指后缀
            j++;//j指前缀
            next[i]=j;
        }
        else
        {
            j=next[j];
        }
    }
}
int match()
{
    int i=0,j=0,s=0;
    int wlen=strlen(w),tlen=strlen(t);
    while(i<tlen)
    {
        if(w[j]==t[i])
        {
            i++;
            j++;
        }
        else if(j>=0)
        {
            j=next[j];
        }
        else
        {
            i++;
            j=0;
        }
        if(j==wlen)
        {
            s++;
            j=next[j];
        }
    }
    return s;
}
int main()
{
    int i,n,p;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s%s",w,t);
        getn();
/*      next[0]=-1,next[1]=0;
        p=0;
        for(i=2;i<=strlen(w);i++)
        {
            while(p>=0&&w[p]!=w[i-1])
            p=next[p];
            next[i]=++p;
        }*/
        printf("%d\n",match());
    }
    return 0;
}