Cod sursa(job #2877639)
| Utilizator | Data | 25 martie 2022 09:36:44 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int main()
{
int n,m,vn[1025],vm[1025],sol[1025],poz=0;
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>vn[i];
for(int i=1;i<=m;i++)
fin>>vm[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(vn[i]==vm[j]){
poz++;
sol[poz]=vn[i];
}
fout<<poz<<"\n";
for(int i=1;i<=poz;i++)
fout<<sol[i]<<" ";
}
