From: Sander Land <sander.land@...>
Date: 2006-09-29T07:03:20+09:00
Subject: Re: [ANN] Code Golf Challenge : Oblongular Number Spirals

On 9/28/06, James Edward Gray II <james@grayproductions.net> wrote:
> On Sep 28, 2006, at 10:49 AM, James Edward Gray II wrote:
> One byte larger, but supporting the quiz interface:
>
> f=proc{|n,m,k,o|n*m==0?[]:(k>0?f[n-1,m-1,m-k-1,n+m-1+o].reverse<<n+k
> +o:[*o+1..n+o])}
> x,y=gets(" ").to_i,gets.to_i
> y.times{|i|puts f[x,y,i,0].map{|t|"%#{"#{x*y}".size}s"%t}*" "}
>
> (3 lines--first line was likely wrapped)
>
> James Edward Gray II

f=proc{|n,m,k,o|n*m<1?[]:k>0?f[n-1,m-=1,m-k,n+m+o].reverse<<n+k+o-1:[*o...n+o]}
x,y=gets(" ").to_i,gets.to_i
y.times{|i|puts f[x,y,i,1].map{|t|"%3s"%t}*" "}

Few bytes off the first line, but the largest gain is from the last line :)
And yes this works, although it needed 2 tries to pass.


Also, this was my 63 byte solution to the pi problem, in case anybody
is interested.
a=b=10**1000;4000.downto(1){|k|a=a*k/(2*k+1)+2*b};print"3.",a%b


btw: what's up with the ultra-small PHP solutions? pi in 34 bytes and
this one in 113? Is there some network/filesystem call going on there?