Counts Zeros Xor Pairs (GFG)

 Given an array A[] of size N. Find the number of pairs (i, j) such that

A_i XOR A_j = 0, and 1 <= i < j <= N.

Input:
The first line of the input contains a single integer T denoting the number of test cases. The first line of each test case contains N. followed by N separate integers. 

Output:
For each test case, output a single integer i.e counts of Zeros Xors Pairs

Constraints
1 ≤ T ≤ 200
2 ≤ N ≤ 10^5
1 ≤ A[i] ≤ 10^5

Example:
Input :
2
5
1 3 4 1 4

3
2 2 2

Output :

2
3

Explanation :

Test Case 1: Index( 0, 3 ) and (2 , 4 ) are only pairs whose xors is zero so count is 2.


SOLUTION:

for i in range(int(input())):

    n=int(input())

    p=list(map(int,input().split()))

    p=sorted(p)

    count=0

    for i in range(0,n-1):

        for j in range(i+1,n):

            if p[i]==p[j]:

                count+=1

    print(count)       

Comments

Post a Comment

Popular posts from this blog

Sort in specific order (GFG)

  Given an array   A   of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order. Input: The first line of input contains an integer  T  denoting the number of test cases. Then  T  test cases follow. Each test case contains an integer  N  denoting the size of the array. The next line contains  N  space separated values of the array. Output: For each test case in a new line print the space separated values of the modified array. Constraints: 1 <= T <= 10 3 1 <= N <= 10 7 0 <= A i  <= 10 18 Example: Input: 2 7 1 2 3 5 4 7 10 7 0 4 5 3 7 2 1 Output: 7 5 3 1 2 4 10 7 5 3 1 0 2 4 Explanation: Testcase1:  Array elements 7 5 3 1 are odd and sorted in descending order, whereas 2 4 10 are even numbers and sorte...
Read more

Chef and Remissness Problem Code: REMISS (CodeChef)

Chef is now a corporate person. He has to attend office regularly. But chef does not want to go to office, rather he wants to stay home and discover different recipes and cook them. In the office where chef works, has two guards who count how many times a person enters into the office building. Though the duty of a guard is 24 hour in a day, but sometimes they fall asleep during their duty and could not track the entry of a person in the office building. But one better thing is that they never fall asleep at the same time. At least one of them remains awake and counts who enters into the office. Now boss of Chef wants to calculate how many times Chef has entered into the building. He asked to the guard and they give him two integers  A  and  B , count of first guard and second guard respectively. Help the boss to count the minimum and maximum number of times Chef could have entered into the office building. Input The first line of the input contains an integer  T ...
Read more

Short Notes Of computer Network

Image
  OSI Layers,data units and Functions: Layers Data Units Functions Application Layer Data Mail Services,Directory Serices,FTAM Presentation Layer Data Encryption/Decryption, Compression Session Layer Data Session Establishment, Synchronization,Dialog Controller Transport Layer Segments,Datagram Segementation Network Layer Packets Traffic control,Fragmentation,Routing Data Link Layer Frames Flow control,Error control,Access control Physical Layer Bits Bit Synchronization,Bit rate control,Physical Topologies Layers and their uses – Physical Layer Network Topologies: Mesh Topology: In mesh topology, every device is connected to another device via particular channel.If suppose, N number of devices are connected with each other, then total number of links required to connect NC 2 . Bus Topology: Bus topology is a network type in which every computer and network device is connected to single cable. If N devices are connected, then the number of cables required 1 which is known as backbon...
Read more