POJ3461 Oulipo【KMP】

Oulipo

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 50438		Accepted: 20010

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

问题链接：POJ3461 Oulipo

问题描述：问模式串在文本串中出现的次数

解题思路：KMP算法模板题

AC的C++程序：

#include<iostream>
#include<cstring>
 
using namespace std;
 
const int N=1000010;
char s[N],p[N];
int next[N];
 
//求next数组 p为模式串 
void GetNext(char *p,int next[])
{
	int plen=strlen(p);
	next[0]=-1;
	int k=-1,j=0;
	while(j<plen)
	{
		//p[k]表示前缀 p[j]表示后缀
		if(k==-1||p[k]==p[j])
		{
			k++;
			j++;
			if(p[k]!=p[j])
			  next[j]=k;
			else //因为不能出现p[j]=p[next[j]],所以当出现时需要继续递归
			  next[j]=next[k]; 
		}
		else
		  k=next[k]; 
	}
}
//s文本串，p模式串 
int KMP(char *s,char *p)
{
	GetNext(p,next);
	int i=0,j=0,slen=strlen(s),plen=strlen(p),count=0;
	while(i<slen)
	{
		while(i<slen&&j<plen)
		{
			if(j==-1||s[i]==p[j])
		  	  i++,j++;
			else
		  	  j=next[j];
		}
		if(j==plen)//匹配成功 
		{
			count++;
			j=next[j]; //进行下次匹配 
		}
	}
	return count;
} 
 
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s%s",&p,&s);
		printf("%d\n",KMP(s,p));
	}
	return 0;
}