Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re: asterisk pattern

by choroba (Bishop)
on Oct 27, 2011 at 11:06 UTC ( #934110=note: print w/replies, xml ) Need Help??

in reply to asterisk pattern

say' 'x(3-$_),'*'x$_ for 1..3,2,1

Replies are listed 'Best First'.
Re^2: asterisk pattern
by Monk_perl on Oct 27, 2011 at 11:08 UTC
    I think this code is in perl
      I think this site is about Perl! I do not see anything about C in your spec here...
      I think this code is in perl

      No problem. If you don't mind falling ill, try MUMPS:

      F I=1,2,3,2,1 W $E("  ***",I,I+2),!


      Today I will gladly share my knowledge and experience, for there are no sweeter words than "I told you so". ;-)

Log In?

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

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

    Results (239 votes). Check out past polls.