Pagini recente » Cod sursa (job #1947641) | Cod sursa (job #2054894) | Cod sursa (job #1158734) | Cod sursa (job #2659516) | Cod sursa (job #2106285)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char p[100];
int n,i,j,l,k,urm[100],lp,poz,y,i1;
void prefix()
{
k=0;
urm[1]=0;
for(i=2;i<=l;++i)
{while(k>0&&p[i]!=p[k+1])
k=urm[k];
if(p[i]==p[k+1])
++k;
urm[i]=k;
}
}
int main()
{f>>n;
for(i1=1;i1<=n;++i1)
{f>>p+1;
p[0]='*';
k=0;
l=strlen(p);
prefix();
poz=0;
for(j=1;j<=l;++j)
if(urm[j]!=0&&j%(j-urm[j])==0)
poz=j;
g<<poz<<'\n';
}
return 0;
}