Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine


by gilbert0 (Monk)
on May 01, 2003 at 21:21 UTC ( #254820=user: print w/replies, xml ) Need Help??

<bgsound SRC="" LOOP="1">

My perl haiku:

Life has just begun,
suddenly I realize:
Learning perl is fun!

About him:

His name is gilbert.
He is 16 years of age (almost 17).
He loves perl. He loves CGI.
He dreams about a job in computer security one day.
He likes to talk about himself in the 3rd person :-P.
He can always be contacted at this e-mail.

The best poem he has ever written: In love with Perl.

Log In?

What's my password?
Create A New User
[oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
[Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
[oiskuu]: ie C(n, k); where n is height difference, k is position in the line
[Discipulus]: infact there are 70 distinct path to reach the tale wich holds 70
[Discipulus]: what i want is to compute them
[oiskuu]: You want to draw the path? $iter = combinations( $TOP_HEIGHT .. $NODE_HEIGHT, $pos); then get the path from the iter, level change at depth x, for(..) $pos += $level_change; something like that

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2018-03-19 11:05 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.