STARK BLOOD

CodeChefOpen on judge ↗

Little *Morgan* and *Happy Hogan* are playing a game. They pick up a group of numbers and find the Maximum **XOR** Sum of two numbers in that group. They keep on adding this **XOR** sum and the player with highest total wins the game. They decide who goes first by tossing a coin, and then proceed by consecutive turns. I.e, if *Morgan* starts the game, next turn is of *Happy*, then again *Morgan*

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