poj2406 Power Strings （kmp）

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.

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

#define M 1000010
int ne[M];
char a[M];

void GetNext()
{
    int i = 0, j = -1;
    ne[0] = -1;
    int lena = strlen(a);
    while (i < lena)
    {
        if(j == -1 || a[i] == a[j]){
            ne[++i] = ++j;
        }
        else j = ne[j];//回溯至上一个
    }
}

int main()
{
    while(scanf("%s", &a) != EOF && a[0] != '.')
    {
        int len = strlen(a);
        GetNext();
        if(len%(len-ne[len]) == 0){
            printf("%d\n", len/(len-ne[len]));
        }
        else{
            printf("1\n");
        }
    }
    return 0;
}
//因为是ne[++i] == ++j 所以会出现ne[len],即ne中所含个数比数组a中所含个数多一
//len - ne[len]是指看前缀有多长~