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 file 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
这题和Power Strings那道题基本一样,那道题是整个字符串里循环结(l-nxt[l])出现的次数,这题是求到i为止的循环结出现的次数。加一层for循环就好了。
输出的格式要输出一个空行。
#include <stdio.h>
#include <string.h>
#define N 1000005
char a[N];
int nxt[N];
int l;
int n;
void getnext(){
int j, k;
j = 0; k = -1; nxt[0] = -1;
while(j<l){
if (k==-1 || a[j]==a[k]){
nxt[++j] = ++k;
}
else{
k = nxt[k];
}
}
}
int main()
{
int c=1;
while(scanf("%d",&n)>0&&n)
{
printf("Test case #%d\n",c++);
scanf("%s",a);
l=strlen(a);
getnext();
for(int i=1;i<=l;i++)
{
if(i % (i - nxt[i]) == 0&&i!=(i-nxt[i]))
printf("%d %d\n",i,i/ (i - nxt[i]));
}
printf("\n");
}
return 0;
}