Alice and Bob Cheat
CodeChefOpen on judge ↗
We have always seen Alice and Bob playing fairly. Little do we know they are serial cheaters. There are $N+1$ classrooms, numbered $0$ to $N$. Each classroom has a test. Classroom $i$ has a question paper of set $S_i$. Initially, Bob is in the $N^{th}$ classroom. You are allowed to put Alice in any classroom other than the $N^{th}$. Both Alice and Bob have a secret device to communicate during t
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.
Sign in to chat with the tutor and save your progress.
Sign in to start