版权声明:本人菜鸟一只,如文章有错误或您有高见,请不吝赐教 https://blog.csdn.net/qq_41138935/article/details/82589101
#include<iostream>
#include<cstring>
using namespace std;
int main(){
int i,j=0,k,t=0;
char a[85];
cin>>a;
int lena=strlen(a);
for(i=1;i<lena;i++){
k=i;
while(a[j++]==a[k++]){
//cout<<k-1<<"\t"<<j-1<<"\t"<<lena<<endl;
t+=1;
if(k==lena&&t%(k-j)==0){
cout<<"最小周期:"<<k-j<<endl;
i=k;
break;
}
}
j=0;t=0;
}
return 0;
}