題目鏈接:http://poj.org/problem?id=2406點擊打開鏈接
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 53824 | Accepted: 22425 |
Description
Input
Output
Sample Input
abcd aaaa ababab .
Sample Output
1 4 3
求循環節長度 判斷是否可整除即求得個數
#include <stdio.h>
#include <string.h>
using namespace std;
char t[1111111];
int n,m;
int nnext[1111111];
void getnext()
{
int i=0,j=-1;
nnext[0]=-1;
while(i<n)
{
if(j==-1||t[i]==t[j])
{
i++;
j++;
nnext[i]=j;
}
else
{
j=nnext[j];
}
}
}
int main()
{
while(scanf("%s",&t)&&strcmp(t,"."))
{
int ans=1;
n=strlen(t);
getnext();
int mid=n-nnext[n];
//cout << mid << n <<endl;
if((n%mid)==0)
{
ans=(n/mid);
}
printf("%d\n",ans);
}
}