hdu 2406 Power Strings KMP

                                                                         Power Strings

                                                              Time Limit:3000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

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

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

题意： 求出最长的循环次数
题解：
如下图：

下标	0	1	2	3	4	5	6	7	8	9	10
字符	a	b	a	b	a	b	a	b	a	b
next	-1	0	0	1	2	3	4	5	6	7	8

由图可知next[10]=8 表示前八个字符与后八个字符相同，且为前10-8个字符的循环出现，也就是说最大的循环次数是=10/(10-8).

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int M = 1000010; 
int nxt[M];
char T[M];
int n,m;
int ans;
void getnext(){
    int j, k;
    j = 0; k = -1; nxt[0] = -1;
    while(j<m){
        if (k==-1 || T[j]==T[k]){
            nxt[++j] = ++k;
        }
        else{
            k = nxt[k];
        }
    }
}
int main()
{		
  while(scanf("%s",&T)!=EOF){
  		if(T[0]=='.') break;
 		m=strlen(T);
        getnext();
        if(m%(m-nxt[m])==0) printf("%d\n",m/(m-nxt[m]));//****      
        else printf("1\n");    
   }
 return 0;  	
}

---