← All problemsSign in

Lockdown Game-4

Alice and Bob are playing a game. They have an integer $N$. Alice has $l$ distinct intgers and Bob has $m$ distinct integers each of which is between $1$ to $N-1$ (both inclusive). The Game starts with a starting integer $X$. In each turn each player can pick any number from his set of distinct integers and add it to $X$. If $X$ becomes greater than $N$, $X$ is assigned the value $X-N$ i.e The int

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