Counting ones

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> numbers(n);
    for (int i = 0; i < n; i++)
    {
        cin >> numbers[i];
    }

    int maxOnes = 0;
    int a = -1;
    int b = -1;
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            int count = __builtin_popcount(numbers[i] * numbers[j]);
            if (count > maxOnes)
            {
                maxOnes = count;
                a = numbers[i];
                b = numbers[j];
            }
        }
    }
    cout << maxOnes << endl << a << " " << b << 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