Pagini recente » Cod sursa (job #3306050) | Cod sursa (job #3306800) | Cod sursa (job #3349444) | Cod sursa (job #2987250) | Cod sursa (job #3329036)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int lim = 1e6 + 5;
int t, n, lps[lim], ans;
char a[lim];
void precalc()
{
int k = 0;
for (int i = 2; i <= n; ++i)
{
while (k && a[k] != a[i - 1]) k = lps[k];
if (a[k] == a[i - 1]) k++;
lps[i] = k;
if (lps[i] > 0 && i % (i - lps[i]) == 0) ans = i;
}
}
int gcd(int a,int b)
{
int r;
while (b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
void testcase()
{
fin >> a;
n = strlen(a);
precalc();
fout << ans <<'\n';
}
int main()
{
fin >> t;
for (; t; --t)
testcase();
return 0;
}