Pagini recente » Cod sursa (job #189226) | Cod sursa (job #1793396) | Cod sursa (job #2257278) | Cod sursa (job #1493389) | Cod sursa (job #1449384)
#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>>b;
n=strlen(a);
m=strlen(b);
for(i=1;i<n;i++)
{
while(k>0&&a[i]!=a[k])
k=p[k];
if(a[i]==a[k])
k++;
p[i]=k;
}
k=0;
for(i=0;i<m;i++)
{
while(k>0&&a[k]!=b[i])
k=p[k-1];
if(b[i]==a[k])
k++;
if(k==n)
{
if(h<=1000)
sol[++h]=i-k+1;
else
h++;
k=p[k-1];
}
}
fout<<h<<'\n';
for(i=1;i<=h&&i<=1000;i++)
fout<<sol[i]<<" ";
return 0;
}