Pagini recente » Cod sursa (job #2420865) | Cod sursa (job #2420871) | Cod sursa (job #3340096) | Cod sursa (job #2420868) | Cod sursa (job #2420848)
#include<cstdio>
#define N 2000001
char s[N],u[N],r[2*N];
int v[1000],i,t,k,m,n,p[N],l,o=-1;
inline void S(int x)
{
int i,d=x>999999?7:x>99999?6:x>9999?5:x>999?4:x>99?3:x>9?2:1;
for(i=d-1;i>=0;x/=10,i--)
r[l+i]=x%10+48;
l+=d;
}
int main()
{
freopen("strmatch.in","r",stdin),freopen("strmatch.out","w",stdout),fread(r,1,2*N,stdin);
for(o++;r[o]!=10;o++)
s[++m]=r[o];
for(o++;r[o]!=10;o++)
u[++n]=r[o];
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++;
}
}
S(t),r[l++]=10,t=t<1000?t:1000;
for(i=0;i<t;i++)
S(v[i]),r[l++]=32;
fwrite(r,1,l,stdout);
}