# | User | Rating |
---|---|---|
1 | Benq | 3783 |
2 | jiangly | 3710 |
3 | tourist | 3662 |
4 | Um_nik | 3526 |
5 | ko_osaga | 3500 |
6 | maroonrk | 3488 |
7 | ecnerwala | 3478 |
8 | inaFSTream | 3477 |
9 | fantasy | 3470 |
10 | QAQAutoMaton | 3428 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | adamant | 177 |
2 | awoo | 177 |
4 | nor | 169 |
5 | maroonrk | 165 |
6 | -is-this-fft- | 163 |
7 | antontrygubO_o | 155 |
8 | ko_osaga | 151 |
8 | dario2994 | 151 |
10 | SecondThread | 149 |
Hi all!
This weekend, at Nov/14/2021 09:05 (Moscow time) we will hold Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) and Codeforces Round 755 (Div. 2, based on Technocup 2022 Elimination Round 2). They are based on problems of Technocup 2022 Elimination Round 2 that will be held at the same time.
Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at Technocup website and take part in the Elimination Round.
Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests!
Have fun!
The scoring distribution:
The round is over. Congratulations to the winners:
Technocup
Div1
Div2
Hello, Codeforces!
I'm glad to invite you to Grakn Forces 2020, which will be held on Sep/30/2020 17:35 (Moscow time). It will be combined rated round for both divisions.
This round is initiated and supported by Grakn Labs. More information you could find here.
All problems were authored and prepared by 300iq and isaf27. Thanks to coderz189, Retired_cherry, QAQAutoMaton, Prakash11, morzer, qlf9, nkamzabek, gdb_18, talibmohd, Dragnoid99, KAN and VladGanzha for testing problems and good advice. Thanks to MikeMirzayanov for great systems Codeforces and Polygon.
You will be given 9 problems and 2 hours 30 minutes to solve them. Please, read all the problems. Good luck, have fun and we wish everyone high ratings!
Thanks to Grakn Labs for the gifts to the participants:
Prizes:
Additional Prizes:
Top 50 receive:
Grakn Labs swag pack:
Random 50 from 51-250 receive:
Grakn Labs swag pack:
Grakn Labs is a team of people driven by a purpose: to solve the world's most complex problems, through knowledge engineering. They are the inventors of the Grakn knowledge graph and the Graql query language. Their technology helps organizations in various industries, including Life Sciences, Defence & Security, Financial Services, and Robotics, to build intelligent systems that will change the world.
Grakn Labs looking for the best to round out their team, if you think this sounds like an interesting chance to work on an innovative technology; they'd love to hear from you.
UPD! Scoring distribution: 500 — 1000 — 1250 — 2000 — 2500 — 2500 — 3000 — 3750 — 3750
UPD! Editorial
Congratulations to winners:
Hello Codeforces.
I'm writing this post to make comments about a situation on the last Codeforces Round and tell the bad news. We did many mistakes and due to them, the round caused much dissatisfaction from the Codeforces community.
Some of our mistakes:
Some stupid mistakes in the statements.
In the problem D2E/D1C the numbers $$$d_i$$$ were not necessarily sorted, but there were no pretests for that.
The checker of the problem D2F/D1D didn't check one of the requirements and due to that $$$8$$$ solutions failed on pretests during the system testing.
After the editorial was posted the mistake was found in the main solution of the problem D1E (more details here). Now we don't know the correct solution.
So, the round was very unsuccessful, I'm very sorry about this. I will make conclusions and will try to avoid such situations later. Please, treat with respect to the authors, even in such a bad situation, a big work was done and I hope you enjoyed the problems.
Now about the bad news: due to the wrong checker and the wrong solution, we decided to make Div1 round unrated, Div2 round is still rated, Sorry for all, who had a big positive rating change.
Also, we are making a D1E problem-solving challenge: if you have an algorithm, that can be proven, please share your approach.
So, that was all news, sorry again,
Ivan.
P.S.
If you are angry now, you can use this post to set a dislike, please don't dislike an announcement/editorial.
The problems A, C, D, G are authored and prepared by isaf27.
The problems B, E, F are authored and prepared by 300iq.
Jury solution: link
Jury solution: link
Jury solution: link
Jury solution: link
Jury solution: link
Jury solution: link
Jury solution: link
Let's discuss your ideas and solutions in the comments. Thanks for your participation!
Jury solution: 54047380
Hello, Codeforces!
I'm glad to invite you to Codeforces Round 559 (Div. 1) and Codeforces Round 559 (Div. 2), which will be held on May/12/2019 17:35 (Moscow time). The round will be rated for both divisions (I hope).
All problems were written and prepared by me. Thanks to Aleks5d, TLE, sunset, Sulfox, peltorator for testing problems and good advice, 300iq for round coordination and help with preparation and MikeMirzayanov for great systems Codeforces and Polygon.
You will be given 6 problems in both divisions and 2 hours to solve them. Please, read all the problems. Good luck, have fun and I wish everyone high ratings!
The scoring distribution will be announced closer to the beginning of the round.
UPD
The contest finished, contgratulations to the winners:
Div1:
Div2:
Hello everyone!
I would like to invite you to participate in HackerEarth December Circuits '18. It's a long contest that will start on December 21, 21:00 IST (check your timezone). The contest will run for 9 days.
The participants will be challenged with 7 traditional algorithmic tasks of varying difficulty levels and 1 approximate problem for a duration of 9 days. For traditional algorithmic tasks, you will receive points for every test case your solution passes — so you can get some points with partial solutions as well. For the approximation task, your score depends on the best solution in the contest so far. Here is the detailed timeline of the challenge,
As usual, there will be some nice prizes for the top five competitors:
I am the tester of all the problems. I'd like to thank the problem setters Sanjay Gidwani (sanjaygidwani), Mohd Salik (abx_2109), Orap Andrew (Dalgerok), Saurabh Joshi (Apptica) and Anand Jaisingh (MazzForces).
The contest will be RATED.
Happy Coding :)
Problems A-G have been created by isaf27. The idea of the problem A has been offered by peltorator.
The problem H has been created by cdkrot.
Jury's solution: 44522356
Solution by Endagorion: 44519413 (maximal spanning tree)
Hi all!
I'm happy to welcome you at the Div.1 and Div.2 shared rated round Mail.Ru Cup 2018 Round 1, it will start at Oct/18/2018 19:35 (Moscow time). The problems were prepared by me — Ivan Safonov. I'd like to thank Dmitry cdkrot Sayutin for an idea and preparation of one of the problems and Egor peltorator Gorbachev for an idea for another one.
This round is the first round if the new championship called Mail.Ru Cup, you can learn more about it following the link. The round will be rated for everybody!
The championship feature the following prizes:
In each round, top 100 participants get prize points according to the table. The championship's result of a participant is the sum of the two largest results he gets on the three rounds.
Huge thanks to Grigory vintage_Vlad_Makeev Reznikov and Ilya izban Zban for testing the problems, to Nikolay KAN Kalinin and Ildar 300iq Gainullin for their help in preparation, and to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon platforms.
The round will feature eight problems to solve in two and a half hours. The scoring will be announced closer to the beginning of the round.
I hope everyone will find some problems interesting. I wish everybody a successful round and a positive rating change!
Good luck!
UPD1,Scoring distribution:
500 750 1250 1500 2000 2250 3000 4000
Congratulations to the winners of Round 1!
UPD2
Hello CodeForces Community! Once again we bring to you a fresh set of programming challenges with the June Lunchtime 2018, a three-hour contest of your coding abilities. Hope to see you all join us and challenge for the top spot!. Joining me this time on the problem setting panel are:
Time: 30th June 2018 (1930 hrs) to 30th June 2018 (2230 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone
Contest link: https://www.codechef.com/LTIME61 Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate. Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://discuss.codechef.com/questions/51999/how-do-i-win-a-codechef-goodie
(For those who have not yet got their previous winning, please send an email to [email protected]) Good Luck!
Hope to see you participating!!
Happy Programming!!
Name |
---|