[Solution] A Bit Easy solution codechef

A Bit Easy solution codechef – Chef was impressed by an array $A$ of $N$ non-negative integers. But, he was asked to solve the following problem in order to get this array.

[Solution] A Bit Easy solution codechef

Given a non-negative integer $k$ , find the number of pairs $(i, j)$ $(1 \leq i < j \leq N)$ such that the following condition holds true:
$(A_{i}$ $|$ $A_{j})$ $+$ $(A_{i} \oplus A_{j})$ $+$ $(A_{i}$ $&$ $A_{j})$ $= k$ $+ A_{j}$ , where

$(A_{i} | A_{j})$ denotes Bitwise OR operation,
$(A_{i}$ $\oplus$ $A_{j})$ denotes Bitwise XOR operation,
$(A_{i}$ $&$ $A_{j})$ denotes Bitwise AND operation.

You, being Chef’s friend, help him get this array by solving the above problem.

Input Format

The first line contains an integer $T$ , the number of test cases.
The first line of each test case contains two space-separated integers $N$ and $k$ , the number of integers in the array $A$ and the non-negative integer $k$ respectively.
The next line contains $N$ space-separated non-negative integers $A_{1}, A_{2}, \dots, A_{N}$ , the elements of the array $A$ .

Output Format

For each test case, print a single line containing the number of pairs satisfying the mentioned condition.