Pagini recente » Cod sursa (job #261620) | Cod sursa (job #2170348) | Cod sursa (job #1781220) | Cod sursa (job #1630438) | Cod sursa (job #1653208)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
string S;
int p[1000100];
int T,rs;
int main(){
ios::sync_with_stdio(0);
fin.tie();
for(fin >> T;T--;){
fin >> S;
int N = S.length(),i,k,l,n;
l = k = rs = n = 0;
for(i = 2;i<=N;i++){
while(k && S[k] != S[i-1])
k = p[k];
if(S[k] == S[i-1]) 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-1] << ' ' << k << ' ' << l << ' ' << n << ' ' << rs << '\n';
}
fout << rs << "\n";
}
}