Pagini recente » Cod sursa (job #219920) | Cod sursa (job #2059996) | Statistici Alexandra Suteu (alexandrasuteu) | Cod sursa (job #1477261) | Cod sursa (job #606751)
Cod sursa(job #606751)
#include <stdio.h>
#include <string.h>
#define NMax 2000000
int NrAp=0;
int VcAp[1000];
int h=0;
char A[NMax],B[NMax];
void cautare_naiva(char A[], char B[])
{
int i,k,j;
for(i=0;i<(strlen(B)-strlen(A));i++)
{
for( j=0,k=i;j<strlen(A);j++,k++)
if(A[j] != B[k])
break;
if(j == strlen(A))
{
NrAp++;
VcAp[h++]=i;
}
}
}
int main()
{
FILE *f,*g;
f=fopen("strmatch.in","r");
g=fopen("strmatch.out","w");
fscanf(f,"%s",&A);
fscanf(f,"%s",&B);
cautare_naiva(A,B);
fprintf(g,"%d \n",NrAp);
for(int i=0;i<h;i++)
fprintf(g,"%d ",VcAp[i]);
scanf("%d");
return 0;
}