In article <01a801c28_0c$5365d_80$[EMAIL PROTECTED]>,
Benoît Chauvet <[EMAIL PROTECTED]> writes:
> ....
>> The winner will be the one with the shortest solution on
>> "the other algorithm", where we will use this rule to distinguish the
>> two: if you do only a single sort when processing a line, we call it
>> algorithm one, if you do multiple sorts, we call it algorithm two.
>
> Isn't it a spoiler that the judges assume there are only 2 algorithms for
> this hole ? Even if they were given in the motivation, one might think
> there's another way (where is the TMTOWTDI spirit ?)
>
> Anyway, this hole is special, as it's the first time that the possible
> methods are given (which as a player I thank the heaven for)
>
That paragraph defines everything that does 1 sort as algorithm one,
and everything that does multiple sorts as algorithm two, exactly so
that "different" stuff will still be called either one or two. So no,
we don't actually assume there are only two methods, but we assign all
methods to one of two groups (ok, there could be solutions without ANY
use of "sort", but it probably does not surprise anyone that there are
currently no solutions that don't use sort)
