VisitingTemple

CodeChefOpen on judge ↗

Problem Statement: There is a famous Buddhist monastery on the top of a mountain. There are N stairs from ground to reach the monastery. it’s a very tuff trail for the pilgrims so there is another way to reach the monastery is by lift. A group of pilgrims wishes to visit the monastery. Each time a pilgrim can either climb 1 or M no. of steps. Every pilgrims wants to climb those stairs in unique 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