hdu1358 Period kmp求字符串循环节

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
using namespace std;
#define INF 1e9
#define maxn 1000010
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define mset(x) memset(x,0,sizeof(x))

int m, ks=1;
char s[maxn];
int f[maxn];

void getfail(char* P, int* f){
	f[0] = 0, f[1] = 0;
	for(int i=1; i<m; i++){
		int j=f[i];
		while(j && P[i]!=P[j])	j = f[j];
		f[i+1] = P[i]==P[j] ? j+1 : 0;
	}
}

int main(){
//	freopen("a.txt","r",stdin);
//	freopen(".out","w",stdout);
	while(cin>>m && m){
		scanf("%s", s);
		printf("Test case #%d\n", ks++);
		mset(f);
		getfail(s, f);
		for(int i=2; i<=m; i++){
			if(f[i] && i%(i-f[i])==0 )
				cout<<i<<" "<<i/(i-f[i])<<endl;
		}
		puts("");
	}
	return 0;
}