CCSU_Seth

---------------------------------------------- k    m        x      j       i由上，next【i】=j，两段红色的字符串相等（两个字符串完全相等），s[k....j]==s[m....i]设s[x...j]=s[j....i](xj=ji)则可得，以下简写字符串表达方式kj=

/*字符串长度为n,那么n-next[n](字符串从0开始)是最小循环节， 如果n能整除n-next[n],周期为n/(n-next[n]);*/#include#include#define size 1000002int n;char s[size];int next[size];int temp;void getnext(){ int i,j;

#include#include#define size 100009void getnext(char *p,int *next){ int i,j; next[0]=-1; i=0,j=-1; int len=strlen(p); while(il2) i=l1-l2; while(i<l1 && jl2) printf("%s\n",ans2); else if(l10) printf("%