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
题目大意:从字符串的第二位开始(所以应该是下标为1开始) , 如果能与之前的构成循环,输出头字母的位置, 并且输出循环节个数;
题解:就是循环搜一遍循环节, 但是区别是从第二位, 并且要注意特判多了一个条件, 就是该循环节肯定是之前至少出现过一次的;
AC代码:
#include <stdio.h>
#include <string.h>
#include <math.h>
int n , pre[1000010] ;
char a[1000010];
void getpre()
{
int i = 0 , j = -1 ;
pre[0] = -1;
while(i<n)
{
if(j==-1||a[i]==a[j]) pre[++i] = ++j;
else j = pre[j] ;
}
}
void kmp()
{
int circle ;
for(int i = 2; i <= n;i++)
{
circle = i - pre[i]; //*循环节
if(i%circle==0&&i/circle>1)
{
printf("%d %d\n",i,i/circle);
}
}
printf("\n");
}
int main()
{
int cnt = 1 ;
while(~scanf("%d",&n),n)
{
getchar();
gets(a);
getpre();
printf("Test case #%d\n",cnt++);
kmp();
}
return 0;
}