这题因为格式问题,提交了7次,都是PE,后来看了别人的代码,修改了格式通过的
#include<stdio.h>
#include<string.h>
#define maxn 90
char su[maxn];
char bi[maxn];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
//printf("\n");
scanf("%s",su);
//printf("\n");
memset(bi,0,sizeof(bi));
int lon = strlen(su),lon2,j,k;
for(int i =0;i<lon;i++)//比较数组增加 1
{
bi[i] = su[i];
lon2 = strlen(bi);
for(k =0;k<lon;k++)//原数组遍历
{
if(su[k] != bi[k%lon2])
break;
}
if((k%lon2) != 0)
continue;
if(k==lon)
break;
}
// printf("\n");
if(t==0) printf("%d\n",lon2);
else printf("%d\n\n",lon2);
}
return 0;
}