Maximum Xor Query
CodeChefOpen on judge ↗
Today, Flippy the bird came up with a simple problem. You have an array a of nonnegative integers. There are q queries that has to be answered. The i-th query is denoted by three positive integers, li, ri and xi. For each query, you should output the maximum possible value of xi xor aj, where l ≤ j ≤ r. You may learn about the xor operator here : https://en.wikipedia.org/wiki/Exclusive_or (see th
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.
Sign in to chat with the tutor and save your progress.
Sign in to start