# E - Period(KMP求循环节的位置以及出现的次数)

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 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
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000009;
char pattern[maxn];
int nnext[maxn];
void pre()
{
int patternLen = strlen(pattern);
int i = 0, j = -1;
nnext[0] = -1;
while(i!=patternLen)
{
if(j==-1||pattern[i]==pattern[j])
nnext[++i] = ++j;
else
j = nnext[j];
}
}
int main()
{
int n;
int T = 1;
while(~scanf("%d", &n)&&n)
{
scanf("%s", pattern);
printf("Test case #%d\n", T++);
pre();
for(int i=2;pattern[i-1];i++)
{
int t = i - nnext[i];//循环的长度
if(i%t==0&&i/t>1)
printf("%d %d\n", i, i/t);//循环到的位置，出现的次数
}
printf("\n");
}
return 0;
}

#### UVA 1328 Period(KMP:最短循环节)

2014-04-04 10:54:28

#### poj 2406 Power Strings 【KMP求最小循环节】【后缀数组求连续重复子串】

2015-05-26 13:29:24

#### kmp最小循环节的求法

2014-02-11 21:32:40

#### 数据结构：KMP next数组求串最小循环节、循环周期

2014-08-14 16:10:39

#### kmp求最小循环节

2017-08-21 19:19:41

#### POJ 2406 Power Strings（KMP求最小循环节）

2015-08-14 16:20:07

#### KMP算法求字符串的最小循环节

2017-07-08 11:38:11

#### HUST 1010 The Minimum Length （kmp求最小循环节）

2016-07-24 18:24:17

#### KMP求模式串在原串中出现的次数

2014-11-19 21:38:05

#### KMP算法之查找模式串在源串中出现的次数

2014-10-30 23:27:14