Minimum number of coins

CodeChefRating 711Open on judge ↗

Chef has infinite coins in denominations of rupees $5$ and rupees $10$. Find the **minimum** number of coins Chef needs, to pay **exactly** $X$ rupees. If it is impossible to pay $X$ rupees in denominations of rupees $5$ and $10$ only, print $-1$. ### Input - First line will contain $T$, number of test cases. Then the test cases follow. - Each test case contains of a single integer $X$. ### Out

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