Hello Codeforces!

Sorry for a bit delayed English announcement, we are glad to invite you all to Codeforces Round #744 (Div. 3), third division round held on Sep/28/2021 17:35 (Moscow time). This round was prepared by me and MikeMirzayanov and we hope that you'll find the problems interesting and enjoy solving them.

I would like to thank MikeMirzayanov for helping me with both writing and preparing the problems for this round. Since it's the second Div. 3 round held I'm involved in but only the first one I'm preparing problems for from zero all the way to the end, without his guidance it would've taken much more of my time.

Also special thanks to nizamoff, andreumat, QAZZY, Vladosiya, CtrlAlt, vladmart, Igorjan94, okwedook and I_Remember_Olya_ashmelev (I'll keep this list up-to-date since new testers are joining in) for testing the round and giving their feedback on the problems as well as to Gassa for proofreading and correcting the statements. This round is very noticeably better than it could've been without your contribution. And last but not least, thanks to everyone who'll be participating! This round contains 7 to 8 problems and is expected to be of decent level of difficulty for participants with ratings up to 1600. However, all of you who wish to take part and have a 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. We tried to make tests strong enough but it doesn't at all guarantee that open hacks phase will be pointless.

You will be given 7-8 problems and 2 hours 15 minutes 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 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.

Good luck and have fun!

Hello Codeforces!

CQXYM and I are glad to invite you to Codeforces Round #745 (Div. 1) and Codeforces Round #745 (Div. 2), which will be held on Sep/30/2021 13:05 (Moscow time). Note the unusual time of the round.

Each division will have 6 problems and 2 hours to solve them. All problems were written and prepared by CQXYM and me. The round will be rated for both divisions.

We would like to thank:

• Aleks5d for his excellent round coordination and many useful suggestions that greatly help with preparation.
• 1-gon, voidmax, alexX512, ijxjdjd, m371, makogon2907, chctxdy68, Hemose, Hinai_Paulette, Omkar, 4qqqq, FBKdaisuki, kassutta, Mo2men and pkpawan for testing the round and providing useful feedback.
• MikeMirzayanov for great platforms Codeforces and Polygon.
• And you, for participating!

This is our first round, and great efforts have been put into preparing this round. Were you to kindly participate in this round, we would be very grateful and hope you will enjoy it.

Good luck!

Hello, Codeforces!

Welcome to the ICPC Communication Routing Challenge powered by Huawei!

This challenge edition is very special, as it will be happening in conjunction with the ICPC World Finals! For those who are not participating in the finals — ICPC and Codeforces are offering a unique chance to compete during a 4-day Challenge Marathon and win amazing prizes from Huawei!

ICPC Challenge Marathon (open to public, unrated): October 9-13, 2021, 00:00 UTC:

This time we’re delighted to provide you with a future-oriented topic – routing algorithms for next-generation communication. During this Challenge we will provide you with a super-large inter-satellite optical network to properly plan message paths, to reduce communication latency and improve resource utilization. However, finding the optimal path in a network with limited resources is an NP-hard problem. Considering the physical constraints of optics and circuits, our algorithm faces greater technical challenges:

• How can we model and abstract device constraints and design algorithms in the most appropriate way?
• Is there an algorithm that takes almost the same time to calculate routes as the network scale increases?
• Is there any way to obtain the theoretical optimal solution in a short period for ultra-large networks?

We hope that these satellite communications challenge questions can help you understand the problems that Huawei's software algorithm researchers face every day. All the best!!!

Prizes

For 3-hours onsite ICPC World Finals Challenge Huawei will provide prizes to the winners in 2 groups of participants:

• Group 1: TOP 30 ICPC World Finalists, who participate individually:

  1st-10th place	HUAWEI MATE 40 Pro
  11th-20th place	HUAWEI MatePad Pro
  21st-30th place	HUAWEI WATCH 3 Pro

• Group 2: TOP 9 ICPC World Finals Coaches and Co-Coaches, who participate individually:

  1st-3rd place	HUAWEI MATE 40 Pro
  4th-6th place	HUAWEI MatePad Pro
  7th-9th place	HUAWEI WATCH 3 Pro

For 4 days online Challenge Marathon, Huawei will provide prizes to TOP 30 individual participants:

* The 1st place winner will get additional bonus in amount of 5000 USD. If the bonus cannot be transferred to the winner due to any reason, it may be replaced by a prize of the same value.

If the allocated Huawei Challenge prize cannot be delivered to your region for any reason it may be replaced by another prize of the same value (if no legal restrictions), at the discretion of the sponsor.

By participating in this Challenge, you agree to the Challenge Rules and Conditions of Participation

Good luck to all participants!

Hello Codeforces!

On Sep/20/2021 17:35 (Moscow time) Educational Codeforces Round 114 (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 6 or 7 problems and 2 hours to solve them.

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

Good luck to all the participants!

Congratulations to the winners:

Congratulations to the best hackers:

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

UPD: Editorial is out

Hello.

Sorry for it. Actually, right now I don't have any idea why testing is so slow now. Obviously, it doesn't work as expected. It is not because of problems. So please don't blame writers or coordinators. I'm investigating the reason, but don't see it now.

I myself am very upset and I apologize to the authors, coordinator, and participants. I will do my best to find the cause and fix it. Surprisingly, we haven't made any big changes to this part of the system lately. But something went wrong.

Mike.

UPD: https://codeforces.com/blog/entry/95081#comment-841873

Hello Codeforces!

Asymmetry and I are glad to invite you to Codeforces Round #743 (Div. 1) and Codeforces Round #743 (Div. 2), which will be held on Sep/18/2021 17:35 (Moscow time).

Each division will have 6 problems and 2 hours to solve them. All problems were written and prepared by Asymmetry and me. The round will be rated for both divisions.

We would like to thank:

• 1-gon for coordinating the round and helping us with the problems.
• mnbvmar, gamegame, dorijanlendvaj, tnowak, Jasiekstrz, ijxjdjd, shxgun, lcaonmst, -_-INV4D3R-_-, ToxicPie9, Shinchan01 and Krzaq for testing the round and providing useful feedback.
• ToxicPie9 for being a VIP tester.
• finally, MikeMirzayanov for great platforms Codeforces and Polygon!

We've put great efforts into preparing this round and we hope that you will enjoy it.

Good luck!

UPD: We would also like to thank Ari for testing the round and KAN for translating the statements into Russian.

UPD2: Here are the scoring distributions:

Div. 1: $$$500$$$ — $$$1250$$$ — $$$1750$$$ — $$$2500$$$ — $$$2500$$$ — $$$3250$$$

Div. 2: $$$500$$$ — $$$1000$$$ — $$$1500$$$ — $$$2250$$$ — $$$2750$$$ — $$$3500$$$

UPD3: We are sorry that the round became unrated due to the long queue. We hope that you enjoyed the problems anyway.

Winners

Congratulations to the winners!

Div1.

1. tourist

2. Benq

3. peehs_moorhsum

4. ecnerwala

5. Molewus

Div2.

1. ChenRui

2. rainboy

3. OguriCap

4. _October

5. Dallby

UPD4: Editorial is out!

Hello, Codeforces!

On Sep/12/2021 17:35 (Moscow time) we will host Codeforces Global Round 16.

It is the fourth round of a 2021 series of Codeforces Global Rounds. The rounds are open and rated for everybody.

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 2021:

• 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.

Thanks to XTX, which in 2021 supported the global rounds initiative!

The problems were written and prepared by shishin and Artyom123.

We would like to thank these people:

• isaf27, the one who did a lot of things for the round to happen
• Shinchan01, Absyarka, Ziware, ijxjdjd, m371, Kotehok3, 221,physics0523, Igorbunov, kpw29, Kirill22, 1-gon, pashka for testing
• Kirill22 for submitting many different solutions
• 1-gon for being a VIP tester and his hilarious greetings in russian
• kpw29 for spending much time discussing the problems with me
• physics0523 for making researches about the tasks (as he always does)
• MikeMirzayanov for Codeforces and Polygon platforms and for his immeasurable contribution to the development of the community!

You will have 2.5 hours to solve 8 problems. As always, we highly recommend reading all problems. Moreover, we really hope you upsolve the problems after the round, there are some interesting things to find out!

One of these problems is interactive, please see the guide of interactive problems if you are not familiar with it.

Score Distribution:

500 — 750 — 1000 — (750 + 1000) — 2000 — 2500 — 3000 — 3750

Editorial:

The editorial

Winners

System testing finished, congrats to the winners!

1. Radewoosh
2. tourist
3. QAQAutoMaton
4. jiangly
5. ksun48
6. Alice_foo_foo
7. He_Ren
8. Benq
9. tatyam
10. hitonanode

Hello Codeforces!

On Sep/08/2021 17:35 (Moscow time) Educational Codeforces Round 113 (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 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by 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!

Congratulations to the winners:

69 ^nice successful hacks and 304 unsuccessful hacks were made in total!

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

UPD: Editorial is out

Hello Codeforces!

I am in the process of making improvements and updates to the judgment machines. I've read the post https://codeforces.com/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.