POJ 2406

#include<iostream>
#include<stdio.h>
#define MAXN 1000001
using namespace std;

char c[MAXN];
int next[MAXN];

void give_next(int len)
{
    int i;
    int j;
    i = 0;
    j = -1;
       next[0] = -1;//next[0]初始化为-1.
       while(i < len)
    {
        if(j == -1 || c[i] == c[j])//从零开始记录next数组
    {
            i ++;
         j ++;
            next[i] = j;
    }
    else
           j = next[j];
    }
}


int main()
{
    //freopen("acm.acm","r",stdin);
    int len;
    int tem;
    while(cin>>c)
    {
        if(c[0] == '.')
            break;
        //cout<<c<<endl;
        len = strlen(c);
        give_next(len);
        tem = len - next[len];
        if(len % tem == 0)
        {
            cout<<len/tem<<endl;
        }
        else
            cout<<1<<endl;
    }
}