Given a set of n numbers. The task is to count all the subsets of the given set which only have even numbers and all are distinct.
Note: By the property of sets, if two subsets have the same set of elements then they are considered as one. For example: [2, 4, 8] and [4, 2, 8] are considered to be the same.
First line consists of T test cases. First line of every test case consists of N, denotes the element in an array. Second line consists of elements in Array.
Print the Count of possible subsets.
1<=Ai<=1000 (All numbers that fit in 64-bit)
4 2 1 9 2 6 5 3
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.