给出一个字符串,问这个字符串的所有前缀是否油循环节,并且说出有几个循环节构成
KMP算法可以的next数组可以用来计算循环节。
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N=1000005;
int nextt[N];
char str[N];
void makenextt(char p[],int len)
{
nextt[0]=0;
for(int i=1,k=0;i<len;i++)
{
nextt[0]=0;
while(k>0&&p[k]!=p[i])
k=nextt[k-1];
if(p[k]==p[i])
k++;
nextt[i]=k;
}
}
int main()
{
int n;
int ca=1;
while(scanf("%d",&n)!=EOF&&n)
{
scanf("%s",str);
makenextt(str,n);
printf("Test case #%d\n",ca++);
for(int i=1;i<n;i++)
{
if(nextt[i]!=0)
{
if((i+1)%(i+1-nextt[i])==0)
printf("%d %d\n",i+1,(i+1)/(i+1-nextt[i]));
}
}
printf("\n");
}
return 0;
}
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10391 Accepted Submission(s): 4936
Problem 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