Pagini recente » Cod sursa (job #2856450) | Cod sursa (job #2108254) | Cod sursa (job #1532953) | Cod sursa (job #3338515) | Cod sursa (job #3329030)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
const int lim = 1e6 + 5;
int n, m, lps[lim], v[1005], t,w;
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])
if(!i%(i-lps[i]))
w=i;
}
}
int main()
{fin>>t;
for(int i=1;i<=t;++i)
{fin >> a;
n = strlen(a);
w=0;
precalc();
for(int j=0; j<=n;++j)
lps[j]=0;
fout<<w<<'\n';
}
return 0;
}