Missing Ball

CodeChefOpen on judge ↗

Every armed force have some kind of rank system, let say Indian Armed Forces System consist of **n ranks** that are range from **`1 to n`**, where **1** is the lowest rank and **n** is the highest rank. One needs exactly **`y(i)`** years to rise from rank **`i`** to rank **`i + 1`**. Reaching a certain rank `i` having not reached all the previous **`i - 1`** ranks is impossible. **`Neeraj`** has

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