Question

How to count pairs from a given vector where the bitwise AND of the two numbers is greater than the bitwise XOR in C++

Answer 1

#include <iostream>
#include <vector>

int countPairs(const std::vector<int>& vec) {
    int count = 0;
    int size = vec.size();

    // Loop through every pair
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            if (i == j) continue;

            // Check the condition: AND > XOR
            if ((vec[i] & vec[j]) > (vec[i] ^ vec[j])) {
                std::cout << vec[i] << " " << vec[j] << "\n";
                count++;
            }
        }
    }

    return count;
}

int main() {
    std::vector<int> vec = {1, 2, 3, 4, 5, 6};  

    int result = countPairs(vec);

    std::cout << "Number of pairs where AND exceeds XOR: " << result << "\n";
}

 
 
/*
run:
 
2 3
3 2
4 5
4 6
5 4
5 6
6 4
6 5
Number of pairs where AND exceeds XOR: 8
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

#include <iostream>
#include <vector>

int countPairs(const std::vector<int>& vec) {
    int count = 0;
    int size = vec.size();

    // Loop through each unique pair (i < j)
    for (int i = 0; i < size; i++) {
        for (int j = i + 1; j < size; j++) {
            // Check the condition: AND > XOR
            if ((vec[i] & vec[j]) > (vec[i] ^ vec[j])) {
                printf("%d %d\n", vec[i], vec[j]);
                count++;
            }
        }
    }

    return count;
}

int main() {
    std::vector<int> vec = {1, 2, 3, 4, 5, 6};  

    int result = countPairs(vec);

    std::cout << "Number of pairs where AND exceeds XOR: " << result << "\n";
}

 
 
/*
run:
 
2 3
4 5
4 6
5 6
Number of pairs where AND exceeds XOR: 4
 
*/

 

70+ SQL courses for beginners and professionals