SMALLEST NUMBER OF NOTES (FLOW005): Codechef solution in C++
SMALLEST NUMBER OF NOTES Problem Code: FLOW005 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 computer smallest number of notes that will combine to give Rs. N . Input Format The first line contains an integer T , total number of testcases. Then follow T lines, each line contains an integer N . Output Format For each test case, display the smallest number of notes that will combine to give N , in a new line. Constraints 1 ≤ T ≤ 1000 1 ≤ N ≤ 1000000 Sample Input 1 3 1200 500 242 Sample Output 1 12 5 7 Explanation Test Case 1 1 : There are 8 8 games remaining. Out of these 8 8 games, if RCB wins 2 2 games, loses 4 4 games and draws the remaining 2 2 games they will have a total of 10 points, this shows that it is possible for RCB to qualify for the playoffs. Note: There can be many other combinations which will lead to