Pagini recente » Cod sursa (job #2701019) | Cod sursa (job #2384217) | Cod sursa (job #1323091) | Cod sursa (job #306285) | Cod sursa (job #2759693)
#include <bits/stdc++.h>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int pi[1000005];
int main()
{
int teste;
f>>teste;
while(teste--)
{
string s;
f>>s;
int n=s.size();
s=" "+s;
int j=0;
int ans=0;
for(int i=2; i<=n; i++)
{
while( j && s[j+1]!=s[i] )
j=pi[j];
if( s[j+1]==s[i] ) j++;
pi[i]=j;
if( j && i%(i - pi[i])==0 ) ans=i;
}
g<<ans<<'\n';
}
return 0;
}