Pagini recente » Cod sursa (job #1638340) | Cod sursa (job #376004) | Cod sursa (job #886079) | Cod sursa (job #2942692) | Cod sursa (job #1653225)
#include <bits/stdc++.h>
using namespace std;
char S[1000010];
int p[1000010];
int T,rs;
int i,k,l,n;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
assert(freopen("prefix.in", "rt", stdin));
assert(freopen("prefix.out", "wt", stdout));
(cin >> T).ignore(1);
while(T--){
cin.getline(S+1,100010);
l = k = rs = p[1] = 0;
for(i = 2;S[i];i++){
while(k && S[k+1] != S[i])
k = p[k];
if(S[k+1] == S[i]) k++;
p[i] = k;
if(k && i-k == l) n++;
else
if(k && i-k > l) l = i-k, n = 1;
else n = 0;
if(n && n >= l) rs = l*(n/l+1);
//fout << S[i] << ' ' << k << ' ' << l << ' ' << n << ' ' << rs << '\n';
}
cout << rs << "\n";
}
}