Counting ones

#include <bits/stdc++.h>

using namespace std;

int main() {

    // ios_base::sync_with_stdio(0);

    int n;
    cin >> n;

    vector<long long> x(n);
    for (int k = 0; k < n; k++)
        cin >> x[k];
    
    int a = 0, b = 1;
    long long max = __builtin_popcount(x[a] * x[b]);

    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (__builtin_popcount(x[i] * x[j]) > max) {
                max = __builtin_popcount(x[i] * x[j]);
                a = i;
                b = j;
            }
        }
    }

    cout << max << "\n" << x[a] << " " << x[b] << "\n";
    return 0;

}

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