字符串专项：UVa 10298

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 1000010
char s[M];
int f[M];
int main()
{
freopen("in.txt","r",stdin);
while(cin>>s)
{
if(s[0]=='.') break;
int n=strlen(s);
f[0]=f[1]=0;
for(int i=1;i<n;i++)
{
int j=f[i];
while(j&&s[i]!=s[j]) j=f[j];
f[i+1]=(s[i]==s[j]?j+1:0);
}
int ans=1;
if(n%(n-f
)==0) ans=max(ans,n/(n-f
));
cout<<ans<<endl;
}
return 0;
}