Question

I need help with the following homework :

1. Write a program that accepts an integer input from the user and display the least number of combinations of 200s, 100s, 50s, 20s, 10s, 5s, and 1s.

[Test your solution using this samples]

1. Input: 250

Output: 1x200s, 1x50s

2. Input: 1127

Output: 5x200s, 1x100s, 1x20s, 1x5s, 2x1s

3. Input: 1127

Output: 5x200s, 1x100s, 1x20s, 1x5s, 2x1s

4. Input: 19

Output: 1x10s, 1x5s, 4x1s

[Hints]

• Use division to determine the number of occurrence of each element (i.e. 200, 100) in the input (e.g. Given 500 if we divide it by the largest number possible; which is 200; we will get 2. Therefore, there are 2x200s.)
• Use subtraction to determine the remaining value of the input. (e.g. In the 500 example, since there are 2x200s, we still have 100 to process. The 100 came from 500 – (2*200) = 100.)
• Use the next largest number possible (i.e. 100) to check the number of occurrence. Continue until the remaining value of the input is zero.

2. On the second page, draft a flowchart representation of your solution. Use your listed Technical Work Items as your guide.

3. On the last page of your solution, write a translation of your flowcharts to pseudocodes.

Answer 1

import java.util.*;
public class Number {
public static void main(String [] args){
   Scanner scan=new Scanner(System.in);
   int num= scan.nextInt();
   if(num/200!=0)
   {
       System.out.print(num/200+"x200s, ");
       num=num-((num/200)*200);
   }
   if(num/100!=0)
   {
       System.out.print(num/100+"x100s, ");
       num=num-((num/100)*100);
   }
   if(num/50!=0)
   {
       System.out.print(num/50+"x50s, ");
       num=num-((num/50)*50);
   }
   if(num/20!=0)
   {
       System.out.print(num/20+"x20s, ");
       num=num-((num/20)*20);
   }
   if(num/10!=0)
   {
       System.out.print(num/10+"x10s, ");
       num=num-((num/10)*10);
   }
   if(num/5!=0)
   {
       System.out.print(num/5+"x5s, ");
       num=num-((num/5)*5);
   }
   if(num!=0)
   {
       System.out.println(num+"x1s");
   }   
}
}