Counting ones

#include <iostream>
#include <vector>
#include <utility>

int main() {
    int n;
    std::cin >> n;
    std::vector<int> arr(n);

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

    int maxBits = 0;
    std::pair<int, int> bestPair;

    for (int i = 0; i < n - 1; ++i) {
        for (int j = i + 1; j < n; ++j) {
            long long product = static_cast<long long>(arr[i]) * arr[j];
            int bitCount = __builtin_popcountll(product); // Count 1 bits in product

            if (bitCount > maxBits) {
                maxBits = bitCount;
                bestPair = {arr[i], arr[j]};
            }
        }
    }

    std::cout << maxBits << "\n";
    std::cout << bestPair.first << " " << bestPair.second << "\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