Pagini recente » Borderou de evaluare (job #1220816) | Borderou de evaluare (job #787503) | Borderou de evaluare (job #2065479) | Borderou de evaluare (job #1719730) | Cod sursa (job #1252806)
#include<cstdio>
#include<string.h>
int ;
int main()
{
freopen("prefix.in","r",stdin);
freopen("prefix.out","w",stdout);
scanf("%d",&h);
for(l=1;l<=h;l++)
{
gets(x+1);
n=strlen(x+1);
k=0;
p[1]=0;
for(i=2;i<=n;i++)
{
while(k>0&&x[i]!=x[k+1])
{
k=p[k];
}
if(x[i]==x[k+1]) k++;
p[i]=k;
}
for(i=k;i>=1;i--)
{
//if(p[i])
}
}
return 0;
}