Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

pen and paper

by bassplayer (Monsignor)
on Jun 12, 2004 at 15:22 UTC ( #363613=poem: print w/replies, xml ) Need Help??

perl begins to flow
while away from STDIN
analog code-fest


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: poem [id://363613]
Approved by Paulster2
Discipulus stopped with turkisk spices anyway.. but better hashes than arrays!
[oiskuu]: Discipulus, from the edge or from the top?
[Discipulus]: oiskuu from the top aka 0-0 coords
[LanX]: edge or node?
[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

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

    Results (239 votes). Check out past polls.