Cod sursa(job #2547650)
| Utilizator | Data | 15 februarie 2020 15:55:03 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int main()
{
int n,m,a[1024],b[1024],c[1024];
fin>>m>>n;
for(int i=1;i<=m;i++)
fin>>a[i];
for(int i=1;i<=n;i++)
fin>>b[i];
int d=1;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(a[i]==b[j]){
c[d]=a[i];
d++;
}
}
}
d--;
fout<<d<<'\n';
for(int i=1;i<=d;i++)
fout<<c[i]<<" ";
return 0;
}
