Find minimum number of coins that make a given value: Difference between revisions
Content added Content deleted
(Realize in F#) |
|||
Line 244: | Line 244: | ||
</pre> |
</pre> |
||
=={{header|MiniZinc}}== |
|||
<lang MiniZinc> |
|||
%Find minimum number of coins that make a given value. Nigel Galloway, August 11th., 2021 |
|||
int: N=988; |
|||
array [1..8] of int: coinValue=[1,2,5,10,20,50,100,200]; |
|||
array [1..8] of var 0..N: take; constraint sum(n in 1..8)(take[n]*coinValue[n])=N; |
|||
solve minimize sum(n in 1..8)(take[n]); |
|||
output(["Take "++show(take[n])++" of "++show(coinValue[n])++"\n" | n in 1..8]) |
|||
</lang> |
|||
{{out}} |
|||
<pre> |
|||
Take 1 of 1 |
|||
Take 1 of 2 |
|||
Take 1 of 5 |
|||
Take 1 of 10 |
|||
Take 1 of 20 |
|||
Take 1 of 50 |
|||
Take 1 of 100 |
|||
Take 4 of 200 |
|||
---------- |
|||
========== |
|||
Finished in 196msec |
|||
</pre> |
|||
=={{header|Nim}}== |
=={{header|Nim}}== |
||
<lang Nim>import strformat |
<lang Nim>import strformat |