Pagini recente » Cod sursa (job #2564269) | Cod sursa (job #2410294) | Cod sursa (job #1616194) | Cod sursa (job #1750901) | Cod sursa (job #1235213)
#include <cstdio>
#include <cstring>
using namespace std;
int pi[2000010],sol[1010],nr,n,n1,i,k;
char v[2000010],v1[2000010];
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s\n%s",v+1,v1+1);
n=strlen(v+1);
n1=strlen(v1+1);
for(i=2;i<=n;i++)
{
while(k>0 && v[k+1]!=v[i]) k=pi[k];
if(v[k+1]==v[i]) k++;
pi[i]=k;
}
k=0;
for(i=1;i<=n1;i++)
{
while(k>0 && v[k+1]!=v1[i]) k=pi[k];
if(v[k+1]==v1[i]) k++;
if(k==n)
{
sol[++nr]=i-k;
if(nr==1000) break;
k=pi[k];
}
}
printf("%d\n",nr);
for(i=1;i<=nr;i++) printf("%d ",sol[i]);
return 0;
}