Pagini recente » Cod sursa (job #857745) | Monitorul de evaluare | Cod sursa (job #991144) | Cod sursa (job #1172992) | Cod sursa (job #1710963)
#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; f.get();
while (t){
memset(s, 0, 1000004);
f.getline(s+1, 1000004);
//g << s+1 << ' ';
maxim = 0;
l1 = strlen(s+1);
p = 0;
memset(prec, 0, sizeof(prec));
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;
}