Power Strings (poj)

Power Strings poj-2406
Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “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.
就是找重复的个数，用kmp里面的get，求出最长的重复单元，然后用len-去，就是最短的了，

#include <stdio.h>
#include <string.h>
int next[10000002];
char s[10000002];
int main()
{
    while(gets(s))
    {
        if(s[0]=='.')break;
        int i=0,t=-1;
        int len=strlen(s);
        next[0]=-1;
        while(i<len)
        {
            if(s[i]==s[t]||t==-1) 
            {
                t++;
                i++;
                next[i]=t;
            }
            else t=next[t];
        }
        int k=len-next[len];  
        if(len%k==0)printf("%d\n",len/k);
        else  printf("1\n");
        memset(s,0,sizeof(s));
    }
    return 0;
}