Pagini recente » Cod sursa (job #2416928) | Cod sursa (job #1545929) | Cod sursa (job #3236247) | Cod sursa (job #1175123) | Cod sursa (job #2672569)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
char a[1000001];
int p[1000001],i,n,m,s,k,j;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
m=strlen(a);
memset(p,0,sizeof(p));
s=0;
for(j=1;j<m;j++)
{
k=p[j-1];
while(k>0&&a[k]!=a[j]) k=p[k-1];
if(a[j]==a[k]) k++;
p[j]=k;
if(p[j]>0&&(j+1)%(j-p[j]+1)==0) s=j+1;
}
for(j=0;j<m;j++) fout<<p[j]<<" ";
fout<<s<<'\n';
}
return 0;
}