poj 1961 Period kmp基础

基础kmp 算是入门题

#include<iostream>
using namespace std;
#define max 1000001
char a[max];
int next[max];
void kmp(int n)
{
	int j=-1,i;
	next[0]=-1;
	for(int i=1;i<n;i++)
	{
		while(j>=0&&a[i]!=a[j+1])
		j=next[j];
		if(a[i]==a[j+1])
		j++;
		next[i]=j;
	}
	return ;
}
int main()
{
	int t=1;
	int n;
	while(scanf("%d",&n)!=EOF,n)
	{
		scanf("%s",a);
		printf("Test case #%d\n",t++);
		kmp(n);
		for(int i=2;i<=n;i++)
		{
			if(next[i-1]!=-1&&i%(i-(next[i-1]+1))==0)
			{
				if(i==(i-(next[i-1]+1)))
				continue;
				printf("%d %d\n",i,i/(i-(next[i-1]+1)));				
			}
		}
		printf("\n");
	}
	return 0;
}