HDU 1358 KMP

A - KMP

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1358

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

 3aaa12aabaabaabaab0 

 

Sample Output

 Test case #12 23 3Test case #22 26 29 312 4 

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<queue>using namespace std;#define maxn 100005#define inf 0x3f3f3f3fint f[maxn];char t[maxn],p[maxn];int n;void getfail(){   f[0]=f[1]=0;   for(int i=1;i<n;i++){    int j=f[i];    while(j&&p[i]!=p[j])j=f[j];    f[i+1]=p[i]==p[j]?j+1:0;   }}int main(){    int t=0;    freopen("in.txt","r",stdin);   while(~scanf("%d",&n)&&n){    scanf("%s",p);    getfail();    /*    for(int i=0;i<=n;i++){        cout<<f[i]<<" ";    }    cout<<endl;    */    printf("Test case #%d\n",++t);    for(int i=2;i<=n;i++){        if(f[i]>0&&i%(i-f[i])==0)        printf("%d %d\n",i,i/(i-f[i]));    }   }}