OJ Board

For a given input file, e.g. a file with a single byte 'a', there may be multiple shortest compressions. It seems like there should be a special judge. In the actual contest, no one solved this problem in 109 submissions, according to http://acm.up.pt/local/Historial/2003/stats-miup03.html
I suspect ...

1. Semicolumn should probably be semicolon.

2. The 11x11 example table contains 14 twice, and one of them should be 24.

3. There may be something wrong with the judge as there's still no AC for a relatively straightforward problem.

1. What is a semicolumn?
2. 14 appears twice in the 11x11 table.
3. is there some hidden input/output assumption?