【POJ3461】Oulipo

                                                    Oulipo

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 48998		Accepted: 19480

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

 

解析：

       字符串哈希或KMP均可。

 

代码（字符串哈希）：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
using namespace std;

const int Max=1000010;
int n,m,ans,t;
unsigned long long Pow[Max],hash1[Max],hash2[Max];
char  ch1[Max],ch2[Max];

inline void solve()
{
	Pow[0]=1;
	for(int i=1;i<=m;i++)
	{
	  hash2[i] = hash2[i-1] * 131 + (ch2[i]-'a'+1);
	  Pow[i] = Pow[i-1] * 131;
	}
	Pow[0]=1;
	for(int i=1;i<=n;i++)
	{
	  hash1[i] = hash1[i-1] * 131 + (ch1[i]-'a'+1);
	  Pow[i] = Pow[i-1] * 131;
	  if(i>=m && hash1[i] - hash1[i-m]*Pow[m] == hash2[m]) ans++;
	}
}

int main()
{
	scanf("%d",&t);
	while(t--)
	{ 
	  ans=0;
	  scanf("%s",ch2+1);
	  m=strlen(ch2+1); 
	  scanf("%s",ch1+1);
	  n=strlen(ch1+1);
	  solve();
	  cout<<ans<<"\n";
	}
}