Hello Codeforces!

I am in the process of making improvements and updates to the judgment machines. I've read the post https://codeforces.me/blog/entry/94587 and I think, maybe it is a good idea to make such a compilation line -O3 -funroll-loops -march=native -mtune=native? I haven't done any research that it is definitely better than -O2 and it is best in the general case for CP solutions. In a way, this will only strengthen the gap from Python/PyPy/Java, on the other hand: in pragmas and so you can set up everything. What do you think? What are suggestions to the command line?

P.S. You got it right. Yes, gcc11 std=c++20, pypy3 64-bit and more are coming.

Hello, Codeforces.

We want to run a series of load testing in the production environment for running contests. For this reason, Codeforces Round 739 will be temporarily extended (in order to test it at the current round). We will temporarily disable the ability to send solutions to it so that its extended duration will not affect the results. After the completion of the work, the duration of the round will be returned.

Our current plan is to finish today.

Mike

Hey!

As I don't see the post discussing the round, I decided to write this.

I do not participate much in contests now. But I love Code Jam. Thanks to problem writers and organizers!

It seemed to me that this round was no more difficult than the previous one. How do you like it?

I liked the problems:

• A (tags: interactive, constructive): strange problem — the most naive approach fits into the requirements on the total cost of requests;
• B (tags: number theory, dp): I wrote some kind of DP with memorization of $$$(a, s)$$$, where $$$a$$$ is the last element in the sequence we already placed (I build in increasing order) and $$$s$$$ is the total sum for the future elements. I don't have a proof why it works fast, probably because of the number of divisors is small.
• C (tags: combinatorics, recurrence): the last occurrence of 1 is the position of $$$n$$$, so we can divide sequence with this position on two parts and use DP to calculate the answer (don't forget to multiply on binomial coefficient);
• D (tags: graphs, flows, greedy): I used min-cost-flow to match Ms on the first field and the second in optimal way. I tried all possible values of flow to iterate over all possible pairs of Ms I want to match and took best cost among all choices.

Hi Codeforces!

Yes, I know it's already April. Time flies so fast lately! Exactly a year ago we were just learning all the "delights" of lockdown.

So let's remember this 2020! What was it like? I don't know about you, but we had a hell of a lot of work.

I will now show you some graphs and you will be very surprised. Lockdown effect? Of course, but we did our best too.

Many thanks to everyone who did not stand aside! In 2020, we celebrated our 10th anniversary and crowdfunding money helps us grow and move forward. You helped us and each other. Thank you. Thank you for your contribution!

We've been working hard all year to make this community a better place. Did it work out? It's up to you to judge. Many thanks to everyone who invested time and effort:

• geranazavr555, kuviman, cannor147 helped a lot with development and new features;
• Una_Shem provided great organizational assistance;
• our problem coordinators are the greatest: KAN, antontrygubO_o, isaf27, 300iq, significant assistance was provided by BledDest, adedalic and budalnik, vovuh for preparing Div3 rounds;
• stingray advised and helped set up the network;
• our friends from VK for their help in our infrastructure;
• and help of problem writers and testers is immortal!

Time to take stock of 2020.

Partner Events

We are pleased to hold programming competitions with companies or for companies. I'm sure this is a great way to support the community of young programmers and hire talented candidates. Here is a list of our main partners this year:

• Telegram and personally Pavel Durov is supporting Codeforces activities for many years, every regular round is held with their help, thank you!
• ICPC — in 2020 we held several joint events (and we liked it!), I hope there will be more
• Mail.Ru — Technocup and Russian AI Cup
• VK, VK Cup — now a personal multi-track competition for Russian-speaking programmers
• XTX Markets, Codeforces Global Rounds — a series of 6 rounds with a separate scoring and souvenirs for the best participants
• Harbour.Space University — a series of educational rounds, the selection of summer school Tech Scouts
• JetBrains, Kotlin Heroes Rounds — Kotlin programming language contests
• Huawei — research competitions (marathons) with elements of machine learning
• Raiffeisenbank — round for both divisions with cool prizes
• Grakn Labs — round for both divisions with money prizes
• Microsoft, Microsoft Q # Coding Contest — unusual quantum computing competition

Hello, Codeforces!

I understand that 2021 has been going on for a long time, but here I have picked up a subset of some of the improvements that the Codeforces team made in 2020. Soon I will publish numbers (no, charts) with statistics for 2020. In the meantime, I bring to your attention a list of changes and improvements.

By the way, this is a decent list. This is about half to a quarter of all changes. It's just that other changes are more often somewhere in the internals of the system and are not visible to users. Please read this list. Each item is the effort of someone from the team. Thanks to geranazavr555, kuviman and cannor147 for their efforts. You've made our platform better! Well, by the way, I don't quit programming and many improvements were made by me.

The items on the list are written in a concise and informal form, many of the items I just copied from commit messages from git. If you want more details — ask in the comments, we will tell you! Of course, I forgot to include some improvements in the list.

Hello Codeforces!

This unusual and difficult 2020 has come to an end! What will the new year be like? I wish all of us that we have the opportunity to meet in person so that the contests take place not only online. I ask you to think of something important and good. Let this wish come true!

We have had a large number of rounds this year. I hope we have pleased you with interesting problems. Thanks to the round coordinators and writers! You make our community richer. Please make us happy in 2021!

I wish the participants victories over yourself (and over problems!) and development of your skills, interest and curiosity!

Hello, 2021!

And we have traditional gifts!

Change Handle Feature

Hurry! Only until the 10th of January, you can change your handle (but only once)! Note that it will be possible to roll back the changes or change the handle again only after a year. Be careful what you wish for.

You can change your handle to the new one which wasn't used before by anybody or which was used by you before. The links to a profile page with an old handle would automatically redirect to the actual profile.

Again, this year if you took part in at least 10 rounds you can request a handle of an inactive participant. It means that the participant should have a period of activity on Codeforces of at most 180 days, this period should be in 2017 or earlier. The inactive participant can't have posted comments, messages and so on. It can't take part in more than 2 contests. It will be automatically renamed and informed by email. A user has the opportunity to request back his/her handle: in this case, we will roll back the change and return your previous handle to you. If you can't change your handle to another, it means that some requirement doesn't meet. Please do not ask me to do something with it. Especially, I do not like requests like "this is my second account, I took an interesting handle myself". I'm not Santa Claus.

Talking about handles I always
reminisce the following story. Once a user wrote me the message: "Please change my handle from I_love_Valya to I_love_Sveta, as I no longer love Valya ..."

New Year's Masquerade of Colors and Ranks

The traditional magical tab has appeared in the profile setting. Happy New Year!

— MikeMirzayanov

You can view PDF version of the tutorial by the link.

Hello!

ICPC Southern and Volga Russian Regional Contest (Northern Eurasia) 2020 has ended on November 15. This year the competition took place online. 108 teams competed, many of them received an invitation based on the results in Qualification Contest.

On Dec/25/2020 14:35 (Moscow time) will start online-mirror 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules).

Hope you enjoy the problems. In this contest I play a role of Cheif Judge and the jury teams consists of ex-participants of ICPC from Saratov and jury members from other cities: adedalic, ashmelev, BledDest, DmitryKlenov, DStepanenko, elena, KAN, kuviman, MikeMirzayanov, pashka, PavelKunyavskiy, Дмитрий Мещеряков, Герман Наркайтис. Many thanks to all of them!

I send special rays of gratitude to testers: Merkurev, Um_nik, romanasa, josdas, budalnik, Perforator, Oleg_Smirnov, IlyaLos, Supermagzzz, Stepavly, Igor_Kudryashov, HolkinPV, Edvard, le.mur!

I invite ICPC teams and individual participants of Codeforces competitions to take part!

Of course, the competition will be unrated. I ask the participants of the official competition to refrain from participating in the mirror and discussing problems until its end.

Since this year the audience of participants was wider (due to the online format), we also selected problems a little more accessible than in previous years. If you are from the top team that claims a medal in the ICPC Finals, then it may be more fun for you to take part in this contest personally.

Good luck!

In 2020, with the support of XTX Markets, 6 rounds of the Codeforces Global Rounds were held. Each round was common for both divisions. All such rounds were rated for all participants. At each such round, 50 brand T-shirts were handed out, and we gave T-shirts to all problem writers!

I say a big thank you to XTX Markets (and personally to Yuri Bedny and Alexander Gerko) for supporting Global Rounds. Without your help, we could not host them! I sincerely admire companies like these who come to support and develop the community that some of their employees come from. It will be great if other companies follow the example and also offer their help. We need it!

The prizes for the 6-round series in 2020:

• In each round, top-100 participants get points according to the table.
• The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
• The best 20 participants over all series get sweatshirts and place certificates.

Final results (and congratulations!):

Hello Codeforces!

There is something new for you. It seems that now it will be easier to reuse problems from the archive for educational and other purposes.

As you know, problems from past Codeforces rounds can be added to mashups simply by their codes of the form like 1234D (contest ID + problem letter). I myself regularly used this when I taught at Saratov University — it was very convenient to prepare trainings: problems have expected complexity and topics, there are Russian and English statements, you can see the analysis and many solutions. Because of hacks and uphacks, problems in the archive usually have strong tests. Almost all of them are well-prepared. In addition, with the help of user lists, you can easily pick up problems for a group of students that they did not solve.

But there was also an issue: the problems in such trainings were easily googled. And if the majority of adult participants could cope with the temptation to spy on the solution or tests, then beginners sometimes acted dishonestly. I received several requests to come up with something with this flaw. One of the most recent such requests was from Daniel Darooha Sleator (https://en.wikipedia.org/wiki/Daniel_Sleator). Thanks, Danny!

So the work seems to be complete. Meet a new feature on Codeforces: now you can rewrite statements for problems in mashups, completely replacing it with your own. More details about the capabilities of the new functionality:

• a new icon-link appears in the problem list in mashups, by clicking on which there will be a form for creating/editing a new statement;
• you can use the original text of the statement as a template when writing your own: be very careful — you must exactly repeat all the details of a statement so that problems do not formally differ;
• this form compares the set of formulas in the original text and the new statement, and if they differ as sets, there will be a corresponding detailed warning;
• you can specify your own tests from a statement (examples) — here you also need to be very careful so that they are formally correct;
• if you added examples, then solutions will be judged on them first, and only after on official tests;
• you can upload your own image files and use them in statements;
• there is a setting to temporarily disable the use of the new statement (for example, if it is still under development).

Considering that there are already more than 6500 problems in the archive, an excellent perspective opens up for organizing trainings and educational sessions.

I hope this innovation will be useful. Write in the comments what can be improved and/or corrected.

M.

During the round Grakn Forces 2020 many of you can notice that now we highlight diff in statements if they changed. Do you like this new feature?

Also, I'm thinking on the way to automatically notify participants if statements changed. I still do not fully understand how this should ideally be implemented. Sometimes it is true that just a forgotten comma was added. On the other hand, it is almost always better to notify of changes. What do you think?

In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.

The prizes for the 6-round series in 2020:

• In each round top-100 participants get points according to the table.
• The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
• The best 20 participants over all series get sweatshirts and place certificates.

Current standings after four rounds (sorted by total points in four rounds):

Hello!

This is just a small announcement of the latest updates in EDU. New features:

• Now you can view other's solutions if you have solved the problem yourself. I think this can be very useful. When I I was a contest participant, I always looked as others who are more experienced than me wrote this or that code. Often found something interesting and useful.

• Now you can view tests for problems in the format, as it is done in the archive in the main section of the website.

• Now you can hack other people's solutions if you have solved the problem yourself. And fun and will improve tests of these problems.

More about EDU section you can read in this post.

And what are your wishes for functionality? I remember about filtering the results of practice by friends.

UPD: And for all practice contests I have set a policy of "use time limits scaling policy". This is a recent innovation — you can use it for educational contests, the system will automatically increase the time limit for some languages. Recommended for use only in educational contests.

Hello.

Last days I did many improvements in EDU. I afraid it can affect the contest interface. So I invite you to take part in [contest:1390], just to test the system. Please, try to hacks: there were some changes in them. Please, don't expect new or interesting problems. It is just a test. Unrated.

The problems contain extremely weak pretests. Time limits are too tight. I made my best to increase number of hacks :-)

Thanks, Mike.

UPD: Thanks! It seems no bugs have been found.

Hello.

Unfortunately, the Educational Codeforces Round 91 round will be unrated and, actually, it was completely ruined. I don’t understand what happened yet. At some point in time, all systems began to work unstably and actually stopped working. So far I have no understanding what happened. You may have to change the schedule for future rounds. Sorry. We have such a black stripe. Very upset and demotivated.

Mike.

In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.

The prizes for the 6-round series in 2020:

• In each round top-100 participants get points according to the table.
• The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
• The best 20 participants over all series get sweatshirts and place certificates.

Current standings after three rounds (sorted by total points in three rounds):

Hello Codeforces!

In February, in the Russian-language interface, we announced a new educational subsection of the website. It's time to go international!

I am pleased to invite you to test the new section, which so far has the working title EDU. I hope that someday EDU will become a real educational hub for fans of programming competitions. It will be great to have in one place the collected educational content with text and video materials, with selected thematic problems.

At the moment, its functionality is still under development, and here is the current progress and β-testing preview. Write your comments and suggestions in the comments here.

So far, only a pilot course with the first lesson "Suffix Array" has been presented to your attention. The plans include expanding both the functionality of the section and filling it with new content.

Russian version already contains more lessons. At the moment, it is important for us to get the first feedback from international users. Many thanks to Pavel Mavrin (pashka) for preparing the first English lesson. Please support pashka to motivate him to translate more lessons!

I hope that in the future, using the materials in this section, you will be able to gain knowledge on an extensive set of topics that are used in contests and olympiads. According to the current plan, a group of ITMO lecturers and students will be engaged in a pilot course, a little later we will consider the possibility of opening the possibility of creating classes for a wider audience.

Thanks to ITMO University for the idea and support for the implementation of this initiative!

Hello!

Together with colleagues Schaffhausen Institute of Technology we hold such an event. If you want to study in Switzerland, then perhaps this is your chance!

— Mike

Hello, Codeforces!

We are thrilled to announce a new SIT STAR Contest by the Schaffhausen Institute of Technology in Switzerland. The winners will have a chance to get a fully-funded Master’s scholarship in Computer Science and Software Engineering.

What is the SIT STAR Contest?

The goal of the SIT STAR Contest is to promote interest in the field of Computer Science and Software Engineering, give students an opportunity to demonstrate their knowledge of programming, and be considered for a fully-funded graduate scholarship. You can apply to the contest here!

The SIT STAR Contest consists of:

1. June 1-7, 2020 | Practice: To familiarize yourself with the testing environment, you will first be granted access to a practice round. You can practice any time from 1st to 7th June 2020. This is an optional step but we highly recommend to take part in it. The results of this round won’t affect the final score.
2. June 17, 2020 | SIT STAR Contest: The final round will take place on 17th June. The participants will be given 4 hours to complete it.
3. June — July, 2020 | Interviews and Winners announcement: Top participants with the highest scores will be invited for the interviews with the professors from the Schaffhausen Institute of Technology.

The SIT STAR Contest will include 8-12 problems of various levels of difficulty in algorithmic programming.

Hello, Codeforces!

I carefully read most of the ideas that are written in the comments and posts. I have no way to answer everything. Otherwise, I would only do what I answered. Excuse me. There are many good ideas, some easier to implement, some more difficult.

The following idea seems vivid to me. Idea is to limit the maximum rating increase for rounds where there is already an upper rating limit at registration. For example, if the upper limit is $$$u$$$, then your rating after participating in the round cannot be higher than $$$u+100$$$ even with a very successful performance. For example, after winning in Div.3 round the rating can't be more than $$$1699$$$.

It is easy to implement, it does not entail a significant redistribution of ratings. It seems I like it. What do you think about it?

Actually, probably a good idea is to make a bottom cap for rating changes: in any case of any (even the worst) performance, the rating shall not fall by more than $$$100$$$. Еverything happens during the rounds — there may be technical difficulties, force majeure, or just catastrophic bad luck. What are your thoughts about it?

— Mike

Hello everyone.

In the coming days I will finish the implementation of small changes in the rating calculation for new accounts. Here are the main innovations.

• The rating of the new account will be equal to $$$0$$$ for display (but it will be equal to $$$1400$$$ when calculating rating changes).
• Suppose, after the first round, the participant gained $$$d_1$$$ rating points (remember that the rating was considered equal to $$$1400$$$ in such calculations), then in the rating display after this round $$$500+d_1$$$ will be displayed. Thus, after the first participation, the rating is likely to increase from $$$0$$$ to a value in the region of $$$500$$$ (plus or minus $$$300$$$ approximately).
• Thus, before the second participation, the displayed rating is $$$500+d_1$$$, and the rating for calculating changes is $$$1400+d_1$$$. Suppose a new change is $$$d_2$$$, then the displayed rating becomes $$$500+d_1+350+d_2$$$.
• Thus, before the third participation, the displayed rating is $$$500+d_1+350+d_2$$$, and the rating for calculating changes is $$$1400+d_1+d_2$$$. Suppose a new change is $$$d_3$$$, then the displayed rating becomes $$$500+d_1+350+d_2+250+d_3$$$.
• And so on the first $$$6$$$ rounds. Promotions of the displayed rating will be equal to $$$500, 350, 250, 150, 100, 50$$$ (in total exactly $$$1400$$$). Therefore, after participating in $$$6$$$ rounds, the rating is “stabilized” and the displayed rating will be equal to the one used to recalculate the changes.

Thus, on average, for new accounts at an early stage, the rating will increase, getting closer to the real value. These innovations will help solve several issues:

• We are reducing the starting rating from $$$1500 $$$ to $$$ 1400$$$, so that new accounts make a smaller contribution to the overall rating.
• Currently, especially for inexperienced participants, there is an effect that their rating at the beginning of participation is constantly falling (from $$$1500$$$ to the value that is a true assessment of their skills). This, of course, leads to discomfort: you try, participate, solve some problems, but the rating drops.
• The previous paragraph gives additional motivation to create new accounts. If your current rating is less than $$$1500$$$, then there is a temptation to start from scratch with a fresh account. After the changes, such a start will require a noticeable long-term effort to climb at least your current rating. It seems that the changes should slightly reduce the motivation to create new accounts.

Apparently, a similar idea is used on AtCoder, but I don't know the details.

What do you think about such improvement? Sounds good?

I almost copied my previous blog post to separate two discussions: about Div. 4 in general and about Round 640. Please, visit this blog post to discuss Div. 4 rounds.

Hello Codeforces!

Yes, it is not a mistake I decided to run the first Div. 4 round: Codeforces Round 640 (Div. 4)! It starts on May/09/2020 17:35 (Moscow time).

The format of the event will be identical to Div. 3 rounds:

• 5-8 tasks;
• ICPC rules with a penalty of 10 minutes for an incorrect submission;
• 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
• after the end of the open hacking phase, all solutions will be tested on the updated set of tests and the ratings recalculated
• by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are unrated participant/newcomer).

I urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism, but simply to take part unofficially. Please do not spoil the contest to the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating with unsporting behavior. To qualify as a trusted participants of the fourth division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1600 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Please, read some of my thoughts about the problems of this round:

• Don't expect A+B level problems :-) It is a real contest with easy but problems. I hope most problems fit in range D3A-D3D problems.
• I'm not sure about order of problems. Try to read all problems or at least most of them. Testers expressed skepticism about the order of the problems but suggested different pairs of problems to swap.

We are just starting, so the complexity of the problems may deviate somewhere from your or my expectations. Wait and see.

The first "thank you" is sent to antontrygubO_o, who helped with the review and selection of problems.

Many thanks to the testers: pashka, 300iq, vovuh, Golovanov399, spookywooky, kocko, Sho, igor_kz, Sho, scott_wu, bfs.07.

I hope you enjoy the problems, and the round will be interesting!

Please, leave in comments your thoughts about exactly this round. If you want to write something about the general idea of Div. 4, then visit this blog post.

UPD: Editorial is published!

Hello Codeforces!

Initially, here was an announcement of the first round for the fourth division. But currently, in comments there is the huge discussion of division 4 rounds in general. Honestly, I read all (almost all) comments.

I decided to replace the text of this post to match the comments better. Also, I'll write one more post separately to discuss problems. And this post will be about division 4 rounds in general.

About Div4 rounds:

• I'm not afraid of a queue or servers overload: it is technical challenges and my task is to resolve them. The previous biggest rounds were not overshadowed by technical problems and judging delays, they went well. I see no reasons why something should work much worse in the rounds for Div. 4 (and if it does, then this should be fixed).

• I don't think that Div. 3 rounds are too dificult. Actually, they are quite good for beginners. They are noticeably easier than Div. 2. Almost every round trusted participants solve all problems, many participants solve all without one problem. I think in general they are OK.

• Now I don't like the idea to run in parallel Div. 3 and Div. 4 rounds (like we do for Div. 1 and Div. 2). Div. 3 rounds are harder to prepare and I don't think we can host them more than once per ~2 weeks. It means that such rounds will not give new contests for newcomers and grays/greens (I think Div. 3 are already interesting rounds for them to take part). But separate Div. 4 rounds will be easier to prepare (even than Div. 3) and probably making them we can offer more contests for low rated participants.

• I'd like to repeat: Div. 3 and Div. 4 rounds doesn't affect the rate of Div. 1 and Div. 2 rounds. The coordinators focus only on Div. 1 and Div. 2 rounds. All Div3 (and future, if any, Div4) rounds are prepared without any help from the coordinators.

• I do not think that by hosting Div. 4 rounds, we will lower the quality of problems. Now, I don't plan to use absolutely A+B level problems even for the Div. 4. I think problems of level like Div3A-Div3D are good candidates.

Thanks for your attention to this idea!