Cod sursa(job #499084)

Utilizator muscaTudose Vlad-Adrian musca Data 8 noiembrie 2010 18:52:31
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include<stdio.h>
int a[100001];
int b[100001];
int c[100001];
int main()
{
 freopen("cmlsc.in","r",stdin);
 freopen("cmlsc.out","w",stdout);
 int n,m,i,k,j;
 scanf("%d%d",&n,&m);
       k=0;
 for(i=1;i<=n;i++)
	scanf("%d",&a[i]);
 for(i=1;i<=m;i++)
	scanf("%d",&b[i]);
 for(i=1;i<=n;i++)
	for(j=1;j<=m;i++)
		if(a[i]==b[j])
			c[++k]=a[i];
 printf("%d\n",k);
 for(i=1;i<=k;i++)
	printf("%d ",c[i]);
 return 0;
}