By RAD, 14 years ago, translation, In English

Attention, participants from the Division 1! As a test feature, you can participate in Codeforces Beta Round #32 "out of competition".


Everybody knows, that the 2nd of October - birthday of Mohandas Gandhi. We dedicate today's round to him, and many other great people who were born on October 2 :)


Round was prepared by Mike Mirzayanov, Matov Dmitry and Max Ivanov.

Special thanks to Julia Satushina for translation of statements.

Good luck!


Artem Rakhov and Codeforces team

UPD:

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it

By MikeMirzayanov, 14 years ago, translation, In English

What can be better than good news? Right you are - excellent news. The news I'm going to share with you is such.

We're glad to tell you, that VK company is now the primary sponsor of Codeforces project! It's a great honor for us - because VK is not only the largest social network in Russia and one of the largest in the world, it's also an example of a high-tech, innovative approach and dynamic development.

VK's help will allow us to continue the development of the platform, to run interesting contests for you on a regular basis. We have ambitious plans to fill Codeforces with useful educational content.

It's also important for us, that Codeforces programming contests community attracts not only its makers and participants.

"Codeforces contributes a lot into the development of collegiate programming in Russia. I'm glad that we have a chance to support this project. I hope it becomes even more interesting to participate in and win Codeforces contests", - says Pavel Durov.

"A powerful developers team is the main driving force of our company. It's at contests, like Codeforces, where we find young and talented programmers, who can solve difficult technical tasks", - added Andrey Rogozov, the head of VK development department.

Wish you high rating,
Mike Mirzayanov

Full text and comments »

  • Vote: I like it
  • +66
  • Vote: I do not like it

By RAD, 14 years ago, translation, In English
Hello everyone on Codeforces Beta Round 31 (Div. 2, Codeforces format)

Round was prepared by: Mike Mirzayanov, Dmitry Matov, Max Ivanov and me.

Good luck!
Artem Rakhov and Codeforces team

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it

By e-maxx, 14 years ago, translation, In English

Today's contest was prepared by Saratov SU 2 team (Maxim Ivanov, Artem Rakhov, Nickolay Kuznetsov).


You will be asked to solve five easy and not so easy problems for some King, whom you hardly heard anything before. The king hopes that the problems won't turn out very difficult to you, and he will have a wide choice among different solutions to each of the problems.


UPD. The contest has finished, thanks to all of you.

The Results table.

Greeting to rng_58 for his win in today's round!


Problem tutorials: A, B, C, D, E.

Full text and comments »

  • Vote: I like it
  • +50
  • Vote: I do not like it

By RAD, 14 years ago, translation, In English
Today in Russia it's not just the 20th of september, it's Recruiter's Day. In Azerbaijan – Oil Industry Worker's Day, and in Belarus – Customs Officer's Day. But for us it's another good day to arrange the round. Welcome to Codeforces Beta Round #29 (Div. 2, Codeforces format)!

Helped with preparation of the round: Mike MirzayanovDmitry MatovGerald Agapov and Nickolay Kuznetsov, thank them for that.

Happy Recruiter's Day,
Artem Rakhov

Full text and comments »

  • Vote: I like it
  • +9
  • Vote: I do not like it

By Polichka, 14 years ago, translation, In English

Attention-Attention!!!

Today Saratov SU #1 (Gerald, Polichka, Fefer) team invites all of you to take part in Codeforces Beta Round #28. 

We began studing sport-programming in school. But when we entered the Saratov State University we took it seriously and made our way from SU #7 to Saratov SU #1. Now our first-grade ambition is to justify this number.

We are going to offer you 5 interesting problems. You will be helping some good people to deal with their problems, will be solving some administrative tasks, will be playing some interesting games and also will be saving the World.

Thanks to everyone for their help in preparing this round. 

Successful hacks and fast accepteds!
With best regards, Saratov SU #1.

UPD: Ratings have been updated.

UPD:

Full text and comments »

  • Vote: I like it
  • +75
  • Vote: I do not like it

By RAD, 14 years ago, translation, In English
We want to congratulate you with a happy new school year with this contest. We wish you excellent marks, easy exams and many Accepted in the contests. Let this year bring you many new and interesting knowledge!

Artem Rakhov and Codeforces team 

P. S. Note that the round will be held on the Codeforces Format Rules. Read the rules before the competition. Good luck!

Full text and comments »

  • Vote: I like it
  • +13
  • Vote: I do not like it

By Nedy88, 14 years ago, In English
Hello everybody,

Codeforces Beta Round #26 will be held on Monday, the 16th of August, at 19:00 MSK. It will be Codeforces format round, and if all goes well it will be rated. Authors of the problems are Artem Rakhov and me. Thanks to Mike Mirzayanov and Dmitry Matov for help in organizing it. Also thanks to Julia Satushina for translation of problems.

Good luck, see you on the round!

UPD: The contest is over, thank you to everyone for participating.

Full text and comments »

  • Vote: I like it
  • +35
  • Vote: I do not like it

By RAD, 14 years ago, translation, In English

Welcome to Codeforces Beta Round #25 (Div. 2)


Authors of today's round problems are Mike Mirzayanov and me. I want to thank to Dmitry Levshunov for technical assistance in organizing the contest, as well as Gerald Agapov and Nikolay Kuznetsov for writing alternative solutions.


I wish you all good luck!


UPD: The contest is over, thank you to everyone for participating.

Full text and comments »

  • Vote: I like it
  • +35
  • Vote: I do not like it

By Egor, 14 years ago, translation, In English

Task A

This is pretty simple task - we have cycle and must direct all edges on it in one of 2 directions. We need to calculate cost of both orientation and print smallest of them.
There is a small trick - we can calculate cost of only one orientation and then cost of the other will be sum of costs of all edges minus cost of first orientation.

Full text and comments »

  • Vote: I like it
  • +24
  • Vote: I do not like it