Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

comment on

( #3333=superdoc: print w/replies, xml ) Need Help??
#!/usr/bin/perl use warnings; use strict; sub _summands { my ($target, @numbers) = @_; return [[]] if 0 == $target; my @results; for my $index (0 .. $#numbers) { my $number = $numbers[$index]; my @remaining = @numbers[ grep $_ != $index, 0 .. $#numbers ]; next if $target - $number < 0; my $result = _summands($target - $number, @remaining); push @results, map [$number, @$_], grep ! @$_ || $number <= $_->[0], @$result; } return \@results } sub summands { my $results = _summands(@_); my %unique; for my $result (@$results) { undef $unique{"@$result"}; } return [ map [split ' '], keys %unique ] } use Test::More tests => 2; use Test::Deep; cmp_deeply summands(100, 1, 99, 2, 40, 50, 60, 90, 3, 5, 95, 100), bag([100], [1, 99], [2, 3, 95], [5, 95], [2, 3, 5, 90], [2, 3, 5, +40, 50], [40, 60]); cmp_deeply summands(100, 5, 5, 5, 5, 10, 15, 80, 99), bag([5, 15, 80], [5, 5, 5, 5, 80], [5, 5, 10, 80]);

Update: Sorry, I'm kind of busy, so I don't have much time to explain it. It's a classical example of Dynamic Programming - the only complication is the numbers can be repeated, which I solved using the $unique hash. It's probably possible to build the solutions in a unique way right away in the recursive function, so there won't be any postprocessing needed.

Update 2: For a speed-up, add

use Memoize; memoize('_summands');
and, as found by haukex in Fastest way to "pick without replacement", replace
my $number = $numbers[$index]; my @remaining = @numbers[ grep $_ != $index, 0 .. $#numbers ];
by
my @remaining = @numbers; my ($number) = splice @remaining, $index, 1;

map{substr$_->[0],$_->[1]||0,1}[\*||{},3],[[]],[ref qr-1,-,-1],[{}],[sub{}^*ARGV,3]

In reply to Re: Find combination of numbers whose sum equals X by choroba
in thread Find combination of numbers whose sum equals X by harangzsolt33

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • 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, 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, 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:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others lurking in the Monastery: (3)
    As of 2021-01-22 03:03 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?
      Notices?