Period kmp

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

Hint

题意

统前i位字符串能化为$a^n$的形式a为字符串且n最大且n>1

题解：

统计前i位字符串能按上述划分的单位字符长度 并判断是否满足

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 1e6+10;
char st[MAXN];
int nxt[MAXN];
int a[MAXN];
void getnext(int l){
    int i = 0,j = 0;
    nxt[0] = -1; j = nxt[0];
    while (i < l){
        if (j == -1 || st[i] == st[j]){
            nxt[++i] = ++j;
        }else j = nxt[j];
    }
}
int len;
int main(){
    int Case = 1;
    while (scanf("%d",&len),len){
        scanf("%s",st);
        printf("Test case #%d\n",Case++);
        getnext(len);
        int d;
        for (int i = 1;i <= len; ++i){
            d = i - nxt[i];
            if (i%d==0&&i/d>1){
                printf("%d %d\n",i,i/d);
            }
        }
        printf("\n");
    }
    return 0;
}