Counting ones

#include <iostream>
#include <vector>

using namespace std;

int bitCount(long long a){
    int count = 0;
    while (a > 0){
        count += (a & 1); // Mask
        a >>= 1;
    }

    return count;
}

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

    vector<long long> numbers(n);
    for (int i = 0; i < n; i++)
    {
        cin >> numbers[i];
    }
    
    int found_max = -1;
    long long val1 = -1;
    long long val2 = -1;

    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            long long result = numbers[i] * numbers[j];
            int ones = __builtin_popcountll(result);

            if (found_max < ones)
            {
                found_max = ones;
                val1 = numbers[i];
                val2 = numbers[j];
            }
            

        }
        
    }
    
    cout << found_max << "\n";
    cout << val1 << " " << val2 << "\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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED