# [Solution] Minimum Coins solution codechef

Minimum Coins solution codechef – There are only 22 type of denominations in Chefland:

• Coins worth 11 rupee each
• Notes worth 1010 rupees each

## [Solution] Minimum Coins solution codechef

Chef wants to pay his friend exactly XX rupees. What is the minimum number of coins Chef needs to pay exactly XX rupees?

### Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases.
• Each test case consists of a single line of input containing a single integer XX.

### Output Format

For each test case, output on a new line the minimum number of coins Chef needs to pay exactly XX rupees.

### Constraints

• 1T10001≤T≤1000
• 1X10001≤X≤1000

## [Solution] Minimum Coins solution codechef

4
53
100
9
11


### Sample Output 1

3
0
9
1


## [Solution] Minimum Coins solution codechef

Test case 11: Chef can use 55 notes and 33 coins in the optimal case.

Test case 22: Chef can use 1010 notes and 00 coins in the optimal case.

Test case 33: Chef can only use 99 coins.

Test case 44: Chef can use 11 note and 11 coin in the optimal case.