Solution:
/******************************************************************
*** Problem : ***
*** Author : Shipu Ahamed (Psycho Timekiller) ***
*** E-mail : shipuahamed01@gmail.com ***
*** University : BUBT,Dept. of CSE ***
*** Team : BUBT_Psycho ***
*** My Blog : http://shipuahamed.blogspot.com ***
*** Facebook : http://www.facebook.com/DeesheharaShipu ***
******************************************************************/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()
#define CP(a) cout< vi;
typedef vector vll;
typedef vector vs;
typedef set si;
typedef set ss;
typedef map mii;
typedef map mll;
typedef map msi;
typedef map mci;
template string toString( T Number ){stringstream st;st << Number;return st.str();}
template T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}
//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforab(i,(n)-1,0)
#define rfor1(i,n) rforab(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)
//File input/output
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
//upper bound and lower bound
#define LB(a,value) (lower_bound(all(a),value)-a.begin())
#define UB(a,value) (upper_bound(all(a),value)-a.begin())
//Test Case & New line
#define Case(no) cout<<"Case "<<++no<<": "
#define nl puts("")
int stringconvert(string s){int p; istringstream st(s); st>>p ; return p;}
ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}
////============ CONSTANT ===============////
#define mx7 10000007
#define mx6 1000006
#define mx5 100005
#define inf 1<<30 //infinity value
#define eps 1e-9
#define mx (100010)
#define mod 1000000007
////=====================================////
string p;
int pre[mx6],m;
void prefix()
{
int q=0;
pre[1]=0;
forab(i,2,m)
{
while(q>0 && p[q+1]!=p[i])
{
q=pre[q];
}
if(p[q+1]==p[i])
q++;
pre[i]=q;
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie();
int t,no=0;
cin>>t;
while(t--)
{
cin>>p;
m=sz(p);
p=" "+p;
prefix();
int res=m-pre[m];
if(m%res==0)
{
CP(res);
}
else
{
CP(m);
}
if(t) cout<<"\n";
}
return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/455/455.cpp