XP is just a number PerlMonks

### Re^2: Lots of votes with nowhere to go :-)

by space_monk (Chaplain)
 on May 07, 2013 at 11:31 UTC ( #1032466=note: print w/replies, xml ) Need Help??

in reply to Re: Lots of votes with nowhere to go :-)

That's very good of you so I've upvoted yours :-)
If you spot any bugs in my solutions, it's because I've deliberately left them in as an exercise for the reader! :-)
• Comment on Re^2: Lots of votes with nowhere to go :-)

Create A New User
Node Status?
node history
Node Type: note [id://1032466]
help
Chatterbox?
 [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, tags... [\$top_height .. \$node_height] [Eily]: Discipulus by demonstrate I suppose you mean simulate with perl? [Eily]: the demonstration itself is fairly easy. The number of paths on a node is the sum of the numbers of paths to the two nodes above (or one node above on the edges of the triangle) [Eily]: since the value of a node is also the sum from the two nodes above, you just have to demonstrate that the equality is true at the top of the triangle [Discipulus]: yes Eily, thanks oiskuu but i dont get it.. ;=( maybe I'll ask a SOPW [LanX]: all combinations with same amount of left and right? [Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n

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

Results (239 votes). Check out past polls.

Notices?