Hey!

On Oct/16/2019 17:35 (Moscow time) we will host Codeforces Global Round 5.

It is the fifth round of a new series of Codeforces Global Rounds supported by XTX Markets. The rounds are open for everybody, the rating will be updated for everybody.

The round will last for 2 hours 30 minutes, 8 problems are waiting for you, and one of them will be proposed in two versions.

Scoring distribution: 500 — 750 — (750 + 750) — 2000 — 2500 — 3000 — 3750 — 4000

The prizes for this round:

• 30 best participants get a t-shirt.
• 20 t-shirts are randomly distributed among those with ranks between 31 and 500, inclusive.

The prizes for the 6-round series in 2019:

• 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 the whole series get sweatshirts and place certificates.

The problems of this round were developed by me, and here is the list of people who can't take part in the round as they know the problems beforehand:

KAN, Endagorion, arsijo, Rox, lperovskaya, Aleks5d, Learner99, MikeMirzayanov.

Coincidentally, this is also the list of people I'm thankful to for making this round what it is.

The round will be perfectly balanced. As all things should be.

Welcome!

UPD: The round is over! Editorial is here. Congratulations to the winners:

1. Radewoosh
2. Petr
3. 300iq
4. ecnerwala
5. RomaWhite

Hello, Codeforces!

I'd like to invite you to Codeforces Round #592 (Div. 2). It'll be held on Sunday, October 13 at 12:05 MSK. Note that round starts in the unusual time!

The round will be rated for the participants with rating lower than 2100. The statements will be available in Russian and English.

This round is held on the tasks of the regional stage All-Russian Team Olympiad of Informatics 2019/2020 year in city Saratov. The problems were prepared by Ivan BledDest Androsov, Vladimir vovuh Petrov and me.

Great thanks to Ivan isaf27 Safonov for helping in preparing the contest, to Mike MikeMirzayanov Mirzayanov for the great Codeforces and Polygon platform and to Ivan CaseRuten Khudoshin, Ivan Ivan19981305 Georgiev, Leonid Peinot Mironov, Anton anon20016 Lebedev, Ksenia Pavlova Pavlova and Dmitriy dmitrii.krasnihin Krasnihin for writing solutions.

You will be given seven problems and two hours to solve them. The scoring distribution will be published soon. Good luck everyone!

UPD The scoring distribution 500-1000-1500-1750-2500-2500-3000

UPD Editorial

Hi Codeforces!

Unfortunately, ill-wishers thwarted the round by making DDOS on our infrastructure. Neither the coordinator nor the writers of the round are subjects to blame for the failure. Please do not downvote the announcement of the round. I think that this situation is an additional reason to support the writers. They worked hard and prepared good problems!

Apparently, such an attack should be regarded as a symptom of the fact that Codeforces outgrew the youth phase and entered serious adult life. Of course, we will respond with adequate measures to protect ourselves from such incidents. Fortunately, for almost 10 years of work, a large community has formed around those who care about Codeforces. We are not worried about possible additional expenses or efforts. We can do this. The rounds must go on.

— MikeMirzayanov

UPD 1: All three of today's rounds will be unrated.

UPD 2: Hooray! Today we've survived another DDOS attack. The round was not perfect, but it was not ruined!

Hello Codeforces!

On Oct/08/2019 17:35 (Moscow time) Educational Codeforces Round 74 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Hello Codeforces,

First of all, thank you for the great feedback on our survey from the last Educational Round. Over 300 people participated, and we hope to start implementing some of your suggestions really soon.

We also wanted to let you know that we have extended the deadline for our fully-funded scholarships for Masters programs in Bangkok.

Remember, they cover the entire tuition fee as well as the cost of living expenses, so If you or someone you know are interested in technology, entrepreneurship, or design, and believe you have what it takes, we want to hear from you!

Last, but not least, we would like to recommend an article published in our blog last week about the “Top 5 Soft Skills Every Developer Has to Have”. What do you think, do you agree with this list?

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem:

UPD: Editorial is out

Hi all!

This weekend, on Oct/06/2019 18:05 (Moscow time) we will hold Codeforces Round 591. It is based on problems of Technocup 2020 Elimination Round 1 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 2020 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!

The Elimination Round authors are BledDest, MikeMirzayanov, Neon, awoo, Roms, adedalic and me. This round would also be not possible without the help of our testers: KAN, chemthan, gisp_zjz, Kallaseldor, Jeffrey, danya.smelskiy, Juve45, thank you so much!

Have fun!

UPD.

Unfortunately, the round is unrated.

Tutorial.

UPD: Special thanks to Mikhail awoo Piklyaev for help with translation and problems discussing, Maksim Neon Mescheryakov for problems discussing, Artem Rox Plotkin, Daria nooinenoojno Stepanova and Tommy STommydx Li for testing the round!

UPD2: Editorial is published!

<almost-copy-pasted-part>

Hello! Codeforces Round 590 (Div. 3) will start at Oct/01/2019 17:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third 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 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</almost-copy-pasted-part>

Dear Friends!

If you dream of realizing your ideas in new technologies and products used by a third part of the world's population — join Honorcup Marathon. It will be an unrated round for individual participation, as well as for teams of up to three people.

You will develop a quite challenging task without exact solution. Your solution with show up your programming skills, research and data analysis abilities.

At stake: we have Huawei devices for the top 3 winners, as well as 10,000 USD for top 1.

And, of course, TOP 80 participants will get a hoodie with Huawei Codecraft logo! During registration don’t forget to mention your size and home address for delivery. Well performed participants will be invited to get highly paid 3 months contracts in Moscow, St. Petersburg, Nizhny Novgorod, Novosibirsk, Minsk or in China (including transportation & accommodation expenses covered).

We accept solutions before October 14th, 20.59.59, (Moscow time).

We will ask winners to provide the source code and description of the solution; the details can be discussed in a phone call. In case of reasonable doubt about the violation of the rules, we reserve the right to transfer the prize to the next participant. Thank you for understanding!

Don’t miss your chance. Good luck to all!

Hi folks,

The problem set from 2019 Fall Waterloo Local Contest that was held this Sunday will be available in the gym today in roughly 8 hours (timedate link).

This is an individual contest that contains 5 problems with 3 hours to solve them. It's good for both div 2 and div 1 participants — at least 3 problems should be accessible for div 2.

Div 1 participants are especially invited to solve problem E — so far only three people solved E.

GL&HF

UPD: Registration is open

UPD: Solution sketches are available at https://www.dropbox.com/s/hs9oy0y9ep0nmmq/Solution%20Sketches.pdf?dl=0

다시 만나서 반가워요, 코드포스! (Nice to see you again, Codeforces!)

I'm again happy to introduce you to Codeforces Round #589 (Div. 2). Please look at following information for details:

• This contest will take place on Sep/29/2019 16:05 (Moscow time).
• The round will be rated for all Division 2 participants.
• There are 6 problems and you will have 2 hours to solve them. Score distribution will be announced later.

The listed handles below are contributors. Thank you for all who listed!

• Main author: McDic — I made and prepared all problems.
• Coordinator: arsijo — He is my coordinator again.
• Early phase testers: dorijanlendvaj tfg Lawali — They are early phase testers. They mostly focused on test data.
• Late phase testers: Kuroni imbr92 Redux Dr_Park Savior-of-Cross TOPCYBERFLOWER _overrated_ antontrygubO_o raiden1943 — They are late phase testers. They gave problem difficulty/quality feedback by virtual participation.
• Codeforces Team: MikeMirzayanov and his team — They are working super hard to make Codeforces and Polygon great! Especially I love Polygon's framework! Thank you!

For this contest, I tried to improve following things:

• Reasonable difficulty: At my last contest, less than 200 official participants managed to solve at least one of DEF. Especially, 1182D's problem difficulty rating is 2500 and 1182F's problem difficulty rating is 2900(no official solvers!). This is not good for Div.2 participants. In other words, my first contest was hell. So this time, I tried to make my second contest to have more reasonable difficulty than my first contest.
• Stronger data: There were 300+ successful hacks and almost 2000 sysfails at 1182B. At this time, I splitted testing phase into early phase and late phase. I'm bit worried, but I believe data will be stronger than my last contest.
• Compact statement: I remember many people complained about 1182C's super complex statement. I made very compact statements for this round. There is no problem with more than 10 lines of statement(except I/O section) in this contest.

I hope everyone can enjoy my second contest. Thanks in advance!

UPDATES:

1. If you want to discuss problems in chat after contest ends, come https://discordapp.com/invite/algorithms and you can enjoy discussion.
2. I have deleted my last problem(G) from this contest during testing period. I really wanted to include that beautiful problem in my contest, but nobody solved that problem for a week. That problem will be appeared in another Div.1 contest.
3. Scoring distribution is 500(A)-1000(B)-1250(C)-1750(D)-2250(E)-2750(F).
4. Editorial: https://codeforces.com/blog/entry/70162
5. Congratulation for winners!

WINNERS (updated):

1. PositionZero
2. supy_2
3. hitman623
4. lzqaq
5. cwise
6. LittleBeetle
7. Tsypkokokokoko
8. i_love_gnar
9. 8-_-8 (handle mentioning is not working on his handle)
10. wdk1745