Pagini recente » Cod sursa (job #53479) | Cod sursa (job #362470) | Cod sursa (job #1372241) | Cod sursa (job #1832043) | Cod sursa (job #3202942)
// #include <iostream>
#include <fstream>
#include <string>
using namespace std;
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int lps[1000001] = { 0 };
void solveEach()
{
int r = 0;
string a;
getline(cin, a);
int q = 0, m = a.size();
for (int i = 2; i <= m; i++)
{
while (q && a[q] != a[i - 1])
q = lps[q];
if (a[q] == a[i - 1])
q++;
lps[i] = q;
}
for (int i = 1; i <= m; i++)
if (i % (i - lps[i]) == 0 && i / (i - lps[i]) > 1)
r = max(r, i);
cout << r << '\n';
}
int main()
{
int n;
cin >> n;
cin.get();
for (int it = 0; it < n; it++)
{
solveEach();
}
return 0;
}