On Tue, 9 Jul 2002, Chris Dolan wrote:
> My favorite solution was by Jukka Suomela at 97.47. [...]
>
> The principle behind this solution is that Perl already has a
> topological sorter for graphs built in: the garbage collector.
> [...]
En op 10 juli 2002 sprak Stephen Turner:
> That is truly brilliant. And all in under 100 characters.
> Do the judges still award discretionary prizes?
-alp
($_,my$y)=map{bless$x{$_}||=[$_]}@F;$_-$y&&push@$_,$y}DESTROY{$d?dump:print$
_[0][0]}{$d=%x=q
I'm stunned. In all the many golfs, that's the first time I've
seen 'bless' or 'DESTROY' or 'dump' used. Kudos to the man!
In Get Even game, we had a SUAP (supremely unorthodox artistic
prize), won by Keith. Jukka's unorthodoxy is supremely brilliant
IMHO and should be properly rewarded and acknowledged.
/-\
