poj 1961 Period (最小重复子串 kmp)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char name[1000010];
int nex[1000010];
void getnext()
{
memset(nex,0,sizeof(nex));
nex[0]=-1;
int j=-1,k=0;
int len=strlen(name);
while(k<len)
{
if(j==-1||name[j]==name[k])
{
j++;k++;
nex[k]=j;
}
else
j=nex[j];
}
}
int main()
{
int n,ica=1;

while(scanf("%d",&n),n)
{
scanf("%s",name);
printf("Test case #%d\n",ica++);
getnext();
for(int i=1;i<=n;i++)
{
int len=i-nex[i];
if(i%len==0&&i/len>1)
{
printf("%d %d\n",i,i/len);
}
}
printf("\n");
}
return 0;
}