Counting ones

#include <iostream>
#include <vector>
#include <bitset>

using namespace std;

typedef long long ll;
typedef vector<long long> vll; 

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

  cin >> n;

  vll a(n);

  for(auto& x : a) cin >> x;

  ll max =-1, n1 = 0, n2 = 0;

  for(int i = 0; i < n; i++){
    for(int j = i+1; j < n; j++){
      ll ones = __builtin_popcountll(a[i] * a[j]);
      if(ones > max){
        max = ones;
        n1 = a[i];
        n2 = a[j];
      }
    }
  }
  cout << max << "\n";
  cout << n1 << " " << n2 << "\n";
}

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