Cod sursa(job #1844544)
Utilizator | Data | 10 ianuarie 2017 02:28:24 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 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];
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++;
}
}
}
g << k << "\n";
for (i = 1;i <= m;i++)
{
for (j = 1;j <= n;j++)
{
if (a[i] == b[j])
{
g << a[i] << " ";
}
}
}
g << "\n";
f.close();;
g.close();
return 0;
}