Smallest Numbers of Notes

CodeChefRating 839Open on judge ↗

Consider a currency system in which there are notes of six denominations, namely, Rs. 1, Rs. 2, Rs. 5, Rs. 10, Rs. 50, Rs. 100. If the sum of Rs. N is input, write a program to compute smallest number of notes that will combine to give Rs. N. Input The first line contains an integer T, total number of testcases. Then follow T lines, each line contains an integer N. Output For each test case,

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