Pagini recente » Borderou de evaluare (job #1432419) | Diferente pentru utilizator/dan_yo intre reviziile 2 si 3 | Istoria paginii utilizator/dan_yo | Borderou de evaluare (job #2681671) | Cod sursa (job #913305)
Cod sursa(job #913305)
#include<fstream>
#include<cstring>
using namespace std;
int n,t,i,d[1000002],ok;
char a[1000002];
void prefix()
{
int i,k=0;
d[1]=0;
for(i=2;i<=n;++i)
{
while(k>0&&a[i]!=a[k+1])
k=d[k];
if(a[i]==a[k+1])
++k;
d[i]=k;
}
}
int main()
{
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
scanf("%d",&t);
while(t--)
{
scanf("%s",a+1);
n=strlen(a+1);
prefix();
ok=0;
for(i=n;i>=1&&!ok;--i)
if(d[i]&&i%(i-d[i])==0)
printf("%d\n",i),ok=1;
if(!ok)
printf("0\n");
}
return 0;
}