HDU 1358 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 AK ,

that is A concatenated K times, for some string A. Of course, we also want to

know the period K.

 

输入

 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.

 

输出

 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.

 

示例输入

3
aaa
12
aabaabaabaab
0

示例输出

Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
#include <stdio.h>
#include <string.h>
char a[1000010];
int next[1000010];
int main()
{
    int i,j,l=0,n,k;
    while(scanf("%d",&n)&&n)
    {
        scanf("%s",a);

        i = 0;
        j = -1;
        next[0] = -1;
        while(i<n)
        {
            if(j == -1 || a[i] == a[j])
            {
                i++;
                j++;
                next[i] = j;
            }
            else
                j = next[j];
        }
        printf("Test case #%d\n",++l);
        for(k=1; k<=n; k++)
        {
            j=k-next[k];
            if(k%j == 0 && k/j >1)
            {
                printf("%d %d\n",k,k/j);
            }
        }

              printf("\n");
    }
    return 0;
}
刚开始i=1;j=0;while(i<n)
  
  

   
   if(j==0||a[i]==a[j])错误因为这样有一个bug
  
  
  
  

   
   所以最好别用