Cod sursa(job #616211)

Utilizator Cristina94Cristina Ungurean Cristina94 Data 11 octombrie 2011 22:34:17
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include<stdio.h>
int m, n, a[1025], b[1025], v[1025], nr;

int main()
{
	int i, j;
	freopen("cmlsc.in", "r", stdin);
	freopen("cmlsc.out", "w", stdout);
	scanf("%d %d", &m, &n);
	for(i=1;i<=m;i++)
		scanf("%d", &a[i]);
	for(i=1;i<=n;i++)
		scanf("%d", &b[i]);
	for(i=1;i<=m;i++)
		for(j=1;j<=n;j++)
			if(a[i]==b[j])
			{
				nr++;
				v[nr]=a[i];
			}
	printf("%d\n", nr);
	for(i=1;i<=nr;i++)
		printf("%d ", v[i]);
	return 0;
}