SP17725 BADXOR - Bad XOR

**Bad XOR | BADXOR** **Time Limit: 1s** You are given an array A of N elements. Also you are given another array B of M elements. Any subset (i­ $ _{1} $ , i $ _{2} $ , i $ _{3} $ , …., i $ _{p} $ ) is bad IFF ( Ai $ _{1} $ ⊕ Ai $ _{2} $ ⊕ …. ⊕ Ai $ _{p} $ ) equals any value of B. ⊕ means Bitwise XOR, which can be found with ^ syntax in popular programming languages. Now your job is to find the number of good subsets. Empty Subset has XOR value of 0. **Input** The first line of input denotes the number of test cases T (1

N/A

N/A