Pagini recente » Cod sursa (job #166169) | Cod sursa (job #2272748) | Cod sursa (job #1026772) | Istoria paginii runda/jkn | Cod sursa (job #2306533)
#include<cstdio>
#include<cstring>
#define N 2000001
char s[N],u[N];
int v[1000],i,t,k,m,n,p[N];
int main()
{
freopen("strmatch.in","r",stdin),freopen("strmatch.out","w",stdout),gets(s),gets(u),m=strlen(s),n=strlen(u);
for(i=m;i;i--)
s[i]=s[i-1];
for(i=n;i;i--)
u[i]=u[i-1];
for(i=2;i<=m;p[i++]=k)
{
for(;k&&s[k+1]!=s[i];k=p[k]);
if(s[k+1]==s[i])
k++;
}
for(k=0,i=1;i<=n;i++)
{
for(;k&&s[k+1]!=u[i];k=p[k]);
if(s[k+1]==u[i])
k++;
if(k==m)
{
if(t<1000)
v[t]=i-m;
k=p[m],t++;
}
}
printf("%d\n",t),t=t<1000?t:1000;
for(i=0;i<t;i++)
printf("%d ",v[i]);
}