Pagini recente » Cod sursa (job #1991328) | Cod sursa (job #1777463) | Cod sursa (job #2675869) | Cod sursa (job #84232) | Cod sursa (job #1449412)
#include <fstream>
#include <string.h>
#define dim 2000001
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[dim],b[dim];
int n,m,i,k,p[dim],h;
int sol[1001];
int main()
{
fin>>(a+1)>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
for(i=2;i<=n;i++)
{
while(k>0&&a[i]!=a[k+1])
k=p[k];
if(a[i]==a[k+1])
k++;
p[i]=k;
}
k=0;
for(i=1;i<=m;i++)
{
while(k>0&&a[k+1]!=b[i])
k=p[k];
if(b[i]==a[k+1])
k++;
if(k==n)
{
if(h<=1000)
sol[++h]=i-k;
else
h++;
k=p[k];
}
}
fout<<h<<'\n';
for(i=1;i<=h&&i<=1000;i++)
fout<<sol[i]<<" ";
return 0;
}