Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re^2: poll ideas quest 2010

by Ratazong (Monsignor)
on Feb 16, 2010 at 10:28 UTC ( #823454=note: print w/replies, xml ) Need Help??

in reply to Re: poll ideas quest 2010
in thread poll ideas quest 2010

And another idea:

  • Why should I test? - I post my code to the monastery and let the other monks do all the debugging and validation ;-)
Rata ;-)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://823454]
[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
[Discipulus]: what i want is to compute them

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (10)
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.