POJ 3461  Oulipo

Oulipo

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8508		Accepted: 3338

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

Source

BAPC 2006 Qualification

KMP,基本没弄明白，只是照着学长的自己敲了一遍

代码：

C语言: 临时自用代码

#include<stdio.h>
#define M 100010
char  s [ M ], t [ M ];
int  next [ M ], sum;
void  getNext() //求next数组
{
        int  i , j;
        next [ 0 ] =- 1;
        for( i = 1 , j =- 1;s [ i ]; i ++ ){
                while( j !=- 1 &&s [ i ] !=s [ j + 1 ])
                        j = next [ j ]; //从s[j+1]开始找与s[i]相同的字母
                if(s [ j + 1 ] ==s [ i ])
                        j ++;
                next [ i ] = j; //如果找到相同字母，next[i]记录此位置,否则next[i]=next[i-1]
        }
}
void  kmp()
{
        int  i , j;
        sum = 0;
        getNext();
        for( i = 0 , j =- 1; t [ i ]; i ++ ){
                while( j !=- 1 &&s [ j + 1 ] != t [ i ])
                        j = next [ j ]; //按next[j]后退找出与t[i]相同的s[j+1]
                if(s [ j + 1 ] == t [ i ])
                        j ++; //如果找到则向后前进
                if( !s [ j + 1 ]){ //如果在t中找到完整的s
                        sum ++; //计数增1
                        j = next [ j ]; //按next后退
                }
        }
}
int  main()
{
        int  T;
        scanf( "%d" , & T);
        while( T -- ){
                scanf( "%s%s" ,s , t);
                kmp();
                printf( "%d \n " , sum);
        }
        return  0;
}