Period HDU - 1358
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) �C 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
题目大意:问从第一个字符到第i个字符是否是个周期大于1的循环字符串。
如果是的话输出 i k。 k是周期。
分析:
所以这一题就是找从第一个字符到第i个字符的最小循环节。
之前有写过最小循环节怎么找 点击 查 看
AC代码
#include<stdio.h>
#include<string.h>
struct KMP
{
char a[2000000],b[2000000];
int nextval[2000000];
int m,n;
void init()
{
memset(nextval,0,sizeof(nextval));
}
void get_next()
{
for(int i=1;i<m;i++)
{
int j=nextval[i];
while(j&&a[i]!=a[j])
j=nextval[j];
nextval[i+1]=a[i]==a[j]?j+1:0;
}
}
int find_aim()//这一题这个函数可以不要
{
int j=0;
for(int i=0;i<n;i++)
{
while(j&&a[j]!=b[i])
j=nextval[j];
if(a[j]==b[i]) j++;
if(j==m) return i-m+2;
}
return -1;
}
}T;
int main()
{
int n;
int cas=0;
while(scanf("%d",&n)==1&&n)
{
T.init();
scanf("%s",T.a);
T.m=strlen(T.a);
T.get_next();
printf("Test case #%d\n",++cas);
for(int i=1;i<=T.m;i++)
{
int minval=i-T.nextval[i];//最小循环节
if(i%minval==0&&i!=minval)
{
printf("%d %d\n",i,i/minval);
}
}
printf("\n");
}
}