Pagini recente » Cod sursa (job #284241) | Cod sursa (job #1755344) | Cod sursa (job #537751) | Cod sursa (job #942433) | Cod sursa (job #2365517)
#include <bits/stdc++.h>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
int t,n,p[1000100],ok;
char v[1000100];
void makep(char v[],int n)
{
int j=0;
int i=2;
p[1]=0;
while(i<=n)
{
while(v[i]!=v[j+1]&&j>0) j=p[j];
if(v[i]==v[j+1]) j++;
p[i]=j;
i++;
}
}
int main()
{
in>>t;
while(t--)
{
in>>(v+1);
ok=0;
n=strlen(v+1);
makep(v,n);
for(int i=n;i>0;i--)
if(i%(i-p[i])==0&&p[i]!=0)
{
out<<i<<'\n';
i=0;
ok=1;
}
if(!ok) out<<ok<<'\n';
}
return 0;
}