Cod sursa(job #2465728)
| Utilizator | Data | 30 septembrie 2019 19:03:11 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int frecv[257], sir[1025];
int main(){
int j=1, max = 0, m, n, numere, c;
cin >> m >> n;
numere = m + n;
for(int i = 1; i <= numere; ++i){
cin >> c;
frecv[c]++;
}
for(int i = 1; i <= numere; ++i){
if(frecv[i] > 1){
max++;
sir[j] = i;
j++;
}
}
j -= 1;
cout << max << "\n";
for(int i = 1; i <=j; ++i)
cout << sir[i] << " ";
}
