Dear monasterians,
i've built a generator of integer partitions of n which gives you all the sets of nonzero integers that add up to exactly n.

the code (i'm terribly sorry about the names of the variables. and there are few bugs that you'll be able to see as you run it):

#!/usr/bin/perl -w
print 'enter n : ';
$kk = $n = $nn = readline(*STDIN);
my @ready = @aa = ();

while ($n) {$aa[$n] = 1;$n--;}
@bb = @aa;


while ($kk) {
$aa[$nn - $kk + 1] += $aa[$nn - $kk];
$aa[$nn - $kk]='';
    $ready[($nn - $kk)*3] = "@aa\n";
$aa[$kk - 1] += $aa[$kk];
$aa[$kk]='';
    $ready[($nn - $kk)*3 + 1] = "@aa\n";
$aa[$nn - $kk + 1] += $aa[$nn - $kk];
$aa[$nn - $kk]='';
    $ready[($nn - $kk)*3 + 2] = "@bb\n";
$bb[$kk - 1] += $bb[$kk];
$bb[$kk]='';
$kk--;}

print @ready;
[download]

so my "questions" is if there's a way to make a few improvments ?

---

---

• Are you posting in the right place? Check out Where do I post X? to know for sure.
• Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:

  <code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>

• Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
• Want more info? How to link or How to display code and escape characters are good places to start.