POJ-1961(Period)(kmp())

POJ-1961(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

题意：在前i个字符中，循环节出现的次数(要求循环节出现的次数要大于1)，比如aabaabaabaab，在前两个字符中a出现了两次，循环节为a。在前6个字符中，循环节出现了2次，循环节为aab，在前9个字符中，循环节出现了3次，循环节为aab；在12个字符中循环节出现了4次，循环节为aab。

My solution：

/*2016.4.11*/

#include
#include
#include
using namespace std;
char c[1000100];
int nest[1000100],n;
void getnest()
{
	int i,j,k=0,t;
	i=0;j=-1;
	nest[i]=j;
	while(i