develooper Front page | | Postings from July 2002

Re: It's so simple ! It can't be that hard !

Thread Previous | Thread Next
Jasper McCrea
July 31, 2002 07:10
Re: It's so simple ! It can't be that hard !
Message ID:
Ton Hospel wrote:
> Another one that was done as a (very quick, only half a day) ircnet golf
> for you to try your teeth on.
> Won by mtve with a score of 85, but in the postmortem we are at 77.
> How well can the mailinglist do this as an open golf (post your attempts
> here)
> Only for people who haven't played it and haven't looked at the web page.
> Consider a 2x2 square where each position can be filled (represented by a O
> (that's not a zero)), or empty (represented by a .). You can then
> look how many elements are filled on each row and column, for example:

i got 131, so not really threatening the leaderboard.

sub p{$a[pop]+$a[pop]}sub

two subroutines! my only excuse is that i am doped up on codeine after
breaking both arms (so one was only chipped, sue me), and didn't spend
too long on it.

hmmm, just looked at leaderboard. not threatening anyone. drat.
Neil, is it really necessary to nail the plates to the table? What
when we want to play Monopoly? Go directly to plate? Do not pass plate 
nailed to the table by a stupid hippie? - Vyvyan

Thread Previous | Thread Next Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at | Group listing | About