Pagini recente » Cod sursa (job #1642183) | Cod sursa (job #1923295) | Cod sursa (job #1101579) | Cod sursa (job #1881442) | Cod sursa (job #2548190)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int DIM = 1e6;
int phi[DIM];
main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
{
string s;
fin >> s;
int l = s.size();
int pos = 0;
int ans = 0;
int k = 0;
for(int i = 2; i <= l; i++)
{
while(k && s[k] != s[i - 1])
k = phi[k];
if(s[k] == s[i - 1])
k++;
phi[i] = k;
if(phi[i] != 0 && i % (i - phi[i]) == 0)
ans = i;
}
fout << ans << '\n';
}
}