poj2046 Power Strings(KMP)

原题链接
Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 45358		Accepted: 18931

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
解题思路：我是使用了两个变量i和j,初始时i指向s[1],j指向s[0],比较s[i]和s[j],如果s[i]==s[j],匹配串长度为i-j，i++,j++,继续比较。如果
s[i]!=s[j],则要将j赋零，将匹配串的长度改为i,并让i++，举个例子：abcd,初始时i=1,j=0;比较s[i]和s[j];a!=b,所以匹配串变成ab长度变成2，这时j=0,i=2,继续上述过程比较
s[i]和s[j];a!=c,所以匹配串变成abc长度变成3，这时j=0,i=3...再举个例子：ababab,
abcd,初始时i=1,j=0;比较s[i]和s[j];a!=b,所以匹配串变成ab长度变成2，j=0;i++。继续。。
比较s[i]和s[j];a==a,所以匹配串还是ab长度还为i-j,i++,j++
应注意aabaabaa这种情况,具体的不多说相信大家能发现问题。

 
 

  
  
#include
    
    
     
     
#include
     
     
      
       
using namespace std;
int i,j,len;
char s[1000010];

void getnext(){
	i=1,j=0;
	while(i