LA 3026 Period——kmp求n次最小循环节

参考poj1961http://blog.csdn.net/hao_zong_yin/article/details/77455665

注意要每行后一个空行，不能两两之间一个空行

#include <cstdio>
using namespace std;
const int maxn = 1e6 + 10;
char str[maxn];
int flag = 0, n, Next[maxn];
int main() {
    while (~scanf("%d", &n) && n) {
        scanf("%s", str);
        int i = 0, j = 0; Next[i] = j;
        for (int i = 1; i < n; i++) {
            while (j && str[i] != str[j]) j = Next[j - 1];
            if (str[i] == str[j]) j++;
            Next[i] = j;
        }
        printf("Test case #%d\n", ++flag);
        for (i = 1; i < n; i++) {
            int len = i + 1 - Next[i];
            if (Next[i] && (i + 1) % len == 0) {
                printf("%d %d\n", i + 1, (i + 1) / len);
            }
        }
        printf("\n");
    }
    return 0;
}