Counting ones

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

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<ll> numbers(n);
    for (auto& a : numbers) cin >> a;

    int bestCount = -1;
    ll bestA = 0, bestB = 0;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int count = __builtin_popcountll(numbers[i] * numbers[j]);
            if (count > bestCount) {
                bestCount = count;
                bestA = numbers[i]; bestB = numbers[j];
            }
        }
    }

    cout << bestCount << '\n';
    cout << bestA << ' ' << bestB << 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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED