POJ 2406 Power St…

#include
#include
const int N = 1000000+10;
char str[N];
int next[N];
int len;
void GetNext1(char str[N],int next[N])//寻找模式串的粗略next
{
    intl=strlen(str);
   next[0]=-1;
    inti=0,j=-1;
   while(i
    {
       if(j==-1||str[i]==str[j])
       {
           i++;
           j++;
           next[i]=j;
       }
       else
           j=next[j];
    }
}
int main()
{
    int T =0;
   while(scanf("%s",str)!=EOF)
    {
       if(strcmp(str,".")==0)
           break;
       GetNext1(str,next);
       int len = strlen(str);
       if(len%(len-next[len])==0)
           printf("%d\n",len/(len-next[len]));
       else
           printf("1\n");
    }
    return0;
}