Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`LittleChildPaclet`
Coins  |
|
| | ||||
Details and Options
Examples
(2)
Basic Examples
(1)
The function Coins that takes a list called values of positive integers and a positive integer target. The function should return all lists of the number of coins to make the target with the fewest number of coins possible, all of whose denominations are in values. The function returns the list of ways in order.
In the following example, the fewest number of coins to make 35 is 4. There is only one such case:
In[1]:=
 | Coins |
Out[1]=
{{1,1,0,0,2}}
Verify these sum to 35:
In[2]:=
11+12+04+08+216
Out[2]=
35
Alternatively, verify with a dot product:
In[3]:=
 | Coins |
Out[3]=
{35}
Scope
(1)
 |
|
 |
|
|
""