POJ 2406 Power Strings

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).

---

【题目分析】
找到一个字符串的最小循环节。也是一道模板题目，
KMP，next表示模式串如果第i位(设str[0]为第0位)与文本串第j位不匹配则要回到第next[i]位继续与文本串第j位匹配。则模式串第1位到next[n]与模式串第n-next[n]位到n位是匹配的。
如果len%(len-next[len])==0 就代表找到了循环节。输出就好了

---

【代码】

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
char s[1000005];
int next[1000005],len,j=0;
int main()
{
    while (scanf("%s",s+1)>0)
    {
        memset(next,0,sizeof next);
        if (s[1]=='.') break;
        len=strlen(s+1);
        next[1]=0;j=0;
        for (int i=2;i<=len;++i)
        {
            while (j>0&&s[j+1]!=s[i]) j=next[j];
            if (s[j+1]==s[i]) j++;
            next[i]=j;
        }
        if (len%(len-next[len])==0) printf("%d\n",len/(len-next[len]));
        else printf("1\n");
    }
}