Vedant and his Hidden Array solution codechef
Vedant has a hidden array of bitwise AND of all elements of the array, determine whether the total sum of the elements is odd, even or cannot be determined.elements. Given the
Input Format Vedant and his Hidden Array solution codechef
- The first line of each input contains – the number of test cases. The test cases then follow.
- The only line of each test case contains two space-separated integers and – the number of elements in the hidden array and the bitwise AND of all the elements in the hidden array.
For each test case, output
Even if the sum of all elements in the hidden array is even,
Odd if the sum of all elements in the hidden array is odd, or
Impossible if the parity cannot be determined.
Note: You may print each character of the string in uppercase or lowercase (for example, the strings
EVEN will all be treated as identical).
Constraints Vedant and his Hidden Array solution codechef
Sample Input 1
3 1 11 1 2 74120341 829182732
Sample Output 1 Vedant and his Hidden Array solution codechef
Odd Even Impossible