Tug of War

CodeChefOpen on judge ↗

St. Mark’s Sr. Sec Public School has $N$ students. Today they will be playing a game called Tug of War. Each student has initial confidence $A[i]$ to winning a fight. The tournament is organised as follows: Two students come forward and start the game “Tug of war”. Assume the confidence level of the students is $X$ and $Y$. The person who has higher confidence level wins the game (If both peop

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