【字符串hash】poj2752

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<queue>
#define ull unsigned long long 
#define ll long long
#define int long 
#define moomoon ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int MAXN=5e5+10;
ull hash[MAXN];
ull p[MAXN];
signed main(){
	//字符串hash函数一般有输入的string串，一个hash数组用来记录hash值，一个p数组用来记录p的i次
	string a;
	while(cin>>a){
	string ss;
	ss.erase();
	ull len=a.length();
	ss='#'+a;
	p[0]=1;
	for(int i=1;i<=len;i++){
		hash[i]=hash[i-1]*13331+ss[i]-'a'+1;
		p[i]=p[i-1]*13331;
	}
	for(int i=1;i<=len;i++){
		if(hash[i]==hash[len]-hash[len-i]*p[i]){
			cout<<i<<" ";
		}
	}
	cout<<endl;
}
}