Cod sursa(job #2613916)
| Utilizator | Data | 10 mai 2020 20:43:33 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
int main()
{
int i, j, n, m, sir1[1024], sir2[1024], sirFinal[1024];
fin >> n >> m;
for (i = 1; i <= n; i++)
fin >> sir1[i];
for (j = 1; j <= m; j++)
fin >> sir2[j];
int l = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= m ; j++)
if (sir1[i] == sir2[j])
sirFinal[++l] = sir1[i];
fout << l << '\n';
for (i = 1; i <= l; i++)
fout << sirFinal[i] << " ";
return 0;
}
