A Bit Easy CodeChef Solution | CodeChef Problem Solution 2022

A Bit Easy CodeChef Solution | CodeChef Problem Solution 2022

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

Given a non-negative integer k$k$, find the number of pairs (i,j)$(i,j)$ (1≤i<j≤N)$(1\le i<j\le N)$ such that the following condition holds true:
(Ai$(A_i$ |$|$ Aj)$A_j)$ +$+$ (Ai⊕Aj)$(A_i\oplus A_j)$ +$+$ (Ai$(A_i$ &$\mathrm{\&}$ Aj)$A_j)$ =k$=k$ +Aj$+A_j$, where

• (Ai|Aj)$(A_i|A_j)$ denotes Bitwise OR operation,
• (Ai$(A_i$ ⊕$\oplus$ Aj)$A_j)$ denotes Bitwise XOR operation,
• (Ai$(A_i$ &$\mathrm{\&}$ Aj)$A_j)$ denotes Bitwise AND operation.

Solution Click Below:-  CLICK HERE

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

Input Format

• The first line contains an integer T$T$, the number of test cases.
• The first line of each test case contains two space-separated integers N$N$ and k$k$, the number of integers in the array A$A$ and the non-negative integer k$k$ respectively.

Get Subscription CodeChef Solution

Chef gives Party CodeChef Solution

Dominant Army CodeChef Solution

Circular Track CodeChef Solution

Good Pairs CodeChef Solution

Anti-knapsack CodeChef Solution

A Bit Easy CodeChef Solution

Average Gift CodeChef Solution

• The next line contains N$N$ space-separated non-negative integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$, the elements of the array A$A$.

Output Format

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

Constraints

• 1≤T≤200$1\le T\le 200$
• 1≤N≤105$1\le N\le {10}^5$
• 0≤k≤1018$0\le k\le {10}^{18}$
• 0≤Ai≤1018$0\le A_i\le {10}^{18}$
• Sum of N$N$ over all test cases does not exceed 3⋅105$3\cdot {10}^5$.

Join Now for Solution:-