The round is over; I hope you enjoyed it. Here is the editorial.

The language of this round is Befunge, a lovely two-dimensional esoteric language. It's quite neat and convenient, especially for an esoteric language. Thus, for example, "A+B" problem, where A and B are given in separate lines, can be solved like this:

&&+.@

To learn the language you can read the original documentation (the rumor is that it is broken in some browsers), examples of programs at Rosetta Code and Progopedia article with annotated examples.

Our testing system uses befungee interpreter, which implements Befunge-93 dialect. To run the interpreter, one needs to have Python installed (version 2.6 or so, but not 3.*). Download files befungee.py, boards.py and funge.py to the directory with your programs and run the interpreter with python befungee.py <Befunge program name> command. Note the built-in debugger (run with --debug --delay=100 option) which allows to watch the movement of instruction pointer through the program and the effect it has on the stack.

As an alternative local IDE you can use WASABI which requires Java. Download interpreter arhive, unzip it and run with java -jar "Wasabi v1_4.jar" <Befunge program name> command.

In input data end of line is marked with #10 character (you'll need this for problems which require reading the string till the end of line). Your program's return is checked to be accurate within the whitespace and line feeds; it's not necessary to end the printed lines with line feeds, and if a problem requires printing several numbers, they can be separated with any number of spaces. Extra spaces at the end of line are also allowed.

Hello everyone!

I am glad to welcome you on Codeforces Beta Round 94. I hope, some more early time of start will not have bad effect on you results =) 

I'm author of today problems. I'm a graduated student of SPbSU, Valery Samojlov. This is my second round. I hope, today nobody will be sorry of his participation. I want to say very big thanks to RAD, who rend me very big support with preparation of problems. Also thanks to Maria Belova, who has translate statements to English.

Please, don't be startled of unusually cost of problems:

Div-1: 1000 - 1500 - 1500 - 2000 - 2500

Div-2: 500 - 1000 - 2000 - 2500 - 2500

Hello everyone!

I am glad to welcome you on today round of Codeforces. I hope that recent color revolution and a more later time for start of round will make some variety into process of solving problems:)

An author of today problems is me. RAD helped me to prepare this round, Delinur translated statements into English.

Good luck.

UPD.

The round ended, ratings was updated.

Winners of div1:

1. Egor

2. tourist

3. unicef

4. sevenkplus

5. ivan.popelyshev

Winners of div2:

1. RainbowDash

2. cjtoribio

3. miraliv

4. adrian.jaskolka

5. majia5

Yippee!

Every time I win a trip to any kind of tournament onsites (so far this happened three times, so I can generalize), I find myself facing a serious problem, named "souvenirs". I've settled this question once and for all as long as it concerns myself: the best souvenir is a pile of photos accompanied by a thrilling story. The second-best is a couple of Swiss chocolates, though I can handle both at the same time :-) But one can't live in a society and be free of it; and it's the souvenirs for people around me that become a real problem.

Take, for example, my last year's trip to Las Vegas. I went there with a t-shirt demand from my future husband's sister. Besides, my future husband himself stayed at home (his visa application was unexpectedly refused, and there's not much point in winning a trip without the visa), and I felt I had to bring him something to cheer him up. So my shopping plans were quite intense.

Hello!

Today is November 7th. And this, as you probably know, is a very special day for many ex-USSR citizens. Many years ago on this day the Great October Socialist Revolution happened. I still remember red flags and military equipment on the avenue and the feeling of common joy and holiday. But today, in 2011, we have another revolution — the Codeforces revolution of colors and titles. Hooray!

So, over the last few months our community has grown significantly. If we count the users who have participated in the rated contests over the last 9 months at least once, at the beginning of the year they were 4330, and now — 7615. This is a great step forward! Of course, this leads to a dramatic rating inflation. Most of the ELO-like ratings have the same issue. For example, only A. Karpov had Elo chess rating of more than 2700 in 1979; however, there were as much as 15 people with such rating in 1994, and in 2009 they were 33. In 2001 there were less than 10 red players on TopCoder; in 2005 they were about a hundred and now — more than 250.

A similar effect occurred on Codeforces. It is particularly striking as it is accompanied by a marked audience growth. For this reason it was decided to change the color system . In addition, the record shows that not all participants liked the military ranks. Besides, they are quite far from our intellectual and sporting spirit. Today we will disband Codeforces as a military unit and introduce sport titles. We've mostly used the titles from intellectual sport games to work out the following classification:

In addition, the rating recalculating formula was slightly fixed to slow down the inflation. Now the sum of ratings will not be the constant, but is likely to be slightly falling. In fact, the changes are cosmetic and will be visible only on a series of contests.

I understand that for some of you it will be hard to say good bye to the favorite color, but let's look ahead with optimism — new victories will bring the lost color back color and help to win the proud title of a Grandmaster!

MikeMirzayanov

"Tryam" to everyone!

I am an authors of the today's contest. First of all I want to thank Artem Rakhov [RAD] (thanks to him, you'll understand my problems) and Maria Belova [Delinur] (those who know my English level will understand a huge of my thanks). Also thanks to everyone staff for the wonderful of the codeforces system. And also thanks to Sergei Tarasov [Seryi] and Andrey Tkachenko [Tkach1024] for ideas generating and testing.

Good luck and have fun.

Today, a breakdown of score will be slightly different from the standard - for the second division is 500-1000-2000-2000-2500 and 1000-1000-1500-2000-2500 for the first.

And one more, but certainly pleasant news - register ends exactly at the start of the round.

Analysis problem.

What we have now.
We believe that the round should be rating. But if the situation with the problem 123B - Squares is strongly influenced to you, you can send an appeal with the evidence of this in the form of a personal message to RAD no later than 11pm on November 4. We can either do this round unrated for you or remove excess submits.
At the end of the system testing rating will be updated. If you have no appeals, it will be your final rating.

Sorry for the inconvenience.

Hello!

Informal contest Codeforces Testing Round #2 is scheduled on 10/29/2011 01:00PM (UTC). We will test the latest innovations on Codeforces that they do not affect the contests. If not, we will fix it quickly :) So, this round will take place "as is", no warranty about it.

Problems for the round may be famous to someone, but I'll try to make them such not for any of you. It will be about 4 problems, as quite simple and something more tricky.

I say thanks in advance to all those who will come and test the system. Thank you!

The contest moved to start on 10/29/2011 01:00PM (UTC) (it has been announced to start on other time, be careful).

It will be unrated round.

Thank you all for your help. I think it turned out pretty fun for you and useful for us!

Hello!

Wellcome to Codeforces Beta Round #91! This time, the author of the round will be me, Herasymiv Vitaliy (witua). Thanks a lot to Artem Rakhov (RAD) for helping in round preparing and Maria Belova for problems translation. I hope you will like problems.

Good luck!

Thanks all! And here are the winners:

Division 1:

1. tourist
2. 2222
3. PavelKunyavskiy
4. Petr
5. vepifanov
6. dzhulgakov
7. e-maxx

Hello!

Today, October 23 (Sunday) at 08:00 (UTC) will begin online contest based on recently completed ACM-ICPC NEERC Southern Subregional Programming Contest 2011. Two days ago a competition was held in Saratov (hosted by Saratov State University), but today you can participate in it informally. Onsite participants will in the standings, to give you an oppotunity to compare your results with onsite teams. The statements will be available as a PDF-file and in HTML. To participate, go to the site http://acm.sgu.ru.

After the contest, you may discuss here the problems. I hope you'll like them.

Chairman of the Jury,
MikeMirzayanov