POJ2406-Power Strings

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 45647		Accepted: 19057

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.

Source

Waterloo local 2002.07.01

题意：给出一个串，问该串最多循环几次得到

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>

using namespace std;

char s[1000005];
int nt[1000005];

int main()
{
    while(scanf("%s",s)&&s[0]!='.')
    {
        nt[0]=-1;
        int len=strlen(s);
        for(int i=0; i<len; i++)
        {
            int k=nt[i];
            while(k>=0&&s[i]!=s[k])
                k=nt[k];
            nt[i+1]=k+1;
        }
        if(len%(len-nt[len])==0)
            printf("%d\n",len/(len-nt[len]));
        else printf("1\n");
    }
    return 0;
}