war

CodeChefOpen on judge ↗

Finally, Voldemort called out Harry Potter for a war, so Harry has decided to create his team. He called all the dragons from city A and city B, $n$ dragons from each city. A total of 2⋅$n$ dragons have come to the room, and Harry lined up them into two rows, $A$ and $B$. Where row $A$ have $n$ dragons from city $A$ and row $B$ have $n$ dragons from city $B$. The dragons are numbered from 1 to

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