Pagini recente » Cod sursa (job #651872) | Rezultatele filtrării | Cod sursa (job #1661928) | Cod sursa (job #2827224) | Cod sursa (job #2548188)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
vector <int> phi;
main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
{
string s;
fin >> s;
int l = s.size();
int pos = 0;
phi.assign(l + 1, 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';
}
}