Pagini recente » Cod sursa (job #938390) | Cod sursa (job #2676120) | Cod sursa (job #2989626) | Cod sursa (job #25580) | Cod sursa (job #2397420)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char s[1000010];
int n,i,q,t,ans,p[1000010],k;
int main()
{
f>>t;
for(q=1;q<=t;q++)
{
f>>(s+1);
k=0;
n=strlen(s+1);
for(i=1;i<=n;i++)
p[i]=0;
for(i=2;i<=n;i++)
{
while(k!=0&&s[k+1]!=s[i])k=p[k];
if(s[k+1]==s[i])k++;
p[i]=k;
}
ans=0;
for(i=n;i>=1;i--)
{
if(p[i]!=0&&i%(i-p[i])==0){ans=i;i=0;}
}
g<<ans<<'\n';
}
return 0;
}