http://www.perlmonks.org?node_id=847289


in reply to Counting positive numbers

The shortest solution was six characters long, in what language?

Replies are listed 'Best First'.
Re^2: Counting positive numbers
by Young Monk (Novice) on Jul 03, 2010 at 16:56 UTC

      I don't believe it can be done "legitimately" in six strokes. Only by "cheating". I have no experience of spoj competitions, but it looks like solutions are accepted automatically by a robot referee (i.e. without a human checking each submitted solution for correctness). With this sort of automated judging, part of the game (lamentably IMHO) is finding a way to trick the robot into accepting an invalid solution. In the past, cheating has been common at codegolf sites with automated judging. For example:

      In your spoj game, one (bizarre) rule that may be exploitable is:

      Score equals to size of source code of your program except symbols with ASCII code <= 32.
      Why on earth would they make such an arbitrary rule? This is not true golf IMHO. It's also possible there are bugs in their robot referee or test program for this particular game (e.g. a poor or very small set of fixed test data) which may be exploited. But, to me, this sort of activity is not really golf anymore; it's more akin to finding exploits to hack into web sites.

        After a little googling, i found that those top scoring guys have actually exploiting the "<33 ASCII not counted as character" condition to get a very high(low, actually) score...!

        Take a look

        Im wondering, how can u compress a perl program into characters with ASCII <33 such tat the latter still works???

      I don't believe it!