Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Challenge: Number of unique ways to reach target sum

by tall_man (Parson)
on Sep 26, 2006 at 21:12 UTC ( #575024=note: print w/ replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #!/usr/bin/perl
    use strict;
    ...
    my $sum = sumover $triangle{$nmax,$kmax};
    print "Total unique partitions C(677,10) on {1..100} is ",$sum,"\n";
    
  2. or download this
    #!/usr/bin/perl
    use strict;
    ...
    print "Next to last one: ",join(q{ },@gennxt),"\n";
    my @genmid = generate($nmax,$kmax,int($sum/2));
    print "Middle one: ",join(q{ },@genmid),"\n";
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://575024]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (11)
As of 2014-11-21 19:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (114 votes), past polls