Find the number of pairs (a,b) in given set of n integers such that (a&b)=0

[suman_18733097]

Count all ordered pairs with Bitwise And (&) equals to zero

Problem Statement- You have been given an integer array A on size N . You must report the number of ordered pairs (i,j) such that A[i] & A[j] is zero . Here ‘&’ denotes the BITWISE AND. (i,j) and (j,i) are considered different. **Input** First line contains **T** -Number of Test cases. First line of each test contains **N** . Next line contains N integers - the i'th integer **A[i]** . **Output** Output the number of such pairs for each test case. **Constraints** **T ≤ 10** **N ≤…

Awesome explanation by @sorb1997 . This should work, for smaller constraints. You might want to look into this entire topic to know new concepts.