POJ 2406 - Power Strings(KMP)

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 51899		Accepted: 21642

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.

题意：

题目保证给你的字符串可以用1-n个子串连接，求n。

POINT：

KMP。

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include<algorithm>
using namespace std;
const int maxn = 10000000;
int nxt[maxn];
char s[maxn];
int len;
void prenxt()
{
    len=(int)strlen(s);
    int i=0,j;
    j=nxt[0]=-1;
    while(i<len){
        while(j!=-1&&s[i]!=s[j]) j=nxt[j];
        nxt[++i]=++j;
    }
}
int main()
{
    while(cin>>s){
        if(s[0]=='.') break;
        prenxt();
        if(len%(len-nxt[len])==0){
            printf("%d\n",len/(len-nxt[len]));
        }
        else
            printf("1\n");
    }
}