/*一条水题,基本裸kmp,能加深理解next表的作用*/
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 1000010;
char s[maxn];
int slen,next1[maxn];
void pre_next()
{
int k = -1;
int i = 0;
next1[i] = k;
for(;i<=slen;)
{
if(k == -1||s[i] == s[k]){
i++;
k++;
next1[i] = k;
}
else k = next1[k];
}
//for(int i=0;i<=slen;i++)
//printf("%d\n",next1[i]);
}
int main()
{
int T = 0;
while(scanf("%d",&slen)&&slen)
{
scanf("%s",s);
pre_next();
printf("Test case #%d\n",++T);
for(int i=2;i<=slen;i++)
{
int len = i - next1[i];
if(i != len&&i % len == 0)
{
printf("%d %d\n",i,i/len);
}
}
printf("\n");
}
return 0;
}
POJ 1961
最新推荐文章于 2019-06-03 16:23:42 发布