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
题意描述:给出一个数字n然后再给出一个长度为n的字符串,然后需要你去求出这个字符串的前缀周期k(k>1),然后输出此时i的位置和周期k。
解题方法:用next数组把这个字符串进行标记,然后用一个for循环在main函数中去判断next[i](i>.=2)是否等于0,如果不等于0就去判断i%(i-next[i-1])==0&&i/(i-next[i-1])!=1,是否成立。如果成立就输出i和i/(i-next[i-1])。
#include<stdio.h>
#include<string.h>
char s[1001000] ;
int next[1001000];
int ls;
void get_next()
{
int i=1,j=0;
while(i<ls)
{
if(j==0&&s[i]!=s[j])
next[i++]=0;
else if(j>0&&s[i]!=s[j])
j=next[j-1];
else
{
next[i]=j+1;
i++;
j++;
}
}
}
int main(void)
{
int i,t=1;
while(~scanf("%d",&ls))
{
memset(next,0,sizeof(next));
if(ls==0)
break;
getchar();
scanf("%s",s);
get_next();
printf("Test case #%d\n",t++);
for(i=2;i<=ls;i++)
{
if(next[i-1]==0)
continue;
else
{
if(i%(i-next[i-1])==0&&i/(i-next[i-1])!=1)
printf("%d %d\n",i,i/(i-next[i-1]));
}
}
printf("\n");
}
return 0;
}