The contest is over; the editorial is here. I've mis-estimated the complexity of the problems — but how could I possibly guess who will arrive and finish everything in 40 minutes :-) Congratulations to the winners — the slowest and the most relaxed of them took under an hour to solve all the problems.
Today's round features Roco — a little-known esoteric language with a special approach to loops and subroutines. The programs written in it look a bit bulky, especially when compared to Befunge, but this is compensated by their relative simplicity and readability. Here is a program which calculates the sum of two given numbers:
iin  iin  add    iout  ac
There is also exactly one interpreter for Roco, written by its author. To run it, one has to have C++ installed (the author uses g++, and so do we), compile the interpreter source code into an executable file and run programs using command "roco program.roco". You can download the interpreter here.
Surprise Language Round #6 will take place on May 25th. This contest is dedicated to an event of great importance to me: last week we celebrated the 5th anniversary of Progopedia project (and two and a half years since I joined the project). To make the contest even more memorable, we decided to add the prizes: Top-5 finishers will receive T-shirts, and not just plain Codeforces T-shirts but special ones designed especially for Surprise Language Rounds. By the way, the design is not finalized yet, so feel free to suggest something witty or funny, or both.
The rules of the contest are as follows:
- The contest is unrated for everybody.
- The round uses ACM ICPC rules: the standing is defined by the number of solved problems, ties are resolved based on penalty time. Initially the penalty is 0, and for each solved problem it is increased by submission time (since the start of the contest) + 20 minutes for each failed submission. The solution is considered to be correct if it passes all tests from a predefined test set; you know whether the solution is right immediately after sending it. There are no hacks
- The round has 8 problems, sorted by estimated complexity, and you have 2 hours to solve it.
- Solutions are accepted only in one language, which will be announced at the beginning of the contest. The language was created a while ago, we didn't invent it for this occasion.
- Please reread this post at the beginning of the contest: we will announce the language and add instructions to install the compiler (the contest interface will provide an option to run your solutions online as well) and links to useful manuals. Other than that, learning the language is up to the competitor. You can use any resources to solve the problems (as long as you remember that this is an individual competition); you don't have to limit yourself to the manuals provided in the post.
We hope that the language we chose will be unknown to most of the competitors. For reference, here is the list of Surprise/Unknown Language Rounds which took place on Codeforces earlier.
|VK Cup 2012 Wild-card Round 1||Factor|
|Surprise Language Round #5||COBOL|
|Unknown Language Round #4||Befunge|
|Unknown Language Round #3||Pike|
|Unknown Language Round #2||Io|
|Unknown Language Round #1||Tcl|