Counting ones

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <functional>
#include <utility>
using namespace std;

int main(){
    int n;
    cin >> n;

    vector<long long> v(n);

    for(int i = 0; i < n; ++i){
        cin >> v[i];
    }
    long long max = 0;
    pair<long,long> best_pair;
    for(int i = 0; i < n; ++i){
        for(int j = i+1; j < n; ++j){
            long long u_act =__builtin_popcount(v[i] * v[j]);
            if(u_act > max){
                best_pair = make_pair(i,j);
                max = u_act;
            }
        }
    }
    cout << max <<endl;
    cout << v[best_pair.first] << ' '<<v[best_pair.second]<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER