XOR-duction

CodeChefOpen on judge ↗

Mycroft and Sherlock are playing the game of XOR-duction. In this game Mycroft gives Sherlock an array $A$ of size $N$ , whose elements are denoted by $a_1$ , $a_2$ , . . . , $a_N$ Mycroft then asks Sherlock $Q$ queries: - For each query there are three numbers $-$ $l , r$ and $x$ and sherlock has to find the number of elements in A such that $a_i \ {\oplus} \ x$ $\textbf{is greater than}$ $x$

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI