UVA455

#include"string"#include"iostream"#include"stdio.h"#include"algorithm"using namespace std;int main(){int n;cin>>n;while(n--){int T;int i,j;string a;int t[80+5];t[0]=1;cin>>a;int cnd=1;        int ts=a.size();    for(i=2;i<=ts;i++){if(ts%i==0)t[cnd++]=i;}sort(t,t+cnd);for(i=0;i<cnd;i++){for(j=0;j<int(a.size())-t[i];j++){if(a[j]==a[j+t[i]])continue;else break;}if(j==(int)a.size()-t[i]){T=t[i];break;}}cout<<T<<endl;if(n)cout<<endl;}return 0;}