Find minimum number of coins that make a given value: Difference between revisions
Find minimum number of coins that make a given value (view source)
Revision as of 08:30, 9 August 2021
, 2 years agoAdded Wren
m (moved REXX entry) |
(Added Wren) |
||
Line 238:
1*1
done...
</pre>
=={{header|Wren}}==
{{libheader|Wren-fmt}}
As there is, apparently, an unlimited supply of coins of each denomination, it follows that any amount can be made up.
<lang ecmascript>import "/fmt" for Fmt
var denoms = [200, 100, 50, 20, 10, 5, 2, 1]
var coins = 0
var amount = 988
var remaining = 988
System.print("The minimum number of coins needed to make a value of %(amount) is as follows:")
for (denom in denoms) {
var n = (remaining / denom).floor
if (n > 0) {
coins = coins + n
Fmt.print(" $3d x $d", denom, n)
remaining = remaining % denom
if (remaining == 0) break
}
}
System.print("\nA total of %(coins) coins in all.")</lang>
{{out}}
<pre>
The minimum number of coins needed to make a value of 988 is as follows:
200 x 4
100 x 1
50 x 1
20 x 1
10 x 1
5 x 1
2 x 1
1 x 1
A total of 11 coins in all.
</pre>
| |||