Counting ones

#include <iostream>
#include <vector>
using namespace std;

int countOnes(int num) {
    int count = 0;
    while (num > 0) {
        count += (num & 1);
        num >>= 1; 
    }
    return count;
}

int main() {
    int n;
    cin >> n;
    vector<int> arr(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }

    int maxOnes = 0;
    int a_i = 0, a_j = 0;

    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            long long product = (long long)arr[i] * arr[j];
            int onesCount = countOnes(product);
            
            if (onesCount > maxOnes) {
                maxOnes = onesCount;
                a_i = arr[i];
                a_j = arr[j];
            }
        }
    }

    cout << maxOnes << endl;
    cout << a_i << " " << a_j << endl;

    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