Sacred Games

CodeChefOpen on judge ↗

Trivedi is an evil man and he wants to destroy Mumbai.Gaitonde, on the other hand, wants to save Mumbai.For this purpose both are ready with their teams. The number of encounters will be in a triplet.Trivedi's team be A=(A[0],A[1],A[2]) and Gaitonde's team be B=(B[0],B[1],B[2]). Your task is to find out the winner of each encounter by comparing A[0] with B[0],A[1] with B[1] and A[2] with B[2].

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