Pagini recente » Arhiva de probleme | Cod sursa (job #140672) | Istoria paginii runda/td/clasament | Cod sursa (job #295778) | Cod sursa (job #2106267)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int lp,lt,i,k,urm[100000],poz,n,j;
char t[1000000];
void prefix()
{int k,j;
for(j=1;j<=lt;++j)
urm[j]=0;
k=0;
urm[1]=0;
for(j=2;j<=lt;++j)
{while(k>0 && t[j]!=t[k+1])
k=urm[k];
if(t[j]==t[k+1])
++k;
urm[j]=k;
}
}
int main()
{f>>n;
f.get();
for(i=1;i<=n;++i)
{f.getline(t,256);
lt=strlen(t);
for(j=lt;j>0;--j)
t[j]=t[j-1];
prefix();
poz=0;
for(j=1;j<=lt;++j)
if(urm[j] && j%(j-urm[j])==0)
poz=j;
g<<poz<<'\n';
}
return 0;
}