H - 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

题意概括  :

给出两个字符串，判断第一个字符串在第二个字符串中出现的次数。

解题思路  :

首先求出第一个字符串的next数组，然后两个字符串进行比较，如果第一个字符串下标达到长度，则次数加一，并且控制第二个字符串的下标返回到对应上一个next数组的值。

#include<stdio.h>
#include<string.h>

int next[10010];
char a[10010],str[1000100];

void get(char a[])
{
	int i,j,len;
	i = 1;
	j = 0;
	next[0] = 0;
	len = strlen(a);
	while(i < len)
	{
		if(j == 0&&a[i]!=a[j])
		{
			i ++;
		}
		if(j > 0&&a[i]!=a[j])
		{
			j = next[j-1];
		}
		if(a[i] == a[j])
		{
			next[i] = j+1;
			j ++; 
			i ++;
		}
	}
}
int KMP(char a[],char str[])
{
	int i,j,lena,lenstr,sum = 0;
	lena = strlen(a);
	lenstr = strlen(str);
	i = 0;
	j = 0;
	sum = 0;
	while(i<=lena&&j<lenstr)
	{
		if(a[i] == str[j])
		{
			i ++;
			j ++;
			if(i == lena)
			{
				i = next[i-1];
				sum ++;
			}
		}
		if(i>0&&a[i]!=str[j])
		i = next[i-1];
		if(i == 0&&a[i]!=str[j])
		{
			j ++;
		}
	}
	return sum;
}
int main()
{
	int n,t;
	scanf("%d",&n);
	
	while(n --)
	{
		memset(next,0,sizeof(next));
		scanf("%s",a);
		scanf("%s",str);
		get(a);
		t = KMP(a,str);
		printf("%d\n",t);
	}
	return 0;
}