问题类型：字符串，周期。
03pie’s solution for [UVA-455]：
#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<fstream>
#include<list>
using namespace std;#define ms(s) memset(s,0,sizeof(s))typedef unsigned long long ULL;
typedef long long LL;const double PI = 3.141592653589;
const int INF = 0x3fffffff;
#define maxn 140
int main(){// freopen("F://inp.txt","r",stdin);int T;char s[maxn];scanf("%d",&T);bool first=true;while(T--){scanf("%s",s);int len=strlen(s);bool p=false;for(int d=1;d<=len/2;d++){int i;bool q=true;for(i=0;i<len-d;i++){if(s[i]!=s[i+d]){q=false;break;}}if(q&&len%d==0){if(first){printf("%d\n",d);first=!first;}else printf("\n%d\n",d);p=true;break;} }if(!p) {if(first){printf("%d\n",len);first=!first;}else printf("\n%d\n",len);}}return 0;
}