Counting ones

#include <iostream>
#include <sstream>
#include <vector>

using namespace std;

int main(int argc, char const *argv[])
{
    int n, max = 0;
    string input;

    cin >> n;

    cin.ignore();

    long long numbers[n];

    getline(cin, input);

    istringstream stream(input);
    long long number;
    int index = 0;
    while (stream >> number && index < n)
    {
        numbers[index++] = number; // Assigner chaque nombre au tableau
    }

    
    std::vector<int> results;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            int x = __builtin_popcount(numbers[i] * numbers[j]);
            
            if (x > max)
            {
                results.clear();
                max = x;
            }

            if(x == max){
                results.push_back(numbers[i]);
                results.push_back(numbers[j]);
            }
        }
    }

    cout << max << endl;

    for (size_t i = 0; i < results.size(); i += 2) {
        if (i + 1 < results.size()) {
            cout << results[i] << " " << results[i + 1] << endl;
        } else {
            cout << results[i] << endl; 
        }
    }

    return 0;
}

/* std::cout << n << " ";
cout << numbers[17658]; */

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