Counting ones

#include <bits/stdc++.h>

using namespace std;

//Definitions for quicker writing
#define REP(i,a,b) for (int i = a; i < b; i++)
#define clz __builtin_clz
#define ctz __builtin_ctz
#define popct __builtin_popcount
#define popctll __builtin_popcountll
#define PB push_back
#define MP make_pair
#define F first
#define S second

//Typedefs for quicker writing
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int,int> pi;
typedef pair<long long, long long> pl;

//Max values
const long long lmx = LLONG_MAX;
const int imx = INT_MAX;

int main() {
	//IO optimization
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	//Input definition
	int n;

	//Read In
	cin >> n;

	ll val[n];
	REP(i,0,n) cin >> val[i];

	//Main part
	pi maxid;
	ll max1s = 0;

	ll curprod;
	ll curcount;
	REP(i,0,n-1){
		REP(j,i+1,n){
			curprod = val[i]*val[j];
			curcount = popctll(curprod);
			if(curcount > max1s){
				max1s = curcount;
				maxid.F = val[i];
				maxid.S = val[j];
			}
		}
	}

	//Write out
	cout << max1s << "\n";
	cout << maxid.F << " " << maxid.S << "\n";
		
	//Return
	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