develooper Front page | perl.fwp | Postings from December 2001

Re: The Santa Claus Golf Apocalypse

Thread Previous | Thread Next
From:
Yanick
Date:
December 3, 2001 14:15
Subject:
Re: The Santa Claus Golf Apocalypse
Message ID:
20011203171717.A6154@gilgamesh.sympatico.ca
On Mon, Dec 03, 2001 at 12:59:05PM -0800, Brad Greenlee wrote:
> Here's a question of fair play: does each program have to work for any given
> text file, or is it ok if it just works on the test cases presented by
> tsanta? I can shorten my mid.pl by one stroke, and it still passes all the
> tests, but it will eventually fail when the file reaches a certain size.

	I did the same. The rule says that if it passes tsanta.pl,
it's okay. However, I have to admit that it's crass cheating, and
would accept any decision of not allowing this particular trick.

	(one solution would be to modify tsanta.pl with a 
text file of, say, 42 lines, which would break our scheme)

Joy,
`/anick

-- 
($_,@.)=split m<[\d=[\]]>,"Y..0e0t0 =a0n0o0t0h0e0r= [P0e0r0l] "
 .  "0h0a0c0k0e0r";          y|.    |.   |s  ;
for $0(1..23)  {  $_ .='.' x s|  (.)[.] $|$
                           +. shift@ .|ex|| '.'   } ;print;

Thread Previous | Thread Next


nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About