Cod sursa(job #2644568)
| Utilizator | Data | 24 august 2020 22:21:10 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int main() {
int ar=1024,br=1024;
int a[ar],b[br];
int l=0,x,y;
cin>>x>>y;
for(int i=1;i<=x;i++){
cin>>a[i];
}
for(int i=1;i<=y;i++){
cin>>b[i];
}
queue<int>q;
for(int i=1;i<=x;i++){
for(int j=1;j<=y;j++){
if(a[i]==b[j]){
l++;
q.push(a[i]);
}
}
}
cout<<l<<"\n";
while(q.empty()!=true){
cout<<q.front()<<" ";
q.pop(q.front());
}
}
