Reach The Temple

CodeChefOpen on judge ↗

J.D. a travel freak guy in NIT goes to hills in Nepal. JD want to take exactly $k$ steps to reach to the top and in each step he climb $a$ or $b $ or $c$ height above his initial position. Given height of hill as $H$ and you have to find no of ways he can climb to the top of hill taking exactly $k$ steps. Finally output the answer modulo 10^9+7(1000000007). Read about modulo from here. modulo_arit

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