THE JUMPING MARIO

CodeChefOpen on judge ↗

The journey of Mario begins from stage1. In stage 1, Mario is blessed with initial strength of $K$ . There are $N$ pillars in a given order. Height of each pillar is denoted as $hi$ . It requires $hi$ strength while jumping a pillar $hi$. After jumping each pillar Mario strength becomes two times his remaining strength. Help Mario find out no. of pillars he can jump before he starts his journey.

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