Cod sursa(job #496880)

Utilizator alex_under08Alex Carpalete alex_under08 Data 30 octombrie 2010 23:53:30
Problema Cel mai lung subsir comun Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.57 kb
#include "stdio.h"
	int main()
		{
			long long int n,m,i;
			FILE* a = fopen("cmlsc.in","r");
			FILE* b = fopen("cmlsc.out","w");
			fscanf(a,"%d %d",&n,&m);
			long long int c[n],d[m],e[n];	
			for(i=0;i<n;i++)
				{
				fscanf(a,"%d",&c[i]);
				}
			for(i=0;i<m;i++)
				{
				fscanf(a,"%d",&d[i]);
				}
		        long long int j,max=0;			
			for(i=0;i<=n;i++)
			{
				for(j=0;j<=m;j++)
					if(c[i]==d[j])
						{
						e[max]=c[i];				
						max++;
						}
			}
			fprintf(b,"%d \n",max);
			i=0;
			while(i<max)
				{
					fprintf(b,"%d ",e[i]);
					i++;
				}
		return 0;
		}