Programming (15 points)
In this question, we'll address the following problem: Can a cash register containing a given amount of pennies (1-cent coins) and a given amount of nickels (5-cent coins) give a customer a given exact amount of cents of change? For example, if there are 3 pennies and 5 nickels in the cash register, is it possible to give exactly 19 cents of change? (No.) If there are 2 pennies and 7 nickels in the register, is it possible to give exactly 26 cents of change? (Yes.)
Write a static method named canMakeChange that accepts three integer parameters representing the number of pennies in the cash register, the number of nickels in the cash register, and the desired amount of change to make. The method should return true if the coins in the register can produce this exact amount of change, and false if not. The coins in the register must be able to exactly produce the desired amount of change in order to return true; for example, if the register contains 0 pennies and 100 nickels, it is not able to exactly produce 8 cents of change.
The following are several sample calls to your method and the values they should return. You may assume that no negative parameter values are passed, but otherwise your method should work with any values passed.

Question

Quizplus · Accepted Answer

The Answer is (six solutions shown)
public static boolean canMakeChange(int pennies, int nickels, int cents) {
if (cents % 5 > pennies) {
return false;
} else if (pennies + 5 * nickels < cents) {
return false;
} else {
return true;
}
}
public static boolean canMakeChange(int pennies, int nickels, int cents) {
while (cents >= 5 && nickels > 0) {
cents -= 5;
nickels--;
}
while (cents > 0 && pennies > 0) {
cents--;
pennies--;
}
return cents == 0;
}
public static boolean canMakeChange(int pennies, int nickels, int cents) {
for (int p = 0; p <= pennies; p++) {
for (int n = 0; n <= nickels; n++) {
if (p + 5 * n == cents) {
return true;
}
}
}
return false;
}
public static boolean canMakeChange(int pennies, int nickels, int cents) {
if (nickels * 5 >= cents) {
return (pennies >= cents % 5); // enough nickels to cover all except % 5 part
} else {
return (pennies >= cents - nickels * 5); // not enough nickels; need pennies
}
}
public static boolean canMakeChange(int pennies, int nickels, int cents) {
cents -= Math.min(nickels * 5, cents - cents % 5);
return cents - pennies <= 0;
}
public static boolean canMakeChange(int pennies, int nickels, int cents) {
return (pennies >= cents % 5) && (pennies + 5 * nickels >= cents);
}

Programming (15 Points) in This Question, We'll Address the Following Problem: Can a Problem