Pagini recente » Cod sursa (job #2541419) | Cod sursa (job #1619907) | Cod sursa (job #1941477) | Cod sursa (job #2130230) | Cod sursa (job #1798438)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char N[2000001],M[2000001];
int urm[2000003],v[1005],d,x,y,k,i,q;
int main()
{
f>>N>>M;
k=0;
urm[1]=0;
x=strlen(N);
y=strlen(M);
for(i=2; i<=x; i++)
{
while(k>0&& N[k]!=N[i-1]) k=urm[k];
if(N[k]==N[i-1]) k++;
urm[i]=k;
}
q=0;
for(i=0; i<y; i++)
{
while(q>0 && N[q]!=M[i]) q=urm[q];
if(N[q]==M[i]) q++;
if(q==x)
{
d++;
if(d<=1000) v[d]=i-x+1;
}
}
g<<d<<'\n';
if (d>1000)d=1000;
for(i=1; i<=d; i++)
g<<v[i]<<" ";
return 0;
}