By Dmitry_Egorov, 6 years ago, translation, ,

I am sorry for mistakes in English and I will be glad if you tell me about them.

#### 168A - Wizards and Demonstration Аuthor kuniavski.

In this task, it was necessary to write exactly what has been described in statement. In particular, it was necessary to have people, who come to the meeting. For this it was necessary to create clones.

#### 168B - Wizards and Minimal Spell Аuthor kuniavski.

In this problem you had to write exactly what has been described in statment too. Read lines one by one. Also keep the last block of lines that are not amplyfying. If the next line is amplyfying (which can be checked by linear search), we print the last block, if any, and the line itself. Otherwise, remove all spaces from the string and add to the last block.

•
• +99
•

By PavelKunyavskiy, 6 years ago, translation, ,

Hello!

We are happy to invite you to participate in today's round. I hope everyone will find interesting problems for him. And most of the round participants will like it as well as the previous one.

Today's contest was prepared for you by SPb SU 4 team (Alex-Gran (Alexandr Granovskiy), Dmitry_Egorov (Dmitry Egorov), kuniavski (Pavel Kunyavskiy)). After long thoughts you can notice that we present St.Petersburg State University.

Thanks very much for help in the tasks preparation to Artem Rakhov(RAD), Gerald Agapov (Gerald) and Maria Belova (Delinur) for translation statements. Also thanks to Petr Kalinin (KAP) for statements proofreading.

In today's contest there will be seven problems (5 in each division) about the country where wizards live, and this causes many interesting events. Today you have to take part in local meeting, understand the intricacies of writing spells, ride on the magic transport, try to take away magic prizes, play in popular wizards game, help magic government in ruling the country and resolve financial dispute of two famous wizards.

Scoring is standard is standard in both divisions today (500-1000-1500-2000-2500).

UPD: analyse was published.

Good luck!

•
• +207
•

By Burunduk1, 6 years ago, translation, ,

Hello everyone!

It’s time for the second round of the VK Cup 2012. Let me remind you that the registration for this round is also required and it’s closed five minutes before the start.

The problemset has been developed by various authors from VK, Codeforces and Saratov State University. We worked hard to make this time interesting for competitors and to have the best ones in the next round.

This round will be run according to Codeforces rules: with room assignments, hacks and usual score decrease. It will be rated for you either if you participate in VK Cup or just solve it as a normal round.

Top 175 competitors will advance to the second round immediately. 25 more competitors will advance to the second round via the second unusual rules wildcard round on March 28. This round will consist of only one problem with inexact solution.

Please, to make the round even more interesting for you, read the statements of ALL problems.

Good luck and try to win!

Announcement of VK Cup 2012 Round 2

•
• +163
•

By MikeMirzayanov, 6 years ago, translation, ,

Hello.

VK Cup 2012 Round 2 will be held in two editions:

In each of these editions the ratings will be updated (separately). In the first edition the ratings will be updated according to the results of participant of both types: official and unofficial. Ratings of the participants of both types will be updated. In the second edition it is easier — there is only one type of participants and and their ratings will be updated in typical way.

•
• +43
•

By I_love_natalia, 6 years ago, translation, ,

On March 18 Samara Interacademic Programming Contest was held. It is one of two Collegiate Programming contests, which are organized in Samara every year.

Everyone can take part in this contest as a Codeforces Gym contest. Like any train, this contest uses ACM ICPC rules.

Problem writers are Alexey Dergunov(dalex), Nikita Glashenko (Hohol), Pavel Semushin (craus) and Andrey Gaidel (Shlakoblock). Testers are Natalia Bondarenko (natalia) and me (I_love_natalia).

Contest will be most interesting for participants with color from green to orange (Difficulty is 3 stars). Red participant most probably will spend much less time than 5 hours for solving all problems (both of testers finished it in about 3 hours).

Train will be held on Saturday at 16:00 MSK. Everyone is welcome to participate.

Please, do not use any prewritten code and any internet materials in token of respect to ghost participants who will compete with you ;)

Upd. Time was changed to 16:00 (MSK, UTC+4).

Upd2. Don't forget to use input.txt and output.txt files instead of stdin/stdout.

Upd3. Do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

•
• +91
•

By HolkinPV, 6 years ago, translation, ,

Welcome dear friends)

We are glad to introduce you regular Codeforces round #113 for Div.2 participants. Everyone can traditionally participate in it.

Problems are prepared by known command of authors: Kholkin Pavel (HolkinPV), Nikolay Kuznetsov (NALP), Artem Rakhov (RAD). Also thanks to Gerald Agapov (Gerald) for his help, Michael Mirzayanov (MikeMirzayanov) for Codeforces system and Mary Belova (Delinur) for translating problems.

In todays contest would be one innovation. Score distribution would be dynamic. More information you can find here)

We hope that todays round would be succesful. We wish you good luck and high rating!

UPD: The contest is over. Hope you enjoy the problems) the editorial is already here)

Congratulations to winners:

•
• +71
•

By MikeMirzayanov, 6 years ago, translation, ,

CROC invites talented and innovative programmers (at least 18 years old) to participate in the Open Moscow Programming Championship. The championship is held on the basis of the Codeforces project. Saratov State University involved into jury and the technical committee. The official championship language is Russian, but the problems will be in Russian and English.

The championship will consist of qualification, two online rounds (on April 3-4, 6 and 20) and the final round that will take place on April, 27 in Moscow in the CROC Headquarters. The championship finals will also include a AI-game round.

The championship winners will be awarded with valuable prizes: the first place winner gets 100000 rubles, the second and third place winners get Apple MacBook Pro. The contestant who wins the first place in the AI-game round will be awarded with an Apple MacBook Air.

To participate in the championship, you must register on http://www.crocok.ru/championship/ (in Russian) before April 4, 2012.

You can also learn more about the project if you follow the link http://crocok.ru and click the tab called "Programming Championship".

•
• +65
•

By Nickolas, 6 years ago, translation, ,

So here goes the editorial. Note that Factor allows pretty random codes, feel free to put all words in one line, but all words must be separated by at least one space, don't try to skip a space between a bracket and a word or something like that.

#### 162A - Pentagonal numbers

This problem was almost the same as 130A - Hexagonal numbers from Befunge round. Data input and output is done exactly as in the sample code, and besides them the program needs only basic stack operations.

USING: io kernel math math.parser ;

dup 3 * 1 - * 2 /
number>string print


Factor has a very system of built-in libraries which liberate the programmer from solving a lot of basic routine tasks. So after the first (trivial) probllem I gave several one-liners

•
• +42
•

By Nickolas, 6 years ago, translation, ,

The contest is over. My sincere respect to the winner in overall run nab who solved all 10 problems in 1h 25m, and congratulations to the winner in the official contest winger who repeated this heroic deed in 1h 52m.

Here is the editorial.

The language of this round is Factor — a stack-based functional language with a sophisticated system of built-in libraries (dictionaries).

•
• +78
•

By NALP, 6 years ago, translation, ,

Dear friends!

The next competition — Codeforces Round 112 for participants Div. 2 will take place through a pair of hours, but the others can traditionally participate out of competition. It has been prepared by a small command of authors: me (NALP), Artem Rakhov (RAD) and Pavel Holkin (HolkinPV). There were Gerald Agapov (Gerald), Maria Belova (Delinur) and Michael Mirzayanov (MikeMirzayanov) with us as always.

Especially I would like to wish good luck to my teammates Artem Rakhov and Max Ivanov (e-maxx) who recently flew to the U.S. to participate in Onsite Round Facebook HackerCup.

We hope that this problems will be pleasant to all participants and everyone will take the deserved high place in the standings :)

UPD: The contest is over, thanks to all for taking part :) We hope you have fun.

UPD: You can find the tutorial here http://codeforces.ru/blog/entry/4124

UPD: Congratulations to the winners!

You can see the full standings here: http://codeforces.ru/contest/165/standings