标签:follow ring code iat ons col iss test ini
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 64676 | Accepted: 26679 |
Description
Input
Output
Sample Input
abcd aaaa ababab .
Sample Output
1 4 3
Hint
Source
题解:KMP……照着书打的qwq
#include <stdio.h> #include <algorithm> #include <iostream> #include <string.h> using namespace std; #define maxn 2000100 char s[maxn]; int nexts[maxn]; int n,m; void getnexts() { int j=0; int k=-1; nexts[0]=-1; while(j<m) { if(k==-1||s[j]==s[k]) { j++;k++; nexts[j]=k; } else k=nexts[k]; } } int main() { while(~scanf("%s",s)) { if(s[0]==‘.‘)break; m=strlen(s); getnexts(); int n=m-nexts[m]; if(n!=m&&m%n==0) printf("%d\n",m/n); else printf("1\n"); } return 0; }
标签:follow ring code iat ons col iss test ini
原文地址:https://www.cnblogs.com/wuhu-JJJ/p/11149637.html