Counting ones

#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()
#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	
	int n;
	cin >> n;
	vector<int> a(n);
    rep(i,0,n){
        cin >> a[i];
    }
    
    int total = 0;
    pair<int, int> sol;
    rep(i,0,n){
        rep(j,i+1,n){
            int x = a[i] * a[j];
            int temp = __builtin_popcountll(x);
            if (temp > total){
                total = temp;
                sol = {a[i], a[j]};
            }
        }
    }
    
    cout << total << '\n';
    cout << sol.first << " " << sol.second;
}

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