← All problemsSign in

Jon and Rock-Paper-Scissor

Jon and his friend are playing Rock, Paper and Scissors. It is known that they played $N$ rounds in which Geek played $R1$ times rock, $P1$ time paper and $S1$ times scissors and his friend played $R2$ times rock, $P2$ time paper and $S2$ times scissors. In each round, his friend plays first. Given $N, R1, P1, S1, R2, P2$ and $S2$, find out if Jon can win the game if he plays optimally. To win h

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

Sign in to chat with the tutor and save your progress.

Sign in to start