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


by toro (Beadle)
on Jun 09, 2011 at 18:13 UTC ( #908971=user: print w/replies, xml ) Need Help??

blog: ||

twitter: @isomorphisms

interests: mathematics, econometrics

I love this community! I wish there were an R monks in the same spirit.

How I make Perlmonks more readable:
.monktitlebar, .see-also { font-size: 80%; } table { font-family: Arial; } body { color: #111; }
Web-3.0 Vision: body { color: #333; }

Log In?

What's my password?
Create A New User
[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
[oiskuu]: yergh, <code> tags... [$top_height .. $node_height]

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.