Given an array Arr of N integers. Write a program to find out number of pairs in array whose XOR is odd.
First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains a single integer N which denotes the size of array. Second line of each test case contains N space separated integers which denotes the elements of the array.
For each test case print the number of pairs in array whose XOR is odd.
1 2 3
1 2 3 4
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.