Smallest Numbers of Notes Codechef Solution

Hello Programmers In this post, you will know how to solve the Smallest Numbers of Notes Codechef Solution.

Smallest Numbers of Notes Codechef Solution
Smallest Numbers of Notes Codechef Solution

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Codechef by yourself. If you find any difficulty after trying several times, then you can look for solutions.

Problem

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

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, display the smallest number of notes that will combine to give N, in a new line.

Constraints

  • 1 <= T <= 1000
  • 1 <= N <= 1000000

Example

Input:

3
1200
500
242

Output:

12
5
7

Smallest Numbers of Notes CodeChef Solutions in Python

T = int(input())
a = [100, 50, 10, 5, 2, 1]
for _ in range(T):
    n = int(input())
    b = 0
    for x in a:
        if (x <= n):
            b = b + (n // x )
            n = n % x
    print(b)        

Smallest Numbers of Notes CodeChef Solution in CPP

#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int T;
int N;
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &N);
    // Solve
    int sum = 0;
    std::vector<int> coins = { 100, 50, 10, 5, 2, 1 };
    for (auto c : coins) {
      sum += N / c;
      N = N % c;
    }
    // Print answer
    printf("%d\n", sum);
  }
  return 0;
}

Ezoicreport this adSmallest Numbers of Notes CodeChef Solutions in JAVA

import java.util.*;
class Note
{
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int t = s.nextInt();
        //int p=0,q=0;
        while(t>0)
        {
            t--;
            int n = s.nextInt();
            int rem=n%100;
            int count=n/100;
            count=count+(rem/50);
             rem=rem%50;
             count=count+(rem/10);
             rem=rem%10;
             count=count+(rem/5);
             rem=rem%5;
             count=count+(rem/2);
             rem=rem%2;
             count=count+(rem/1);
             rem=rem%1;
            System.out.println(count);
        }
}
}
Ezoicreport this ad

Disclaimer: The above Problem (Smallest Number of Notes) is generated by CodeChef but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purpose.

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.

Next: Paying up Codechef Solution

Sharing Is Caring

Leave a Comment

Ezoicreport this ad