Codegolf: Pascal's Triangle


#1

Hi all!

I’ve been quite addicted to www.codegolf.com for a while and I’m trying
to skim down my Pascal’s Triangle program. The challenge description is
here: http://codegolf.com/pascals-triangle. I’m currently at 84 bytes,
but some awesome ruby coders have done it in 43 bytes! Take a look at
the code and let me know if there’s anything glaringly obvious I could
do the reduce character count. New lines have been added for
readability, there are no new lines in the true code.

def f(n)
n<1?1:n*f(n-1)
end;

34.times{|i|
puts((0…i).map{|j|f(i)/(f(j)f(i-j))}’ ')
}


#2

On 1/25/07, Drew O. removed_email_address@domain.invalid wrote:

There must be a solution with 42 characters, it’s a well known law :wink:


#3

On 1/25/07, Erik V. removed_email_address@domain.invalid wrote:

Ok if I cannot have 42 I will accept 42+42, why not?

Robert


#4

Not again… ;]

http://www.rubyquiz.com/quiz84.html
http://tinyurl.com/2dlua4

gegroet,
Erik V. - http://www.erikveen.dds.nl/