Pagini recente » Cod sursa (job #2255788) | Cod sursa (job #85051) | Cod sursa (job #1417073) | Cod sursa (job #91161) | Cod sursa (job #1798392)
#include <fstream>
#include <string.h>
using namespace std;
char N[2000000],M[2000000];
int urm[2000000],ap[1001],i,q,n,m,k,j;
int main()
{
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
fin >> N >> M;
n=strlen(N);
for (i=2;i<=n;i++)
{
while(k>0 && N[k]!=N[i-1])k=urm[k];
if (N[k]==N[i-1])k++;
urm[i]=k;
}
m=strlen(M);
for (i=0;i<m;i++)
{
while (q && N[q]!=M[i])q=urm[q];
if (N[q]==M[i])q++;
if (q==n)ap[++j]=i-n+1;
}
fout << j << '\n';
for (i=1;i<=min(1000,j);i++)fout << ap[i] << " ";
fout << '\n';
return 0;
}