Cod sursa(job #3247714)
Utilizator | Data | 8 octombrie 2024 21:12:30 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n , m;
int a[2030] , b[2030];
int main()
{
int i , j;
fin >> n >> m;
for(i = 1;i <= n;i++)
fin >> a[i];
for(j = 1;j <= m;j++)
fin >> b[j];
for(i = 1;i <= n;i++)
{
for(j = 1;j <= m;j++)
if(a[i] == b[j]) fout << a[i] << " ";
}
return 0;
}
/**
*/