Minimum Coins
There are only $2$ type of denominations in Chefland: - Coins worth $1$ rupee each - Notes worth $10$ rupees each Chef wants to pay his friend exactly $X$ rupees. What is the minimum number of **coins** Chef needs to pay exactly $X$ rupees? ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of a single line of inp
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.
Sign in to chat with the tutor and save your progress.
Sign in to start