Cod sursa(job #2169033)
Utilizator | Data | 14 martie 2018 13:12:18 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
int a[1024],b[1024],c[1024];
int main()
{
int i,j,n,t=0,m,k=0;
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]){
k++;
c[++t]=b[j];
}
}
fout<<k<<"\n";
for(i=1;i<=t;i++)
fout<<c[i]<<" ";
return 0;
}