Pagini recente » Cod sursa (job #838557) | Cod sursa (job #1366336) | Cod sursa (job #2368113) | Cod sursa (job #615530) | Cod sursa (job #1167155)
#include <iostream>
#include <fstream>
#include <cstring>
#include <iomanip>
using namespace std;
int m,n,p[1000014],sol,t;
char a[1000014];
void make_p()
{
int i,j,k=0;
p[1]=0;
for (i=2;i<=n;i++)
{
while (k>0 && a[k+1]!=a[i])
k=p[k];
if (a[k+1]==a[i])
k++;
p[i]=k;
}
}
int main()
{
int i,j,k;
fstream f,g;
f.open("prefix.in",ios::in);
g.open("prefix.out",ios::out);
f>>t;
while (t--)
{
f>>a+1;
n=strlen(a+1);
make_p ();
for (i=n;i>=1;i--)
{
if (p[i] && i%(i-p[i])==0)
{
g<<i<<'\n';
break;
}
}
if (i==0)
g<<0<<'\n';
}
}