Cod sursa(job #1263509)

Utilizator ENiGMAAxinte Sebastian ENiGMA Data 14 noiembrie 2014 20:45:03
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include<fstream>

using namespace std;

int main(){
	int n, m, v1[1025], v2[1025], size=0, solutie[1025];
	ifstream input("cmlsc.in");
	input >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		input >> v1[i];
	}
	
	for (int i = 1; i <= m; i++)
	{
		input >> v2[i];
		for (int j = 1; j <= n; j++)
		{
			if (v1[j] == v2[i])
			{
				solutie[size] = v1[j];
				size += 1;
			}
		}
	}
	input.close();

	ofstream output("cmlsc.out");

	output << size << "\n";
	for (int i = 1; i <= size; i++)
	{
		output << solutie[i] << " ";
	}
	return 0;

}