【字符串hash】poj-1961

 

 kmp还没琢磨明白，先用hash写写

#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=1e6+10;
//输出周期串长度和循环节的循环次数 
ull hash[MAXN];
ull p[MAXN];
int tim=1;
map<int,int>ans;
signed main(){
	moomoon;
	int n;
	while(cin>>n){
		if(n==0)break;
		string a,ss;
		memset(hash,0,sizeof(hash));
		memset(p,0,sizeof(p));
		ss.erase();
		ans.clear();
		cin>>a;
		ull len=a.length();
		ss='#'+a;
		p[0]=1;
		for(int i=1;i<=len;i++){
			hash[i]=hash[i-1]*131+ss[i]-'a'+1;
			p[i]=p[i-1]*131;
		}//hash预处理
		 
		for(int k=1;k<=(len+1)/2;k++){//k代表当前字符串长度 
			
			for(int i=2;i*k<=len;i++){//枚举k的i倍长度的子串，显然如果k的i-1倍长度的串是周期串的话，那k的i倍长度的串也是周期串 
				if(hash[k]==hash[i*k]-hash[i*k-k]*p[k]){
					ans.insert(make_pair(i*k,i));
				}
				else break;
			}
			
		}
		cout<<"Test case #"<<tim<<endl;
		tim++;
		map<int,int>::iterator pos;
		for(pos=ans.begin();pos!=ans.end();pos++){
			cout<<pos->first<<" "<<pos->second<<endl;
		}
		cout<<endl;
		
	}


}