uva LA 3026 Period （KMP算法）

#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
using namespace std;
int f[1000005];

int main()
{
	//freopen("ztest.txt","r",stdin);
	int n;
	int flag = 1;
	int t = 1;
	while(scanf("%d", &n) && n)
	{
		
		printf("Test case #%d\n", t++);
		memset(f, 0, sizeof(f));
		string temp;
		cin >> temp;
		for(int i = 1; i < temp.size(); i++)
		{
			int j = f[i];
			while(j && temp[i] != temp[j])	j = f[j];
			f[i+1] = (temp[i] == temp[j] ? j+1 : 0);
		}
		for(int i = 2; i <= temp.size(); i++)
		{
			if(f[i]> 0 && i%(i-f[i]) == 0)
				printf("%d %d\n", i, i/(i-f[i]));
		}
		printf("\n");
	}
	return 0;
}