Toggle Lights
CodeChefOpen on judge ↗
$N$ people are standing in a line outside a dark tunnel. The tunnel has $2N$ light bulbs, numbered from $1$ to $2N$, all initially turned OFF. Each person enters the tunnel, one by one, and toggles the state of the some light bulbs. Specifically, the $i^{th}$ person toggles the state of all lights numbered $2ik$ such that $1 \leq 2ik \leq 2N$, where $k$ is any integer that satisfies the inequality
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