Pagini recente » Cod sursa (job #121037) | Cod sursa (job #2170066) | Cod sursa (job #2856045) | Cod sursa (job #1560172) | Cod sursa (job #2846539)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
int pi[1000001];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int q;
fin >> q;
while (q--) {
string s;
fin >> s;
s = '$' + s;
int n = s.size() - 1;
for (int i = 2; i <= n; ++i) {
int j = pi[i - 1];
while (j && s[j + 1] != s[i]) {
j = pi[j];
}
if (j == 0) {
pi[i] = (s[1] == s[i]);
}
else {
pi[i] = j + 1;
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (pi[i] && i % (i - pi[i]) == 0) {
ans = i;
}
}
fout << ans << '\n';
}
}