The problem you are solving is a variation of the Subset Sum problem, and is known to be NP complete. There exist algorithms that are a little better than brute force, but still exponential in the number of elements.
Here is my take on the problem:
my @check = qw/ 1 2 3 4 5 6 7 8 9 /;
my $desired = 20;
foreach my $index (0..2**@check-1) {
my $sum = 0;
foreach my $pos (0..@check-1) {
my $bit = ($index >> $pos) % 2;
$sum += $bit * $check[$pos];
}
if ($sum == $desired) {
my @combo;
foreach my $pos (0..@check-1) {
push @combo, $check[$pos] if ($index >> $pos) % 2;
}
print join " ", @combo, "\n";
}
}
On a 32 bit machine, this works for up to 32 numbers.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
|
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.