POJ - 1961 - Period

Period

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 18661		Accepted: 9071

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 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

假设输出n，m，则前缀长度为n的字符串，可以分为m个相同的子串

#include
#include
#include
#include
using namespace std;
const int len=1e6+8;
char a[len];
int kmp_next[len];
void KMP_next()
{
    int i=0,j=-1;
    kmp_next[0]=-1;
    while(a[i])
        if(j==-1||a[i]==a[j])
            kmp_next[++i]=++j;
        else
            j=kmp_next[j];
}
int main()
{
    int n,CASE=0;
    while(scanf("%d",&n)&&n!=0)
    {
        if(CASE)
            printf("\n");
        printf("Test case #%d\n",++CASE);
        scanf("%s",a);
        KMP_next();
        int i=1;
        while(a[i++])
            if(kmp_next[i]&&(!(i%(i-kmp_next[i]))))
                printf("%d %d\n",i,i/(i-kmp_next[i]));
    }
    return 0;
}