Pagini recente » Cod sursa (job #1557538) | Cod sursa (job #2817620) | Cod sursa (job #1649619) | Cod sursa (job #1405232) | Cod sursa (job #2483170)
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const int nmax=1e6+3;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int main()
{
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin>>t;
while(t--)
{
int p[nmax];
forn(i,nmax) p[i]=0;
int c=0;
string a;
cin>>a;
int sol=0;
for(int i=1;i<a.size();i++)
{
while(c>0 && a[i]!=a[c]) c=p[c-1];
if(a[i]==a[c]) c++;
p[i]=c;
}
int k=a.size();
for(int i=k-1;i>=0;i--)
{
if(p[i]!=0 && (i+1)%(i-p[i]+1)==0)
{
sol=i+1;
break;
}
}
cout<<sol<<"\n";
}
}