kmp练习poj2406

题意
求最小循环节，注意输入末尾有个句点，代码实际可以简单很多，后续的判断是无意义的

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

const int maxn = 1000050;
char p[maxn],str[maxn];
int fail[maxn];

void getFail()
{
    int len = strlen(p);
    fail[0] = fail[1] = 0;
    for(int i = 1; i < len; i++)
    {
        int j = fail[i];
        while(j && p[j] != p[i]) j = fail[j];
        if(p[j] == p[i]) fail[i+1] = j + 1;
        else fail[i+1] = 0;
    }
}

int main()
{
    while(gets(p))
    {
        if(p[0] == '.') break;
        getFail();
        int len = strlen(p);
        if(fail[len]*2 < len)
        {
            printf("1\n"); continue;
        }
        int x = fail[len]-(fail[len]+fail[len]-len);
        if(len%x != 0)
        {
            printf("1\n"); continue;
        }
        else
        {
            bool OK = true;
            strncpy(str,p,x);
            for(int i = 0;i < len;i+=x)
            {
                if(strncmp(str,p+i,x) != 0)
                {
                    OK = false; break;
                }
            }
            if(!OK) printf("1\n");
            else printf("%d\n",len/x);
        }
        memset(str,0,sizeof(str));
        memset(p,0,sizeof(p));
    }
    return 0;
}