From: Kev Jackson <foamdino@...>
Date: 2006-08-11T18:26:49+09:00
Subject: Re: Codegolf - Pascals Triangle


On 11 Aug 2006, at 15:58, benjohn@fysh.org wrote:

>> My take on the latest problem from http://www.codegolf.com
>>
>> a=[]
>> 34.times{k=0;puts (a.map!{|i|k+k=i}<<1).join(" ")}
>
> :) That's very impressive - I like the way you've implemented the  
> filter
> like box kernel (summing adjacent array entries) - I wouldn't have
> imagined the k=i would bind tighter than the k+k.

how about

a=[]
34.times{k=0;p (a.map!{|i|k+k=i}<<1).join(" ")}

I *never* use puts, and in this case using p saves you 3 characters -  
yay for micro-tuning :)

Kev

--
"That government is best which governs not at all" - Henry Thoreau