Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 23112 | Accepted: 9691 |
Description
Input
Output
Sample Input
abcd aaaa ababab .
Sample Output
1 4 3
Hint
Source
#include<stdio.h> #include<string.h> #include<iostream> using namespace std; const int MAXN=1000000; char str[MAXN]; int next[MAXN]; int len; void getNext() { int j,k; j=0; k=-1; next[0]=-1; while(j<len) { if(k==-1||str[j]==str[k]) next[++j]=++k; else k=next[k]; } } int main() { // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); while(scanf("%s",&str)!=EOF) { if(strcmp(str,".")==0) break;//这个地方要注意 len=strlen(str); getNext(); if(len%(len-next[len])==0&&len/(len-next[len])>1)printf("%d\n",len/(len-next[len])); else printf("1\n"); } return 0; }