Cod sursa(job #2441681)
| Utilizator | Data | 20 iulie 2019 20:00:10 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 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,k,c[1024];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(j=1;j<=m;j++)
f>>b[j];
k=0;
for(i=1;i<=n;i++){
ok=0;
for(j=1;j<=m && !ok;j++)
if(a[i]==b[j]) ok=1;
if(ok) c[++k]=a[i];
}
g<<k<<'\n';
for(i=1;i<=k;i++)
g<<c[i]<< " ";
return 0;
}
