Cod sursa(job #2441674)
Utilizator | Data | 20 iulie 2019 19:54:20 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int a[1025],b[1025],i,j,ok,n,m;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(j=1;j<=m;j++)
f>>b[j];
for(i=1;i<=n;i++){
ok=0;
for(j=1;j<=m && !ok;j++)
if(a[i]==b[j]) ok=1;
if(ok) g<<a[i]<< " ";
}
return 0;
}