Counting ones

#include <iostream>
#include <vector>
#include <cstdint>
#include <utility>
#include <algorithm>

int main() {
    int n;
    std::cin >> n;
             
    std::vector<uint64_t> values(n);
    for (auto &v : values) {
        std::cin >> v;
    }

    std::pair<uint64_t, uint64_t> best_pair;
    int most_ones = 0;
    for (auto &v1 : values) {
        for (auto &v2 : values) {
            auto prod = v1*v2;
            if (__builtin_popcount(prod) > most_ones) {
                most_ones = __builtin_popcount(prod);
                best_pair = {v1, v2};
            }
        }
    }

    std::cout << most_ones << "\n" << best_pair.first << " " << best_pair.second << std::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