Pagini recente » Cod sursa (job #3140547) | Cod sursa (job #2060507) | Cod sursa (job #1546509) | Cod sursa (job #1770702) | Cod sursa (job #212656)
Cod sursa(job #212656)
#include<cstdio>
#include<cstring>
#define M 2000001
char a[M],b[M];
long p[M],R[1003],r;
void st()
{
scanf("%s%s",a,b);
int n=strlen(a),m=strlen(b);
int k=0,i;
for(i=2;i<=n;i++)
{
while(k>0&&a[k]!=a[i-1])
k=p[k];
if(a[k]==a[i-1])
k++;
p[i]=k;
}
k=0;
for(i=1;i<=m;i++)
{
while(k>0&&a[k]!=b[i-1])
k=p[k];
if(a[k]==b[i-1])
k++;
if(k==n)
{
r++;
if(r<=1000)
R[r]=i-n;
}
}
}
void af()
{
printf("%ld\n",r);
for(int i=1;i<=r&&i<=1000;i++)
printf("%ld ",R[i]);
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
st();
af();
return 0;
}