→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
2 days
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
2 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
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
Welcome to the Codeforces Beta Round #6.
It will be good to see your feedback and impressions in the comments.
Wish you high rating,
MikeMirzayanov.
UPD. It seems the problem D has some tricky issues around judge solutions. Judge solutions will be fixed and the problem will be rejudged. If it will affect many participants, the contest will not be rated.
UPD 2. We have reduced constraints in the problem D and made rejudge. No solution passed tests. So the rejudge affected significantly only 4 participants, who solved it during the contest. But all of them increase their rating if we will count the contest as rated event. So we decided to make it rated and put problem with lowered constraints into the practice.
UPD 3. And by the way, the round tutorial is waiting for a volunteer. The tutorial should be in Russian and in English. It will be published on the homepage and later will be available via special link from the contest page.
Announcement of Codeforces Beta Round 6 (Div. 2 Only)
Hello to everyone.
The latest news - now you are able to see the source code of the solution. During the contest you can view your own solutions only, but when the contest is finished you can view the solutions of any other participant. The table with the solutions is available via the problemset page, the solutions there are sorted by the program length. Pay attention, please, that you are free to change the sorting criteria using the option at the bottom of the table.
There is another principle that gives you the chance to view the source codes of solved (during the contest or practice) solutions only. Personally, I regard the principle "everyone sees everything" as more suitable for our regular contests. Am I right?
When you run a contest within your private community, you'll be able to set up your own principle for viewing solutions (or to switch off this function at all). But this functionality is under construction now.
Wish you high rating,
MikeMirzayanov
UPD. Standings page is improved. You may double-click into a table cell (or use Ctrl+click) to view the submissions history.
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.
Announcement of Codeforces Beta Round 5
A. Watermelon
Only if w can be presented as 2m + 2k watermelon can be divided to two even parts.So w = 2(m+k), where m, k ≥ 1, that is
(w ≥ 4 и w - even) - necessary and sufficient condition for watermelon dividing.
Hello, everybody.
At this point we have already decided on the date of Codeforces Beta Round#5: it's Saturday, March 20. The exact time is still unknown. I do want to find the best time suitable for most participants. Please, express your ideas in the comments - of course, you should not come up with the time that suits only you, but suggest the most suitable time for the majority.
Wish you high rating,
MikeMirzayanov
UPD. Thanks to everybody who wrote comments - I've read them all. The venture proved to be useful. Without your help, I wouldn't have been able to take into consideration all those factors which can affect the number of participants. After much thought, I've made a decision to schedule the round for 19:00 (Moscow time) - I think this option is convenient for most users of the site. It does not mean that we will not experiment with time in future - we will try morning contests, but I can't promise about 5:00:).
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/21/2024 11:51:53 (f1).
Desktop version, switch to mobile version.
Supported by
