MCL PHASE 1 CHALLENGE 305

CodeChefOpen on judge ↗

You have to do a transaction of R rupees, and you have o number of one rupee coins, f number of 5 rupee coins, e number of ten-rupee notes, i number of fifty rupee notes, h number of hundred rupee notes, v number of 500 rupee notes, and w number of 2000 rupee notes. You want to find the minimum number of notes/coins needed to do this transaction. ###Input: First line contains an integer T

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