Myujth

I know my question is repeated but I still couldn't understand what the other answers are explaining. Below is my code and I have calculated it to get to the first line which is 57 pennies + 0 dimes + 0 nickels + 0 quarters and I am thinking to run a loop that will list all the possible combinations of pennies, dimes, nickels, quarters. But, I don't know how.

public class Conversion
 public static void main(String args) 
 int cents = 57;

 int quarter = 25;
 int dime = 10;
 int nickel = 5;
 int penny = 1;


 int totalPennies = cents / penny;
 cents %= penny;
 int totalNickels = cents / nickel;
 cents %= nickel;
 int totalDimes = cents / dime;
 cents %= dime;
 int totalQuarters = cents / quarter;
 cents %= quarter;


 System.out.print(totalPennies + " pennies + ");
 System.out.print(totalNickels + " nickels + ");
 System.out.print(totalDimes + " dimes + ");
 System.out.println(totalQuarters + " quarters");

 

Your order of operations is backwards.

The first thing you do is count how many pennies you have. Since pennies are literally valued at 1, you can have 57 pennies and make up $0.57 just fine. That is obviously not what you want to accomplish.

What you want to do is count from your highest denomination and work your way backwards. Here's a sample.

// This should be the first operation
int totalQuarters = cents / quarter;
cents %= quarter;

I leave reordering the rest as an exercise for the reader, but the output then becomes correct once successfully reordered.

2 pennies + 1 nickels + 0 dimes + 2 quarters