ENGXOR Logic

[everule1]

Your solution is O(nq) which will most definitely TLE. The runtime error is because A_i<10^8 where as you have only precomputed for A_i<131072.
To solve it in O(n+q) refer to

ENGXOR - Editorial

PROBLEM LINK: Practice Div-2 Contest Author: Saurabh Yadav Tester: Suchan Park Editorialist: William Lin DIFFICULTY: Simple PREREQUISITES: Bits, Basic Math PROBLEM: You are given an array A and you need to answer Q independent queries. For each query, you are given an integer P. You need to first output the number of i such that A_i \oplus P has an even number of set bits in its binary representation and then output the number of i such that A_i \oplus P has an odd number of set bits in i…