Pagini recente » Cod sursa (job #2187657) | Cod sursa (job #549353) | Cod sursa (job #1878860) | Cod sursa (job #1919315) | Cod sursa (job #2658838)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int k,q,nr,n,m,urm[2000001],v[1001];
char N[2000001],M[2000001];
int main()
{
int i;
f.getline(N,2000000);
f.getline(M,2000000);
k=0;n=strlen(N);urm[1]=0;
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;
}
q=0;nr=0;m=strlen(M);
for (i=0;i<m;i++)
{
while (q>0 && N[q]!=M[i]) q=urm[q];
if (N[q]==M[i]) q++;
if (q==n && nr<1000) v[++nr]=i-n+1;
}
g<<nr<<'\n';
for (i=1;i<=nr;i++) g<<v[i]<<" ";
return 0;
}