← All problemsSign in

Falling Domino

CodeChefRating 3296Open on judge ↗

Aditya is playing with $N$ dominoes, which are arranged in a circle. For each $i$ ($1 \leq i \lt N$), domino $i+1$ follows domino $i$; and domino $1$ follows domino $N$. More succinctly, the successor of domino $i$ is domino $(i\bmod N) + 1$. The $i$-th domino has a weight of $W_i$ and an absorption factor of $K_i$. A domino will fall if and only if it is pushed with a force of *at least* $W_

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