Digvijay vs Supriya

CodeChefOpen on judge ↗

Digvijay singh recently learned base conversion of numbers and he challenged Supriya to ask him any question related to base conversion. Supriya came up with a problem: Given a base K and a number M, Digvijay gets a string of numbers from Supriya which has all its element in the range [0,K-1]. Now Digvijay has to convert this string moving from left to right and output the result at every step 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