Cod sursa(job #2292742)

Utilizator valentin35Valentin Popescu valentin35 Data 29 noiembrie 2018 21:52:49
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");


int main() {
	int a[1030], b[1030], m, n, c[1030], nr = 0;
	fin >> m >> n;

	for (int i = 1; i <= m; i++)
		fin >> a[i];
	for (int i = 1; i <= n; i++)
		fin >> b[i];

	int f = 1;
	for (int i = 1; i <= m; i++)
		for (int j = 1; j <= n; j++)
			if (a[i] == b[j])
			{
				nr++;
				c[f] = a[i];
				f++;
			}
	fout << nr << "\n";

	for (int i = 1; i <= nr; i++)
		fout << c[i] << " ";

	return 0;

}