By MikeMirzayanov, 14 years ago, translation, In English
Today's round is not quite usual. The participants of the first division can register on it and to participate out of competition. This round will be some alpha-testing for this functionality, but for the next div. 2 round you can expect a stable version. 

This round prepared for you by: homo_sapiensJuliaNerevarKudryashovIA and me. 

I want a high-ranking 
MikeMirzayanov

Full text and comments »

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

By KADR, 14 years ago, translation, In English

Let me introduce an editorial to Codeforces Beta Round #13. If you have any questions or propositions - feel free to post them in the comments.


Full text and comments »

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

By KADR, 14 years ago, translation, In English
Welcome all to Codeforces Beta Round #13, which will be held on Thursday, 6th of May at 18:00 MSK. I am an author of the problems.
I would like to thank Mike Mirzayanov who made this contest possible, Roman Iedemskyi and Andriy Maksay for helping to test authors solutions and Dmitry Matov for the translation of problem statements into English. Hope you will like the problems.

I hope that number 13 would be lucky for you!


UPD: Congratulations to Ivan Metelsky who became the winner, having solved all 5 tasks!
You can view the tasks here.
You can view the results here.

UPD2: I've added an editorial.

Full text and comments »

Announcement of Codeforces Beta Round 13
  • Vote: I like it
  • +34
  • Vote: I do not like it

By MikeMirzayanov, 14 years ago, In English
Hello again. I hope nobody has forgotten to register?

In this contest we will try alpha of our chat - if something goes wrong, we turn it off: please do not panic:)

Links:
Problemsetters: Дмитрий Матов и Игорь Кудряшов. Thank them for their contributions.

I wish you to advance to the first division.
Mike Mirzayanov.

Full text and comments »

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

By meret, 14 years ago, In English
Let me warmly welcome you to Codeforces Beta Round #11. I am the main problemsetter for this contest. I hope you'll have fun solving the prepared tasks :-)

Thanks to Mike Mirzayanov for making this possible and to Ania Piekarska for testing the problems.

Good luck,
Jakub Pachocki

Full text and comments »

Announcement of Codeforces Beta Round 11
  • Vote: I like it
  • +30
  • Vote: I do not like it

By Nerevar, 14 years ago, translation, In English
Codeforces Beta Round #10 took place on Thursday, 15th of April at 19:45 MSK. This time I am the author of the problems. I would like to thank the creator of the Codeforces Mike Mirzayanov for correcting the statements and Julia Satushina for the excellent translation problem statements into the English.

I want to apologize for the problem D. There was a bug in model solution. Moreover, this problem may not be solvable in polynomial time even with such constraints on the number's size. We will investigate it. I hope nobody will feel offended in any case.

UPD: Now I am pretty sure that my model solution for the problem D was completely wrong. I want to apologize for it again. There will be no rejudge of the solutions accepted during the contest. The statement will be changed so that it will ask to find the LCIS of the two sequences. This problem definitely has a solution.

UPD: Problem D was changed as I promised.

Full text and comments »

Announcement of Codeforces Beta Round 10
  • Vote: I like it
  • +21
  • Vote: I do not like it

By slycelote, 14 years ago, In English

A. Die Roll

If the maximum of Yakko's and Wakko's points is a, then Dot will win, if she has not less than a points. So the probability of her win is (6 - (a-1)) / 6. Since there are only 6 values for a, you can simply hardcode the answers.

Full text and comments »

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

By Alex_KPR, 14 years ago, translation, In English

Hi, everybody, and welcome to the Codeforces Beta Round #9!

I'm its author. :) I've tried to make problems easy to read and funny. I’d like to say thank you to Mike Mirzayanov (for choosing problems for the contest and everything he’s done to organize it), to Igor Kudryashov (for checking author's solutions and making test generators), to Dima Matov (for correcting everything :)) and, of course to Julia Satushina (for excellent translations of the problems’ legends).

I'd like to remind you that if you have any questions on the problems, the best way to ask them is to use the web interface on the problems page.

I believe that the contest will be interesting to you, dear participants! I’m looking forward to seeing your suggestions here.

Good luck!

Full text and comments »

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

By MikeMirzayanov, 14 years ago, translation, In English
In case you are not familiar with the term, this the way of filling the site with content by the joint effort of the community. You might read a Wikipedia entry.
Basically, the idea to apply crowdsourcing to contests tutorials seems quite natural, but… it works badly. As you see, it is not the first time there has been no one willing to help the community. The question is: why and what is the way-out?

Let’s discuss it together. What should be changed/improved in order to make contests tutorials appear at Codeforces?

Full text and comments »

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

By MikeMirzayanov, 14 years ago, In English
Welcome and good luck on the round! 

I'd like to remind that if you have any questions on the problems, the best way to ask them is to use the web interface on the problems page. 

Later in the same post we will discuss the round. 

Wish you high rating,
MikeMirzayanov.

UPD. For contest you may thanks team Saratov SU #5, namely, users FeferGerald and Polichka.

UPD2. And better late than never: the presence of English statements we are obliged only to Julia. Many thanks to her for 8 wonderful translations of 8 rounds.

Full text and comments »

Announcement of Codeforces Beta Round 8
  • Vote: I like it
  • +22
  • Vote: I do not like it