Period

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.

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.

3aaa12aabaabaabaab0

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

JGShining

kmp的扩展运用

#include
    
     #include
     
      #include
      
       #include
       
        using namespace std;int nexta[1000111];void getnext(string s){	int i=0,j=-1;	nexta[0]=-1;	while(i
        
         >k&&k!=0)	{		cin>>s;		getnext(s);		cout<<"Test case #"<
         
          <
          
           1)//看是否循环 { cout<
           <<" "< //找出重复次数大于1时的位置 并且输出重复次数
          
         
        
       
      
     
    

++jj;cout<<endl;}return 0;}/*一个字符串，问从头到某个位置，字符串的前缀最多重复了多少次。比方aaaa的字符串，到第二个字符，前缀a重复了两次，到第三个字符，前缀a重复了三次，到第四个字符，前缀a重复了四次，前缀aa重复了两次，但我们要得到的是重复了四次。*/