Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: beware of Geeks bearing gifts

by zentara (Archbishop)
on Jun 20, 2012 at 21:04 UTC ( #977471=note: print w/replies, xml ) Need Help??

in reply to beware of Geeks bearing gifts

Ooops, that Anonymous Monk is me. :-)

I'm not really a human, but I play one on earth.
Old Perl Programmer Haiku ................... flash japh

Replies are listed 'Best First'.
Re^2: beware of Geeks bearing gifts
by choroba (Bishop) on Jun 20, 2012 at 21:24 UTC
    Then my ++ does not go to you, but to your "me" ;-)

        timeo danaos dona ferentes protect your bakcdoor cave canem ora fetentes let your data indoor
        there are no rules, there are no thumbs..

        Plus I think you're short a syllable in the middle line-- I count 5/6/5 and it should be 5/7/5. You could add a one syllable adjective before the USB...

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://977471]
[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.