Scribd
Upload
18 views3 pages

File 1

Uploaded by

A Karthik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
18 views3 pages

File 1

Uploaded by

A Karthik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

Consider a currency system in which there are notes of seven denominations, namely,

Rs. 1,
Rs. 2, Rs. 5, Rs. 10, Rs. 50, Rs. 100. If the change given to Pranav Rs.�N�is
input, write a
program to compute�smallest number of notes that will combine to give Rs.�N.

Note:
Refer to problem specifications.

Input Format:
First line of the input is an integer N, the change to be given to Pranav.
�
Output Format:
Output should display the the smallest number of notes that will combine to give�N.
Refer sample input and output for formatting specifications.

Sample Input 1:
1200

Sample Output1:
12

Sample Input 2:
242

Sample Output2:
7

import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int count = 0;

while( num >= 100)


{
num -= 100;
count++;
}
while( num >= 50)
{
num -= 50;
count++;
}
while( num >= 10)
{
num -= 10;
count++;
}
while( num >= 5)
{
num -= 5;
count++;
}
while( num >= 2)
{
num -= 2;
count++;
}
while( num >= 1)
{
num -= 1;
count++;
}
System.out.println(count);
}
}

You might also like