Pagini recente » Cod sursa (job #3281160) | Cod sursa (job #999826) | Cod sursa (job #972168) | Cod sursa (job #2852558) | Cod sursa (job #1977620)
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define sz size
#define pb push_back
#define mp make_pair
#define bg begin
#define nd end
using namespace std;
#define int long long
const int maxn = 1000003;
const int maxk = 1003;
void solveKMP(){
vector<int> pref(maxn,0);
string s,skmp = "0";
cin >> s;
skmp += s;
int n = skmp.sz();
int ans = 0;
int q=0;
pref[1] = 0;
for(int i=2;i<=n;i++){
while(q && skmp[q+1]!=skmp[i]){
q = pref[q];
}
if(skmp[q+1] == skmp[i]) q++;
pref[i] = q;
if(pref[i] && i%(i-pref[i]) == 0){
ans = i;
}
}
cout << ans << '\n';
}
int32_t main(){
// #ifndef ONLINE_JUDGE
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
// #endif
ios_base::sync_with_stdio(false);
int t;
cin >> t;
for(int i=0;i<t;i++){
solveKMP();
}
return 0;
}