Cod sursa(job #776932)

Utilizator miu_mik93FMI - Paduraru Miruna miu_mik93 Data 10 august 2012 17:34:35
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include<iostream>
#include <fstream>
using namespace std;
freopen("cmlsc.in", "r", stdin);
freopen("cmlsc.out", "w", stdout);
int main()
{
	int A[128], B[128], n, m, MAX[256];
	scanf("%d",&n);
	scanf("%d",&m);
	for(int i=1; i<=n; i++)
		scanf("%d", &A[i]);
	for(int i=1; i<=m; i++)
		scanf("%d", &B[i]);
	int j = 1, z = 1, k = 1;
	for(j=1; j<=n; j++)
		for(z=1; z<=m; z++)
			if(A[j] == B[z])
				MAX[k++] = A[j];
	--k;
	printf("%d\n ", k);
	for(z=1; z<=k; z++)
		printf("%d", MAX[z]);
	return 0;
}