Pagini recente » Cod sursa (job #769556) | Cod sursa (job #2282677) | Cod sursa (job #906024) | Cod sursa (job #994191) | Cod sursa (job #1798388)
#include <stdio.h>
#include <string.h>
using namespace std;
FILE*f=fopen("strmatch.in","r");
FILE*g=fopen("strmatch.out","w");
char N[2000001],M[2000001];
int urm[2000003],v[1005];
int main()
{
int n,m,i,k,q,nr=0;
fscanf(f,"%s\n%s",N,M);
//partea 1-formarea prefixelor lui N
n=strlen(N);
k=0;
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;
}
//partea 2-potrivirea
m=strlen(M);
q=0;
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++;if (nr<1000) v[nr]=i-n+1;}
}
fprintf(g,"%d\n",nr);
for (i=1;i<=nr&&i<=1000;i++)
{
fprintf(g,"%d ",v[i]);
}
fclose(g);
fclose(f);
return 0;
}