2. Write a function CHANGES(m) (in psudocode), which returns a minimal number of coins to get a total of m cents. Constraints: There are four types of coins with values 1, 5, 10, and 25, respectively. The total amount of money m is within 1-99 cents. Examples: o CHANGES(3) 3: it takes at least 3 coins (1 cent each) to get a total of 3 cents. o CHANGES(6) 2: it takes at least 2 coins (a 5-cent coin and 1-cent coin) to get a total of 6 o CHANGES(99) 9: it takes at least 9 coins (25 25 +25+ 10 10+1 1 + 1 1) to get a total of 99 cents.

2. Write a function CHANGES(m) (in psudocode), which returns a minimal number of coins to get a total of m cents. Constraints: There are four types of coins with values 1, 5, 10, and 25, respectively. The total amount of money m is within 1-99 cents. Examples: o CHANGES(3) 3: it takes at least 3 coins (1 cent each) to get a total of 3 cents. o CHANGES(6) 2: it takes at least 2 coins (a 5-cent coin and 1-cent coin) to get a total of 6 o CHANGES(99) 9: it takes at least 9 coins (25 25 +25+ 10 10+1 1 + 1 1) to get a total of 99 cents.



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *