For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as A K,that is A concatenated K times, for some string A. Of course, we also want to know the period K.
The input consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S.The second line contains the string S. The input file ends with a line, having the
number zero on it.
number zero on it.
For each test case, output "Test case #" and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
3
aaa
12
aabaabaabaab
0
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
题意:样例有点不好理解。。。意思是这样的,把一个字符串的每一个前缀作为一个字符串,求每一个前缀的最小循环节出现的次数,没有的不输出。。。
思路:最小循环节的长度为l-next[l]。。。依次输出即可。。。
下面附上代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
const int N=1000005;
using namespace std;
int Next[N],n;
char s[N];
void Getnext(char *t,int n)
{
int i=0,j;
Next[i]=-1,j=Next[i];
while(i<n)
{
if(j==-1||t[i]==t[j])
Next[++i]=++j;
else
j=Next[j];
}
}
int main()
{
int r=0;
while(~scanf("%d",&n)&&n)
{
getchar();
scanf("%s",s);
Getnext(s,n);
printf("Test case #%d\n",++r);
for(int i=2;i<=n;i++)
{
if(i%(i-Next[i])!=0||!Next[i]) continue;
printf("%d %d\n",i,i/(i-Next[i]));
}
puts("");
}
return 0;
}