Period
Description
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.
Input
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. Output
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.
Sample Input 3 aaa 12 aabaabaabaab 0 Sample Output Test case #1 2 2 3 3 Test case #2 2 2 6 2 9 3 12 4 Source |
提示
题意:我们定义A^K=S,求出字符串中到字符i的子串K大于等于2的循环节,并输出i和循环节长度。
思路:
利用KMP的next数组,i-next[i]为循环节长度,若i%(i-next[i])=0且next[i]!=0,那么当前字串存在循环节。
示例程序
Source Code
Problem: 1961 Code Length: 716B
Memory: 5284K Time: 516MS
Language: GCC Result: Accepted
#include <stdio.h>
int next[1000001];
char a[1000001];
void getnext(int n)
{
int i=0,i1=-1;
next[i]=i1;
while(i<n)
{
if(i1==-1||a[i]==a[i1])
{
i++;
i1++;
next[i]=i1;
}
else
{
i1=next[i1];
}
}
}
int main()
{
int n,i,i1;
scanf("%d",&n);
for(i=1;n!=0;i++)
{
scanf("%s",a);
getnext(n);
printf("Test case #%d\n",i);
for(i1=2;n>=i1;i1++)
{
if(i1%(i1-next[i1])==0&&next[i1]!=0)
{
printf("%d %d\n",i1,i1/(i1-next[i1]));
}
}
printf("\n");
scanf("%d",&n);
}
return 0;
}