+ 6

You are given an array A1,A2...AN. You have to tell how many pairs (i, j) exist such that 1 ≤ i < j ≤ N and Ai XOR Aj is odd.

Input and Output  First line T, the number of testcases. Each testcase: first line N, followed by N integers in next line. For each testcase, print the required answer in one line. Constraints  1 ≤ T ≤ 10  1 ≤ N ≤ 105  0 ≤ Ai ≤ 109

29th Aug 2017, 10:11 AM
ⓢⓐⓝⓓⓔⓔⓟ
ⓢⓐⓝⓓⓔⓔⓟ - avatar
2 Respostas
+ 3
examples.... SAMPLE INPUT 2 3 1 2 3 4 1 2 3 4 SAMPLE OUTPUT  2 4 Explanation For first testcase: 1 XOR 2 is 3 and 2 XOR 3 is 1. So, 2 valid pairs. For second testcase: 1 XOR 2 is 3 and 2 XOR 3 is 1 and 1 XOR 4 is 5 and 3 XOR 4 is 7. So, 4 valid pairs.
30th Aug 2017, 2:57 PM
ⓢⓐⓝⓓⓔⓔⓟ
ⓢⓐⓝⓓⓔⓔⓟ - avatar
+ 2
Can you give an example please? I'm not sure if I understood well.
29th Aug 2017, 9:05 PM
Mehmet
Mehmet - avatar