UVAlive 3026 Period
题目：
| Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
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 AK , 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 思路： 利用KMP算法中的失配函数，如果是一个循环字串那么(i-f[i])必为一个循环节，因此只要判断(i%(i-f[i])==0) 可以整除则是循环字串。 代码：
1 #include<cstdio>
2 #define FOR(a,b,c) for(int a=(b);a<(c);a++)
3 using namespace std;
4
5 const int maxn = 1000000 + 10;
6 char s[maxn];
7 int f[maxn]; //大数组注意要开在函数外包括main
8
9 int main(){
10 int kase=0,n;
11 while(scanf("%d",&n)==1 && n){
12 scanf("%s",s);
13
14 f[0]=f[1]=0;
15 FOR(i,1,n){
16 int j=f[i];
17 while(j && s[i] != s[j]) j=f[j];
18 f[i+1]= s[i]==s[j]? j+1:0;
19 }
20
21 printf("Test case #%d\n",++kase);
22 FOR(i,2,n+1){ //L+1
23 int k=i-f[i];
24 if(f[i]>0 && (i%k)==0)
25 printf("%d %d\n",i,i/k);
26 }
27 printf("\n");
28 }
29 return 0;
30 }
需要注意大数组的声明位置。