Pagini recente » Cod sursa (job #533580) | Cod sursa (job #397163) | Cod sursa (job #824137) | Cod sursa (job #1390339) | Cod sursa (job #1710959)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int t, l1, i, maxim, p, prec[1000005];
char s[1000005];
int main(){
f >> t;
while (t){
f >> s+1;
maxim = 0;
l1 = strlen(s+1);
p = 0;
for (i = 0; i <= l1; i++)
prec[i] = 0;
for (i = 2; i <= l1; i++){
while (p && s[p+1] != s[i])
p = prec[p];
if (s[p+1] == s[i])
p++;
prec[i] = p;
if (p>0 && i%(i-p) == 0) maxim = i;
}
g << maxim << '\n';
t--;
}
return 0;
}