Cod sursa(job #1728388)
Utilizator | Data | 12 iulie 2016 20:17:59 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
int main(){
int a[1025],b[1025],n,m,x,k=0;
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++){
f>>x;
for(int j=1;j<=n;j++)
if(a[j]==x){
k++;
b[k]=x;
}
}
g<<k<<'\n';
for(int i=1;i<=k;i++)
g<<b[i]<<" ";
return 0;
}