Pagini recente » Cod sursa (job #2060121) | Cod sursa (job #2123711) | Cod sursa (job #1740598) | Cod sursa (job #3142870) | Cod sursa (job #921935)
Cod sursa(job #921935)
#include<fstream>
#include<cstring>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
int t,i,urm[1000001],n;
char p[1000001];
void Prefix()
{
int k=0;
urm[1]=0;
for(int i=2;i<=n;++i)
{
while(k>0&&p[i]!=p[k+1])
k=urm[k];
if(p[i]==p[k+1]) k++;
urm[i]=k;
}
}
int main()
{
fin>>t;
while(t--)
{
fin>>(p+1);
n = strlen(p+1);
Prefix();
bool ok=false;
for(i=n;i&&!ok;i--)
if(urm[i]&&i%(i-urm[i])==0)
fout<<i<<"\n",ok=true;
if(!ok)
fout<<"0\n";
}
fin.close();
fout.close();
return 0;
}