标签:poj 2406
| Time Limit: 3000MS | Memory Limit: 65536K | |
| Total Submissions: 37564 | Accepted: 15532 |
Description
Input
Output
Sample Input
abcd aaaa ababab .
Sample Output
1 4 3
Hint
Source
#include<cstdio>
#include<cstring>
const int max= 1000100;
char str[max];
int p[max];
int cnt;
int len;
void getp()
{
len=strlen(str);
int i=0,j=-1;
p[0]=-1;
while(i<len)
{
if(j==-1||str[i]==str[j])
{
i++,j++;
p[i]=j;
}
else j=p[j];
}
}
int main()
{
while(scanf("%s",str)!=EOF)
{
if(strcmp(str,".")==0)
break;
getp();
cnt=1;
// for(int i=0;i<len;i++)
// printf("%d ",p[i]);
if(len%(len-p[len])==0)
cnt=len/(len-p[len]);
printf("%d\n",cnt);
}
return 0;
}版权声明:博主情人,外人误碰!!!
标签:poj 2406
原文地址:http://blog.csdn.net/qq_21654717/article/details/47344581