Pagini recente » Cod sursa (job #3213555) | Cod sursa (job #231342) | Cod sursa (job #155101) | Cod sursa (job #2830652) | Cod sursa (job #2288922)
#include <fstream>
#include <cstring>
using namespace std;
char s[1000010];
int p[1000010],i,m,k,q,max1,n,ok;
int main()
{
ifstream fin ("prefix.in");
ofstream fout ("prefix.out");
fin>>n;
for(q=1;q<=n;q++)
{
fin>>s+1;
m=strlen(s+1);
k=0;
for(i=2;i<=m;i++)
{
for(;k!=0&&s[k+1]!=s[i];) k=p[k];
if(s[k+1]==s[i]) k++;
p[i]=k;
}
ok=0;
for(i=m;i>=1;i--)
{
if(p[i]!=0&&i%(i-p[i])==0) {ok=1;fout<<i<<'\n';break;}
}
if(ok==0) fout<<0<<'\n';
}
return 0;
}