Hi, Codeforces!

Vladithur and I are pleased to invite you to our Codeforces Round #769 (Div. 2), which will be held on Jan/30/2022 17:35 (Moscow time). This round will be rated for participants with rating lower than 2100.

We would like to express our great gratitude to:

• irkstepanov and KAN for not rejecting our tasks excellent coordination of the round and assistance in preparing problems.
• Ormlis, antontrygubO_o, generic_placeholder_name, Alexdat2000, Dart-Xeyter, wxhtzdy, sohsoh, zer0brain, radal, dbsic211, stevancv, maxverr, Scrubpai, Artem1303, RomkaRomantic and MaxShch for testing the round and providing useful feedback.
• MikeMirzayanov for cool platforms Codeforces and Polygon.

You will have 2 hours to solve 5 problems, one of which is divided into two subtasks.

The scoring distribution is 500 — 1000 — 1500 — 2000 — (1500 — 1500)

We have tried to make clear statements and strong pretests for the problems and hope you will have fun and increase your rating!

Good luck!

Also, we would like to start the trend of evaluating the round's problems. We think it will give valuable feedback to authors and make future contests better. So please, vote for each problem after the round's end.

Hello codeforces!

BrayanD, dmga44 and I are glad to invite you to Codeforces Round #768 (Div. 1) and Codeforces Round #768 (Div. 2) which will be held on Jan/27/2022 17:35 (Moscow time).

Each division will have 6 problems, and you will have 2 hours to solve them. The round will be rated for both divisions.

We would like to thank:

• Aleks5d for his excellent round coordination.

• albertolg101 and jmrh_1 for helping in the early stages of the contest.

• I_Remember_Olya_ashmelev, nweeks, 16204, windazz, Ali.Kh, vaaven, marcOS, low_, Riladavin, TeaTime, MDario, aniervs, Dragonado, Saborit, 4qqqq and saarang for testing and providing useful feedback.

• MikeMirzayanov for the great platforms Codeforces and Polygon.

Score Distribution:

Div. 2: $$$500 - 1000 - 1500 - 2250 - 2250 - 3000$$$.

Div. 1: $$$500 - 1250 - 1250 - 2000 - 2500 - 3000$$$.

Good luck to all participants! Hope you enjoy the contest.

UPD: Editorial

UPD2: Congratulations to the winners.

Div. 1:

1. Um_nik

2. Miracle0viiiiiv

3. heno239

4. ksun48

5. Radewoosh

6. maroonrk

7. mhq

8. Vercingetorix

Congratulations to all of them for solving all problems!

Div. 2:

1. YuulBA

2. wcdr

3. Dalia12

4. hrgd

5. Pure_container

Hello Codeforces!

magnus.hegdahl and I are glad to invite you to Codeforces Round #767 (Div. 1) and Codeforces Round #767 (Div. 2) which will be held on Jan/22/2022 17:35 (Moscow time)! This round is rated for both divisions.

In each division there will be 6 problems and 2 hours to solve them.

We would like to thank the following amazing people:

• 74TrAkToR for great coordination of the round and translating the statements!
• efimovpaul, agrayush13, ak2006, BidoTeima, QuangBuiCP, mesanu, _Vanilla_, down, FedShat, gupta_samarth, namanbansal013, MoonKnight., stefdasca, AlperenT, DIvanCode, lox123, voventa, kpw29, ptd, AlexLuchianov, PurpleCrayon, abc864197532, Maksim1744 for testing, providing invaluable feedback and being awesome!
• Nika_Tamliani for helping in the early stages of the round!

• MikeMirzayanov for great Codeforces and Polygon platforms!

• You, for participating and upvoting!

Score distribution:

Div. 2: $$$500$$$ — $$$750$$$ — $$$1250$$$ — $$$1500$$$ — $$$2000$$$ — ($$$1500$$$ — $$$1000$$$).

Div. 1: $$$500$$$ — $$$750$$$ — $$$1250$$$ — ($$$1000$$$ — $$$750$$$) — $$$2250$$$ — $$$3000$$$.

UPD1: ak2006 and namanbansal013 have prepared video editorials for most div. 2 problems that will be available on ak2006's channel and namanbansal013's stream

UPD2: Editorial is out!

Hello, Codeforces.

Unfortunately, we have to declare the round unrated.

Absolutely, these are not issues of the side of Codeforces code, but rather it is a hardware issue. Probably, electricity, power unit or something else. This led to unexpected repeated reboots of the server with the database. I hope that we will be able to quickly deal with this.

We apologize to the writers of the round and its participants.

P.S. Please, do not downvote the round announcement: the writers are not to blame for what happened. And in general, this time it is difficult to blame someone. Sometimes hardware fails.

Mike.

Hello Codeforces!

On Jan/16/2022 17:35 (Moscow time) Educational Codeforces Round 121 (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!

UPD: Unfortunately, the round is unrated. We are sorry for the inconvenience. You can upsolve the problems using the Codeforces archive.

UPD: Editorial is out.

omg hi Codeforces!

ScarletS, flamestorm, fishy15, saarang, lookcook and I are glad to invite you to our Codeforces round, Codeforces Round #766 (Div. 2), which will be held on Jan/15/2022 17:35 (Moscow time). This round will be rated for participants with rating lower than 2100.

We would like to thank:

• Monogon senpai for excellent coordination of the contest.

• MikeMirzayanov, for creating the amazing Codeforces and Polygon platforms!

• KAN, for Russian translations!

• dorijanlendvaj, errorgorn, PurpleCrayon, generic_placeholder_name, blue, polarity-, atharv, epicxtroll, dbsic211, StArChAn, namanbansal013, BRCode, nishuz, Rehan, Urvuk3, sid., tdpencil and bakekaga for testing the round, catching any mistakes and providing lots of valuable feedback! We tried to get a large range of testers with different coding experiences so that everybody enjoys the round.

You will have 2 hours to work on (and solve!) 6 problems. There will be at most five hundred interactive problems in the round. Make sure to read this blog and familiarize yourself with these types of problems before the round! You are highly encouraged to read all the problems ;).

Good luck, and see you on the scoreboard!

UPD1: Thanks to the testers ak2006 for making video editorials for most of the problems, and namanbansal013 who will be streaming solutions after the round!

UPD2: The score distribution is $$$500-1250-1250-1750-2000-2750$$$.

UPD3: The editorial is available here.

UPD4: Congrats to the winners!

Div. 2:

1. yxh_loves_lxr

2. Alan_boyfriend

3. proton1126

4. raingirl

5. yincheng01

Div. 1 + 2:

1. neal

2. qazswedx2

3. hitonanode

4. Bench0310

5. m_99

We hope you enjoyed the round. Look forward to our next one!

Hello, Codeforces!

We invite you to Codeforces Round #765 (Div. 2), which will take place in Jan/12/2022 15:05 (Moscow time). Note the unusual contest start time. This round will be rated for all the participants whose ratings are lower than 2100.

You will have to solve 5 problems in 2 hours. One of the problems will be divided into easy and hard version. The round is based on the problems from Belarusian Regional olympiad. We kindly ask all Belarusian pupils who participated in this olympiad, to refrain from taking part in this round and discussing the problems publicly before the round ends.

Thanks to everyone who helped to prepare this contest:

• Our coordinators, KAN and isaf27 for good coordination.
• Wind_Eagle, gepardo, VEGAnn, andrew for help in preparing the round.
• programmer228, Vladik for testing the round.
• MikeMirzayanov for making nice systems Codeforces and Polygon.

The scoring distribution: 500-1000-1500-2000-(2000+1250)

Good luck to everyone!

UPD: Finally the editorial is available.

Hello! Codeforces Round #764 (Div. 3) will start at Jan/10/2022 17:35 (Moscow time). You will be offered 7-8 problems 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 a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7-8 problems and 2 hours and 15 minutes to solve them. One of the problems in this round is interactive. Don't forget to read the guide on interactive problems.

Note that the penalty for the wrong submission in this round 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 participant of the third division, you must:

• take part in at least five 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 our work. Problems have been created and written by ITMO University team: MikeMirzayanov, MisterGu, myav, Gol_D, Aris, SixtyWithoutExam and Vladosiya.

We would like to thank: itohdak, Yogi79, smtcoder, Ra16bit, Tlatoani, nigus, MrDindows, leaf1415, Kniaz, Alireza, mini4141, Jostic11, BitHashTech, An_yujin, Bugman и sodafago for testing the contest and valuable feedback. List of testers will be updated.

Good luck!

UPD: Here is a photo of our team answering your questions during the round:

UPD 2: Editorial