Pagini recente » Cod sursa (job #1554005) | Cod sursa (job #766589) | Statistici Turian Tudor (tudor.turian) | Cod sursa (job #1289524) | Cod sursa (job #2465728)
#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] << " ";
}