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.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Tutorial of Codeforces Beta Round 13
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.
Announcement of Codeforces Beta Round 13
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:
- Current standings
- Problems
- Contest winner: barsuk1
Problemsetters: Дмитрий Матов и Игорь Кудряшов. Thank them for their contributions.
I wish you to advance to the first division.
Mike Mirzayanov.
Announcement of Codeforces Beta Round 12 (Div 2 Only)
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
Announcement of Codeforces Beta Round 11
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.
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.
Announcement of Codeforces Beta Round 10
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. Tutorial of Codeforces Beta Round 9 (Div. 2 Only)
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!
Announcement of Codeforces Beta Round 9 (Div. 2 Only)
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?
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.
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.
Announcement of Codeforces Beta Round 8
The contest is rescheduled to start on 19:45.
Thank you all for participating in Codeforces Beta Round #7. I hope you enjoyed it. You may discuss the problems and system in comments. Please express your opinion, especially if you notice any inappropriate behavior. And as always, I will read with interest the suggestions for improvement.
From today on both-divisions contests ratings will be updated separately for each division. I. e. ratings will be calculated as if two contests (one per division) have taken place on the same problemset.
Also I would like to see someone who wants to write contest tutorial. This must be done in Russian and English languages. Of course you must solve the problem on either contest, or in the practice. If you have a desire to do it - write in comments. Your post will be published on the main page and later available on special link available from the contest page.
Good luck.
Ratings has been updated. Solutions are available for view.
Announcement of Codeforces Beta Round 7
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/21/2024 21:17:04 (g1).
Desktop version, switch to mobile version.
Supported by
