Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Y2038 on PerlMonks

by Limbic~Region (Chancellor)
on Jun 05, 2012 at 13:54 UTC ( #974472=note: print w/replies, xml ) Need Help??

in reply to Y2038 on PerlMonks

There are a number of "easter eggs" about NodeReaper. The year plays into one of them - see if you can figure it out (it has nothing to do with 2038).

Cheers - L~R

Replies are listed 'Best First'.
Re^2: Y2038 on PerlMonks
by yitzchak (Sexton) on Jun 10, 2012 at 08:20 UTC
    It could perhaps be updated now.

Log In?

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