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

Re: Re: Binomial Golf

by chipmunk (Parson)
on May 30, 2001 at 18:19 UTC ( #84264=note: print w/ replies, xml ) Need Help??


in reply to Re: Binomial Golf
in thread Binomial Golf

My best was 59 characters:

sub p { map{$_[$_]+=$_[$_+1]for 0..$#_;@_=(1,@_);print"@_\n"}1..pop }
However, I can reduce japhy's solution from 56 to 45 characters:
sub p { @_=(1,map$_[-2]+pop,@_),print"@_\n"for 1..pop }
BTW, I find it amusing that monks are giving their golf subroutines one-letter names, when the subroutine name isn't counted in the length of the solution. :)

I was considering sub pascal's_triangle {} for this one. ;)


Comment on Re: Re: Binomial Golf
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://84264]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (8)
As of 2015-07-08 02:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (93 votes), past polls