Cod sursa(job #2333297)

Utilizator ioanmacaveiMacavei Ioan ioanmacavei Data 31 ianuarie 2019 20:48:35
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 0.56 kb
#include <fstream>
#include <vector>
using namespace std;

short *a;
short *b;
vector<short>c;
short m1, m2, i,j;

int main()
{
	ifstream in("cmlsc.in");
	ofstream out("cmlsc.out");

	in >> m1;
	in >> m2;

	a = new short[m1];
	b = new short[m2];

	for (i = 0; i < m1; i++)
		in >> a[i];
	for (i = 0; i < m2; i++)
	{
		in >> b[i];
	}

	for (i=0;i<m1;i++)
		for (j = 0; j < m2; j++)
		{
			if (a[i] == b[j])
			{
				c.push_back(a[i]);
				break;
			}
		}
	out << c.size() << "\n";
	for (i = 0; i < c.size(); i++)
		out << c[i] << " ";
}