Pagini recente » Cod sursa (job #3296723) | Cod sursa (job #575186) | tema | Istoria paginii runda/oji2003/clasament | Cod sursa (job #2593711)
#include<stdio.h>
#include<string.h>
void search(char* sir1,char* sir2,FILE* g)
{
int M=strlen(sir1);
int N=strlen(sir2);
int cnt=0;
int k=0;
int p[N-M];
int i,j;
for(i=0;i<=N-M;i++)
{
int j;
for(j=0;j<M;j++)
if(sir2[i+j]!= sir1[j])
break;
if(j==M)
{
cnt++;
p[k]=i;
k++;
}
}
fprintf(g,"%d",cnt);
fprintf(g,"\n");
for(int i=0;i<k;i++)
fprintf(g,"%d ",p[i]);
}
int main()
{
FILE* f=fopen("strmatch.in","r");
FILE* g=fopen("strmatch.out","w");
char sir1[255];
fscanf(f,"%s",&sir1);
char sir2[255];
fscanf(f,"%s",&sir2);
search(sir1,sir2,g);
return 0;
}