43.国王的魔镜

#include<stdio.h>
#include<string.h>
#include<math.h>
int cmpare(char *a,int l)
{
int m = l-1;
int mark = 1;
while(m >= 0)
{
if(a[l++] !=a[m--])
{
mark = 0;
break;
}
}
return mark;
}
int add(char *arr,int length)
{
int i = 1;
int counter = 0;
int l = length;
for(;i<=length;i+=i)
{
l /= 2;
if(cmpare(arr,l))
{
counter++;
}
else
{
break;
}
if(l%2)
{
return counter;
}
}
return counter;
}
int main()
{
int N;
char arr[101];
scanf("%d",&N);
getchar();
while(N--)
{
gets(arr);
int length;


length = strlen(arr);
if(length%2)
{
printf("%d\n",length);
}
else
{
if(length == 2)
{
if(arr[0] == arr[1])
{
printf("1\n");
}
else
{
printf("2\n");
}
continue;
}
if(!add(arr,length))
{
printf("%d\n",length);
}
else
{
printf("%d\n",length/(2*add(arr,length)));
}
}
}
return 0;
}