Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Perl Monks User Search

( #6364=superdoc: print w/replies, xml ) Need Help??

This is where you can search for all the writeups contributed by any user. Just enter the user name and select the order for the search.

Author: Show nodes
Order by: starting at .
Node Type: Show Categorized Q&A (Why?)

Or try a Super Search

rodneytrotter has no writeups, it seems.
Log In?

What's my password?
Create A New User
[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
[oiskuu]: yergh, <code> tags... [$top_height .. $node_height]
[Eily]: Discipulus by demonstrate I suppose you mean simulate with perl?

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

    Results (239 votes). Check out past polls.