OJ Board

I thought that I might point out some funny thing while I was solving 5x5 puzzles, but I think they might be universal to such a problem of any size even though I don't how to prove it right or wrong.

Assuming NxN is a size of a puzzle.
First I found out that all solutions are equal to solutions ...

Well, taking into consideration that I still haven't sent a single program that used more than "Minimum" with #include <stdio.h> - though I am not UVA's VESA (Very-Experienced-Solution-Author :wink: ), I was kinda surprised by this. I thought I made some error when writing and (unconsciously? :P ...

When I try to submit a code to solve problem 10596 (I just haven't tried the other) the memory usage is WAY too much. It should stay under the "Minimum" but it's about 300-400 kB. I wondered for some time what could be the problem, then I recalled reading about such a problem in Jon Bentley's ...

Indeed, let's sum the needed changes up:

-Corrector program must be updated (little joey)

The statement should claim that:
- [rule] the expression is mathematically correct and thus can be treated as calculable (so the solution author doesn't have to assume anything is correct or not - like: "the ...

My point is that until specification is made more specific the "lonely letters" cases should not happen to appear in the tests. Let me explain this by showing two different views:

VIEW ONE
If the expression result for "A" is A, then what is the expression result for "AB"? It would have to be B ...

Why for a single letter (or rather letters at the end of the expression at all) there should be and output consisting of only loading them into the register? (I assume that mf's output code would be AC - and there is the "single letter" case)

It is against rule 4 - it states "assembly code must be ...