Don't ask to ask, just ask | |
PerlMonks |
Re: amount permutationsby Abigail-II (Bishop) |
on Mar 04, 2004 at 17:25 UTC ( [id://333939]=note: print w/replies, xml ) | Need Help?? |
That's a very hard problem. Even the question is there a subset that totals to the given amount is NP-complete,
and is known as the knapsack problem.
Abigail
In Section
Seekers of Perl Wisdom
|
|