Cod sursa(job #1844543)

Utilizator trifangrobertRobert Trifan trifangrobert Data 10 ianuarie 2017 02:26:02
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <iostream>
#include <fstream>

using namespace std;

int main()
{
	ifstream f("cmlsc.in");
	ofstream g("cmlsc.out");
	int i,j,l=0,m, n, a[1030], b[1030],c[1030];
	f >> m >> n;
	for (i = 1;i <= m;i++)
		f >> a[i];
	for (i = 1;i <= n;i++)
		f >> b[i];
	int k = 0;
	for (i = 1;i <= m;i++)
	{
		for (j = 1;j <= n;j++)
		{
			if (a[i] == b[j])
			{
				k++;
				c[++l] = a[i];
			}
		}
	}
	g << k << "\n";
	for (i = 1;i <= l;i++)
		g << c[i] << " ";
	g << "\n";
	f.close();;
	g.close();
	return 0;
}