Oulipo

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的简单运用；

 

代码： 

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int fail[10050];
char temp[10050],str[1000050];

void getFail(int n) {					//n表示短字符串的长度
  int i = 0, j = -1;						//i表示短字符串当前位置，j表示当前位置之前的部分前缀和后缀相同的个数-1
	fail[0] = -1;							//fail数组表示当前位置匹配失败后从短字符串之前哪个位置继续匹配
	while(i < n) {
		if(j==-1 || temp[i]==temp[j])		//temp数组用来存储短字符串
		{
			++i, ++j;
			if(temp[i] != temp[j]) fail[i] = j;
			else fail[i] = fail[j];
		}
		else j = fail[j];
	}
}
int kmp(int n, int m) {				//n表示长字符串的长度，m表示短字符串的长度
	int res = 0;						//res表示长字符串中有多少个短字符串
	int i = 0, j = 0;					//i表示长字符串当前位置，j表示短字符串当前位置
	while(i < n) {
		if(j==-1 || str[i]==temp[j]) {	//temp存储短字符串，str存储长字符串
			++i, ++j;
			if(j == m) {    //当发现长字符串中有一个短字符串时
				++res;
				//i=i-fail[j];
				j = fail[j];
			}
		}
		else j = fail[j];
	}
	return res;
}

int main()
{
    int t;
    cin>>t;
    int f=1;
    while(t--)
    {
        if(f)
        {
            getchar();
            f=0;
        }
        gets(temp);
        gets(str);
        int m,n;
        m=strlen(temp);
        n=strlen(str);
        getFail(m);
        cout<<kmp(n,m)<<endl;
    }
    return 0;
}