Cod sursa(job #321506)

Utilizator johnny2008Diaconu Ion johnny2008 Data 6 iunie 2009 15:20:42
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <stdio.h>
#include <math.h>
FILE *f;   
int main(void){
	int n,m;
	f=fopen("cmlsc.in","r");   
    fscanf(f,"%d %d",&m,&n);   
    int a[m],b[n];
    int i;
	for (i=1;i<=m;i++){
		fscanf(f,"%d",&a[i]);
	}
    for (i=1;i<=n;i++){
		fscanf(f,"%d",&b[i]);
	} 
	int j,c=0;
	int v[1024];
	fclose(f);
	for (i=1;i<=m;i++){
		for (j=1;j<=n;j++){
			if (a[i]==b[j]){
				c+=1;
				v[c]=a[i];
			}
		}
	}
	f=fopen("cmlsc.out","w");
	fprintf(f,"%d\n",c);
	for (i=1;i<=c;i++){
		fprintf(f,"%d ",v[i]);
	}
	fprintf(f,"%d\n",c);
}