Modify problem in Chapter so that the program stops when the remaining change becomes zero.
Problem
a. Develop a solution that would return the fewest coins in change from a purchase of under one dollar. (Include pennies, nickels, dimes, quarters, and half dollars.)
Example: | purchase | 63¢ |
| change | 37¢ |
| coins 1 | quarter |
|
| 1 dime |
|
| 2 pennies |
b. Develop a solution that would return the fewest bills and coins for a purchase under $50.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.