Counting ones

#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit); // RTE if input wrong datatype

    int n;
    cin >> n;

    vi a(n);
    rep(i, 0, n) cin >> a[i];

    int ans = 0, x1 = -1, x2 = -1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int b = __builtin_popcount(a[i] * a[j]);
            if (b > ans) {
                ans = b;
                x1 = a[i];
                x2 = a[j];
            }
        }
    }

    cout << ans << '\n';
    cout << x1 << ' ' << x2 << '\n';
}

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