【poj2406】 Power Strings （KMP求循环节）

Power Strings

Time Limit : 6000/3000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 6   Accepted Submission(s) : 5

Problem Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

 

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

 

Output

For each s you should print the largest n such that s = a^n for some string a.

 

Sample Input

   
   

    
    abcd
aaaa
ababab
.

   
   

 

Sample Output

   
   

    
    1
4
3

   
   

 

Source

PKU

 总结：KMP求循环节
if(i%(i-next[i])==0)则循环节存在，并且循环节长度就是 i/(i-next[i]. (i为字符串的长度)

#include<cstdio>
#include<cstring>
int next[1000005];
char s[1000005];
int getNext(char P[])
{
     int j=0,k=-1;
     next[0]=-1;
     int len=strlen(P);
     while(j<len)
     {
                 if(k==-1||P[k]==P[j])
                 {
                    j++;k++;
                    next[j]=k;
                 }
                 else k=next[k];
     }
     if(len%(len-next[len])==0) 
        return len/(len-next[len]); 
     return 1;
}
int main()
{
    while(scanf("%s",s)&&s[0]!='.')
    {
         printf("%d\n",getNext(s));
    }
    return 0;
}