Counting ones

input/code.cpp: In function 'void solve()':
input/code.cpp:60:34: warning: 'maxa' may be used uninitialized [-Wmaybe-uninitialized]
   60 |     cout << max << "\n" << a[maxa] << " " << a[maxb];
      |                                  ^
input/code.cpp:48:17: note: 'maxa' was declared here
   48 |     ll max = 0, maxa, maxb;
      |                 ^~~~
input/code.cpp:60:52: warning: 'maxb' may be used uninitialized [-Wmaybe-uninitialized]
   60 |     cout << max << "\n" << a[maxa] << " " << a[maxb];
      |                                                    ^
input/code.cpp:48:23: note: 'maxb' was declared here
   48 |     ll max = 0, maxa, maxb;
      |                       ^~~~

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

// debug
template<class T> ostream& operator<<(ostream&, const vector<T>&);
template<class T> ostream& operator<<(ostream&, const set<T>&);
template<class T> ostream& operator<<(ostream&, const multiset<T>&);
template<class K, class V> ostream& operator<<(ostream&, const map<K, V>&);
template<class T, size_t N> ostream& operator<<(ostream&, const array<T, N>&);
template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<class T>
void print_collection(ostream& os, const T& v) {
    os << "{";
    bool first = true;
    for (const auto& x : v) {
        if (!first) os << ", ";
        first = false;
        os << x;
    }
    os << "}";
}
template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const set<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const multiset<T>& v) { print_collection(os, v); return os; }
template<class K, class V> ostream& operator<<(ostream& os, const map<K, V>& v) { print_collection(os, v); return os; }
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) { print_collection(os, v); return os; }
#define dbg(x) cerr << #x << " = " << (x) << '\n'

using ll = long long;
constexpr int INF = 1'000'000'000; // 1e9
constexpr ll LINF = 1'000'000'000'000'000'000LL; // 1e18
constexpr int MOD = 1'000'000'007; // 1e9 + 7

inline ll add(ll a, ll b) { return (a + b) % MOD; }
inline ll sub(ll a, ll b) { return ((a - b) % MOD + MOD) % MOD; }
inline ll mul(ll a, ll b) { return (a * b) % MOD; }


void solve() {
    int N;
    cin >> N;

    vector<ll> a(N);
    for(int i=0;i<N;++i) {
        cin >> a[i];
    }

    ll max = 0, maxa, maxb;
    for(int i = 0; i<N; i++) {
        for(int j = i+1; j<N;j++) {
            int m = __builtin_popcountll(a[i]*a[j]);
            if(m > max) {
                maxa=i;
                maxb=j;
                max = m;
            }
        }
    }

    cout << max << "\n" << a[maxa] << " " << a[maxb];
    
}

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

    solve();

    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