Pagini recente » Cod sursa (job #2366411) | Cod sursa (job #2371487) | Cod sursa (job #2589090) | Cod sursa (job #1697162) | Cod sursa (job #2365483)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char a[2000100],b[2000100];
int p[2000100],n,m,ans[2000100],poz,k;
int main()
{
in>>(a+1);
in>>(b+1);
int j=0;
int i=2;
n=strlen(a+1);
p[1]=0;
while(i<=n)
{
while(a[i]!=a[j+1]&&j>0) j=p[j];
if(a[i]==a[j+1])
j++;
p[i]=j;
i++;
}
m=strlen(b+1);
poz=0;
i=1;
while(i<=m)
{
while(b[i]!=a[poz+1]&&poz>0) poz=p[poz];
if(b[i]==a[poz+1]) poz++;
if(poz==n)
{
ans[++k]=i-n;
poz=p[n];
}
i++;
}
out<<k<<'\n';
for(int i=1;i<=k;i++) out<<ans[i]<<" ";
return 0;
}