HDOJ 1358

Period

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2258    Accepted Submission(s): 1117

Problem 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

3

aaa

12

aabaabaabaab

 

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

 using namespace std;

 const int maxn=;

 char str[maxn];
 int N,fail[maxn];

 void getfail()
 {
     int n=strlen(str);
     fail[]=fail[]=;
     for(int i=;i<n;i++)
     {
         int j=fail[i];
         while(j&&str[i]!=str[j]) j=fail[j];
         fail[i+]=(str[i]==str[j])?(j+):;
     }
 }

 int main()
 {
     int cas=;
     while(scanf("%d",&N)!=EOF&&N)
     {
         scanf("%s",str);
         printf("Test case #%d\n",cas++);
         getfail();
         for(int i=;i<=N;i++)
         {
             if(fail[i]&&(i%(i-fail[i])==))
             {
                 printf("%d %d\n",i,i/(i-fail[i]));
             }
         }
         putchar();
     }
     return ;
 }