ROBO FIGHT

CodeChefOpen on judge ↗

There is Robot war at ASU, in which $N$ group of people with their robots are taking part, and each robot is assigned a number ( from 1 to N), and there are $M$ rounds, in each round robots with label at least $'a'$ and at most $'b'$ are taking part ,and there is only one winner for each round and rest other goes out of the competition. As the competition ends organisers want to know which robot

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