poj 3461 【KMP求模式串在匹配串中的出现次数 】

Oulipo

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 46123		Accepted: 18388

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

板子题，让自己回忆一下模板

#include<stdio.h>
#include<string.h>
const int maxn =  1000010;
char vis2[maxn],vis1[maxn];
int next[maxn];
int n,m,t,ans;
void get_next(int *n,char *b)
{
	int i,j;
	i = 0;
	n[0] = j = -1;
	while(i < m)
	{
		while(j!=-1&&b[i] != b[j])
		{
			j = next[j];
		}
		next[++i] = ++j;
	}
	return;
}
int kmp(char *vis1,char *vis2)
{
	int i,j;
	i = j = 0;
	while(i < n)
	{
		while(j!=-1&&vis1[i]!=vis2[j])
			j = next[j];
		if(j == m-1)
		{
			ans ++;
			j = next[j];
		}
		i ++;
		j ++;
	}
	return ans;
}
int main()
{
	
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		ans = 0;
		
		scanf("%s",vis2);
		scanf("%s",vis1);
		n = strlen(vis1);
		m = strlen(vis2);
		get_next(next,vis2);
		kmp(vis1,vis2);
		printf("%d\n",ans);
	}
	return 0;
}