[Solution] Good Pairs CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Good Pairs CodeChef Solution | CodeChef Problem Solution 2022

Chef has two arrays A$A$ and B$B$, each of length N$N$.

A pair (i,j)$(i,j)$ (1≤i<j≤N)$(1\le i<j\le N)$ is said to be a good pair if and only if

Ai⊕Aj=Bi⊕Bj$$A_i\oplus A_j=B_i\oplus B_j$$

Here, ⊕$\oplus$ denotes the bitwise XOR operation.

Determine the number of good pairs.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases. The description of the test cases follows.

Solution Click Below:-  CLICK HERE

• Each test case consists of three lines of input:
  • The first line contains a single integer N$N$ — the size of the arrays A$A$ and B$B$.
  • The second line contains N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$ — the elements of array A$A$.
  • The third line contains N$N$ space-separated integers B1,B2,…,BN$B_1,B_2,\dots ,B_N$ — the elements of array B$B$.

Output Format

• For each test case, output on a new line the number of good pairs.

Doubt Support Availability CodeChef Solution

Whatsapp Messages CodeChef Solution

Good Pairs CodeChef Solution

Difficulty Rating Order CodeChef Solution

Take discount or Not CodeChef Solution

Infinity Staircase CodeChef Solution

Or Permutation CodeChef Solution

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 2≤N≤3⋅105$2\le N\le 3\cdot {10}^5$
• The sum of N$N$ over all test cases does not exceed 3⋅105$3\cdot {10}^5$
• 0≤Ai,Bi<2