POJ3461——经典哈希（求可重叠串个数）

题目链接：http://poj.org/problem?id=3461

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

题目理解：

求字符串T出现了多少个(可重叠）S,

其实是很经典的kmp的题型，不过用哈希也可以做。

哈希处理一下，之后枚举符合条件的串就行了。

#include <iostream>
#include<cstring>
#include<cstdio>
#include<string>
#define ull unsigned long long 
using namespace std;
const int P=999983;
const int maxn=1e6+7;
char s[maxn];
char T[maxn];
ull hash[maxn];
ull p[maxn];
int main(int argc, char** argv) {
	int t;
	scanf("%d",&t);
	p[0]=1; 
	for(int i=1;i<=maxn;++i)
		p[i]=p[i-1]*P;
	while(t--){
		scanf("%s%s",s+1,T+1);
		int len=strlen(T+1);
		for(int i=1;i<=len;++i)
			hash[i]=hash[i-1]*P+T[i];
		int len2=strlen(s+1);
		ull s1=0;
		for(int i=1;i<=len2;++i)
			s1=s1*P+s[i];
		int ans=0;
		for(int i=0;i+len2<=len;++i){
			ull x=hash[i+len2]-hash[i]*p[len2];
			if(s1==x) ans++;
		}
			
		printf("%d\n",ans);
	}
	return 0;
}