问题描述
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.
输入
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.
输出
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.
样例输入
3
aaa
12
aabaabaabaab
0
样例输出
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
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.
输入
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.
输出
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.
样例输入
3
aaa
12
aabaabaabaab
0
样例输出
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
题意:寻找循环节
解析:i(从1开始)表示当前字符串的位置,next[k]表示第i个字符的匹配值(next数组中存的东西),那么当前位置(i)的循环节为(if(i%(i-next[k))==0),那么循环节等于:i/(i-next[k]);详细见代码
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2000009;
int next[maxn];
char str[maxn];
void getNext(char *p,int *next)
{
int len=strlen(p);
int i,k;
next[0]=0;
for(i=1,k=0;i<len;i++)
{
while(k>0&&p[k]!=p[i])
k=next[k-1];
if(p[i]==p[k])
k++;
next[i]=k;
}
}
int main()
{
int n;
int cnt=0;
while(scanf("%d",&n)!=EOF&&n)
{
memset(next,0,sizeof(next));
scanf("%s",str);
int len=strlen(str);
getNext(str,next);
printf("Test case #%d\n",++cnt);
int lens=1;
for(int i=1;i<len;i++)
{ lens++;
if(!(lens%(lens-next[i]))&&lens/(lens-next[i])>1)
printf("%d %d\n",lens,lens/(lens-next[i]));
//printf("%d ",next[i]);
}
printf("\n");
}
return 0;
}