| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Hello, Codeforces.
Sorry, but for a reason independent of Codeforces, we are forced to cancel the round. It was planned as a mirror of an onsite-olympiad, but suddenly it turned out that this would not work.
We will try our best to please you with other rounds. Stay tuned!
The round Educational Codeforces Round 80 (Rated for Div. 2) will start on Jan/14/2020 17:35 (Moscow time). Hope to see you as a participant!
Hello Codeforces!
We are glad to invite you to Codeforces Round 613 (Div. 2), which will be held on Jan/10/2020 17:05 (Moscow time). The round is rated for Div. 2 contestants. There will be six problems with a duration of 2:15
The problems were prepared by me, mohammedehab2002, TripleM5da, and MikeMirzayanov.
I'd like to thank awoo for coordinating the round, dorijanlendvaj, aryanc403, Ari, nooinenoojno, defolaut, Pavlova, mahmoudbadawy, zoooma13, Mohammad_Yasser, Rox, and BledDest for the invaluable testing, and MikeMirzayanov for great Codeforces and Polygon systems.
Good luck!
UPD1: We decided to add one more problem and extend the duration to 2:15 to make the contest more balanced.
UPD2: Score distribution: 500-1000-1250-1750-2250-3000
UPD3: Editorial is out.
UPD4: Thanks for participating! Congratulations to the winners:
Div. 1 (unofficial) participants
Div. 2 participants
Announcement of Codeforces Round 613 (Div. 2)
Hello everybody!
Now the winter SIS (Summer Informatics School) is taking place, and we, as part of the parallel A*+ with its teachers, have prepared a complete Codeforces Round.
The round will happen at Jan/05/2020 17:05 (Moscow time) and will last for 2 hours. There will be 6 problems in each division.
The tasks of the round were invented and prepared by ismagilov.code, devid, Volkov_Ivan, Jatana, karasek, polinarria, cookiedoth, AlesyaIvanova, KhB, AliceG, D.Pavlenko, VFeafanov, LordVoIdebug, forestryks, Ilistratov, seiko.iwasawa, senjougaharin, Drozd_off under the guidance of teachers PavelKunyavskiy, VArtem, meshanya, budalnik.
Thanks aneesh2312 MarcosK Stepavly Infinity25 tourist antontrygubO_o isaf27 fedoseev.timofey, Kurpilyansky, vintage_Vlad_Makeev for testing!
And, of course, thanks to MikeMirzayanov for great systems Codeforces and Polygon, and 300iq for round coordination.
Good luck everybody!
UPD:
In problem E an error was made in the intended solution, an overflow of long type while calculating the answer. The first test, on which it happened, reached 4 participants (ainta aid Um_nik ecnerwala), among who two passed the pretests, and two others did not, though they should have. In automatic mode, it is not possible to test so that both answers are accepted, because the overflow changes the tests because of the way the requests are encrypted. So, we decided to test two pretest solutions on the old set of tests and the rest on the new one. As a result, three of the solutions passed the tests (congratulations!), and one received WA80 on the 17th answer inside the test, which is clearly not related to the overflow problems. Only the solution that takes into account the overflow problem can be used in upsolving.
UPD: Editorial!
Announcement of Codeforces Round 612 (Div. 1)
Announcement of Codeforces Round 612 (Div. 2)
Hello, Codeforces!
We are thrilled to announce the second instalment of our Hello Muscat ICPC Programming Bootcamp, organized by Harbour.Space University in collaboration with Codeforces, ITMO University, GUtech University, and our local partner: Phaze Ventures. The Bootcamp’s main sponsor is British Petroleum (BP), supporting Oman’s national priorities: youth development, economic diversification and job creation.
We are also excited to let you know that Codeforces has become the main collaborator of Harbour.Space for our programming bootcamp series, and will be in charge of all the educational content, from contests to problem analysis and lectures, bringing the online legacy of the platform to a unique offline experience.
Hello Muscat will take place during 19 – 25 March 2020 and will feature ICPC world champions and finalists as well as legendary names from the field of competitive programming:
Mike MikeMirzayanov Mirzayanov, Nikolai KAN Kalinin, Andrey andrewzta Stankevich, Artem VArtem Vasilyev, Mikhail darnley Dvorkin, and more coaches to be announced soon!
The bootcamp will be available to teams of different skill levels, separated by two divisions of difficulty:
Single participants and teams must register before January 30th to receive the 15% off Early Bird Discount.
Universities and individual participants that took part in our previous bootcamps and who register for this edition will receive the 20% off Loyalty Discount.
That’s all from us. Head over to our webpage to find out more, and see you in Muscat!
Hi everyone!
This summer I gave another contest in summer Petrozavodsk programming camp and (although a bit lately) I want to share it with codeforces community by adding it to codeforces gym: 2018-2019 Summer Petrozavodsk Camp, Oleksandr Kulkov Contest 2. To make it more fun I scheduled it on Sunday, 5 january, 12:00 (UTC+3). Feel free to participate during scheduled time or, well, whenever you're up to. Good luck and have fun :)
Problems might be discussed here afterwards, I even may write some editorials for particular problems (per request, as I don't have them prepared beforehand this time).
UPD: 17h reminder before the start of the contest
UPD2: It wasn't an easy task to do, but I managed to add ghost participants to the contest! Enjoy!
Announcement of 2018-2019 Summer Petrozavodsk Camp, Oleksandr Kulkov Contest 2
새해 복 많이 받으세요, 코드포스! (Happy new year, Codeforces!)
Welcome to the first Codeforces Round of the new decade, Hello 2020! The round will be held on Jan/04/2020 15:05 MSK.
Some information about the round:
This round is prepared by ko_osaga nong ckw1140. I am personally very thrilled to deliver my first Codeforces contest as such a memorable one!
More credits for the contest:
UPD: Editorial. Thank you for your participation!
UPD2: Winners:
Announcement of Hello 2020
I am happy to wish you a Happy New Year! I wish you a great, bright, interesting New Year! Just believe that it can become so: difficulties will be left behind, and ahead of you will be a joy of victories and discoveries.
I wish all of us new interesting problems, records and achievements! Set new goals and be sure to try to achieve them! And do not go far, we will try to make your 2020 year more fun!
I thank with all my heart for the contribution to the community of coordinators, problem writers, testers, and those who wrote interesting posts and comments. Many thanks to the sponsors, partners and customers: you help the community not to stand still, give the opportunity to hold interesting events. Thanks to all visitors to the website and just not indifferent.
See you in the new year!
Hello!
It seems to me that over the past few years I have been writing something right while all normal people are celebrating the New Year. It's my tradition now! Actually, most of the core functionality of Codeforces was written on the New Year holidays of 2010: authorization, blogs, basic support for competitions.
Perhaps I want to spend the next year with interest improving something in the Codeforces infrastructure (yep, how you celebrate the New Year — so you will spend it). Or maybe it's just that it's not necessary to work on New Year's and I'm doing not what you need right now, but what would be nice to do someday.
This time I took a little time to add support for parsing command line parameters in testlib. I really don't like to write such lines of code int n = atoi(argv[3]); in generators. Actually for several reasons:
Now, instead, you should write this: int n = opt<int>(3);. In addition, you can write like this int64_t m = opt<int64_t>(1); or bool t = opt<bool>(2); or even string s = opt(4);.
In addition, I supported named parameters. If there are too many parameters, then the entry g 10 20000 a true is less readable than g -n10 -m200000 -t=a -increment.
In this case, now you can use the following code snippets in your generator:
int n = opt<int>("n");
long long n = opt<long long>("m");
string t = opt("t");
bool increment = opt<bool>("increment");
You can freely mix parameter reading by index and by name.
The following options for writing named parameters are supported:
--key = value or-key = value;--key value or-key value — if value is not a start of a new parameter (does not start with a hyphen or does not follow the letter after one/two hyphens);--k12345 or-k12345 — if the key k is one letter and then a digit comes;-prop or--prop — to enable boolean properties.Below are examples of how to run several fictional generators:
g1 -n1
g2 --len=4 --s=oops
g3 -inc -shuffle -n=5
g4 --length 5 --total 21 -ord
Perhaps in a hurry, I can write something not in the best way, or even with bugs. I suggest you look at my last commits. I will be glad to suggestions or fixes.
Thanks for attention.
What traditions do you have for the New Year?
Hello again, Codeforces!
We are glad to invite you to Mathforces Thinkforces Good Bye 2019, which will take place on Dec/29/2019 17:05 (Moscow time).
Some information about the round:
All problems in this round were prepared by us, antontrygubO_o and 244mhq. We worked on this round for a long time and tried to make all the problems very interesting. We hope that you will enjoy the round!
We would like to thank:
The number of the problems and point distribution will be announced shortly before the round (or earlier).
Good luck and have fun!
UPD1: Using opportunity, we would like to advertise the match between tourist and Um_nik, which will start in half an hour after this round ends.
UPD2: The last contest of the decade on Codeforces will feature 9 problems .
Score distribution:
500 — 1000 — 1500 — 2000 — 2750 — 3250 — 3750 — 4000 — 4500
UPD3: Editorial
UPD4:
Congratulations to winners:
Announcement of Good Bye 2019
