Hello!

On Apr/27/2023 17:35 (Moscow time) we will host Codeforces Round 868 (Div. 2).

The problems were written and prepared by Igor_Parfenov.

I would like to thank everyone who made this round possible:

• awoo, madlogic, _Israel_, Vectors_Master, BabaVoss, AlperenT, FzArK, Dominater069, m0t9_, rui_er, aryan12, purp4ever, MaherSefo, Shawerma, maomao90, satyam343, errorgorn, Glemhel for testing the round and providing feedback to the problems
• adedalic, for coordination of the round
• MikeMirzayanov, for Codeforces and Polygon platforms
• All participants

This round will be rated for participants with rating lower than 2100.

You will have 2 hours to solve 6 problems.

Score distribution: 500 — 1000 — 1250 — 2000 — 2000 — 2500.

Good luck!

UPD: Editorial

UPD: Congratulations to the Winners!

Div.2:

1. Low-Deny-Cup

2. psz6

3. BULBULBUL

4. Epyset

5. chenguoyi

Div.1 + Div.2:

1. SSRS_

2. maspy

3. Rubikun

4. heno239

5. Crystally

Hello, Codeforces!

UPD: Challenge is over. You can find results in this post

We are happy to invite you to an exciting online event: ICPC 2023 Online Spring Challenge powered by Huawei, which will start on April 13, 2023, 11:00 UTC.

In this Challenge, you will have a unique chance:

• to compete during 14 days online challenge
• to solve 1 exciting problem prepared by Huawei
• to win amazing prizes from Huawei!

As a special prize, Huawei together with ICPC Foundation will provide the travel trip to the 46th Annual ICPC World Finals in a guest role!

Everyone is welcome to participate. It is an individual competition.

ICPC 2023 Online Spring Challenge powered by Huawei (open to the public):

Start: April 13, 2023 11:00 UTC (UTC+0)
Finish: April 27, 2023 10:59 UTC (UTC+0)

We hope you'll enjoy this complex yet very exciting Challenge!

Problem

This time we’re delighted to provide you with a new challenging problem from Huawei — Buffer Sharing in Multi-Tenant Database Environment, which is prepared by Huawei 2012 Labs and Huawei Cloud Computing.

Nowadays everyone uses databases directly or indirectly. For example, databases of service providers store shopping records, transaction records, or ticket purchase records. During this challenge, you will work with the multi-tenant database, in which a single database instance is divided into multiple virtual sub-databases, serving different tenants of cloud service.

In such databases, different tenants need to be isolated from each other to prevent services from affecting each other. Therefore, buffer is considered as an important resource for management of large amount of data. When the amount of data in the database buffer reaches the maximum value, the database buffer evicts some data from the memory based on the eviction algorithm and loads new data pages from the disk. Your goal is to optimize sharing and isolation of database buffers in the multi-tenant database. While replacement algorithms considered in this contest be one of the core algorithms, we believe there are multiple approaches one can try here, and some crossover of the algorithms will also increase your chances to win!

Prizes

To be eligible for Certificates of Participation and to win prizes you are required to register at https://icpc.global/regionals/finder/Spring-Challenge-2022 by April 26th.

If you are an employee of Huawei, we invite you to participate in a competition in a special corporate scoreboard. To do this, register at the link in the secret Codeforces group. Please note that you must register even if you already have a Codeforces account, as this group has its own separate account system. Good luck!

Challenge Rules and Conditions

By participating in this Challenge, you agree to the Conditions of Participation and Challenge Rules. If you cannot access this document, please email [email protected]

Good luck, we hope this will be fun!

Update, as of April 27

Congratulations to all the participants of the ICPC 2023 Online Spring Challenge powered by Huawei!

As stated in the problem statement, the jury needs to test the latest non-zero score submissions on the final set of tests after the end of the contest. Results will be announced no later than May 1, 2023

If you registered for the Challenge by April 26th and submitted at least one response, an ICPC Certificate of Participation will be posted on your ICPC Challenge Team Record in the “Attachments” section by the end of May.

Update, as of April 29

Please ensure you register on ICPC.global using the same email as your Codeforces account no later than Fri, May 5th in order to be eligible for prizes and a Challenge certificate. If you have already registered on both platforms, please ensure your ICPC profile email matches the email used on Codeforces.

Update, as of May 1

We are glad to announce the completion of the ICPC 2023 Online Spring Challenge powered by Huawei and announce its results. Thank you very much for your interest in the competition. It was exciting for us to follow the results. We hope you enjoyed the challenges.

All tests are done, and we are glad to announce that the results in the Standings are final!

Congratulations to winners! Thanks again for your interest. We will be glad to see you in our future contests.

Hello! Codeforces Round 867 (Div. 3) will start at Apr/24/2023 17:35 (Moscow time). You will be offered 6-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 6-8 problems and 2 hours and 15 minutes to solve them.

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, and Vladosiya for coordination of our work. Problems have been created and written by: diskoteka, pavlekn, playerr17, isosto.

We would like to thank: pashka, purplesyringa, Alexdat2000, I.Gleb, Serik2003, TkachDan, maksimb2008, _--, RedMachine-74, Gornak40, ut-k8g, Rudro25, Jostic11, yorky, tolbi, AhmetKaan, Splatjov, FiniteMoves, vrintle, KoT_OsKaR for testing the contest and valuable feedback.

Good luck!

UPD: Editorial

Hello Codeforces!

On Apr/20/2023 17:35 (Moscow time) Educational Codeforces Round 147 (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, 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:

Hey Codeforces!

Are you curious about the latest AI advancements and how they impact our world? Do you want to know more about how AI-based methods, especially in Natural Language Processing, are revolutionizing the way we work and interact with technology?

Space.Talks Present: Radoslav Neychev, AI Enthusiast, Researcher, and Machine & Deep Learning Professor.

Radoslav, a top-tier data scientist with extensive experience in Deep Learning and Reinforcement learning techniques, is coming to our Harbour.Space Barcelona Campus to give a talk on this topic. If you can't make it there, you can join the conversation, as we will stream it live on our YouTube channel here.

In this Space.Talk, Radoslav will share his expertise on how AI is changing our everyday lives and why it's important for both technical and non-technical specialists to understand the basics of how AI works. Plus, he'll also answer important questions about AI research and its future implications.

Mark your calendar for Thursday, April 20th, at 12hrs CET, and join us for an engaging conversation. Whether you're an experienced tech expert or just starting to explore the world of coding, this talk is for you!

And remember that we are always looking for the best and brightest! If you want to learn from industry experts like Radoslav, check out the scholarships we are offering and build a brighter future with us!

UPD: Editorial is out

Hello Codeforces!

UPD. I_love_natalia crashed the checker by his maze with $$$10^9$$$ moves. The problem is resolved now and all of the solutions rejudged. Scoring is changed. More info

UPD 2: The official site https://buglab.ru/ was updated. See comment.

UPD 3: The checker has been speeded-up by mfv in $$$2.2$$$ times (in comparison with my checker. The new speed is equal to $$$4$$$ seconds for a $$$10^9$$$ moves in codeforces "Custom Invocation"). Current standings:

1. $$$17\cdot 10^9$$$ — sas4eka;
2. $$$14\cdot 10^9$$$ — I_love_natalia;
3. $$$6.8 \cdot 10^9$$$ — maxplus (on the buglab: $$$11.3 \cdot 10^9$$$).

UPD 4: I updated the checker: now mazes up to $$$42$$$ billions are supported before checker got TL. Time limit of checker on codeforces platform is equal to $$$1$$$ minute. I submitted the maze with number of moves equal to $$$42.015.084.960$$$ and the result has been calculated in 59799 ms. Maybe someone can calculate the answer faster?

I'm happy to invite you to an unofficial mirror of Bug Game. In this game you need to generate a $$$21 \times 31$$$ maze with the maximum number of bug's moves to get out. The bug moves not optimally and you will see a description of algorithm of its movement in the statement of this problem. Based on given algorithm you will be able to create a maze and submit it.

Privacy: your solutions (your mazes) will be visible only for mfv.

Invitation link: click here

Date: April 18, 2023, 00:00 UTC+3

Duration: 2 weeks, then upsolving and virtual participation.

Scoring: if you will be able to generate the maze with $$$X$$$ moves to get out, then your solution will get $$$\frac{x}{10^5}$$$ points.

Official Russian site of Bug Game: click here

Hello, Codeforces!

This Saturday VIII Lipetsk Team Olympiad, a competition for high school students from all over the country, will be held in Lipetsk. Maybe you participated in previous Codeforces rounds based on our problems (rounds 643 and 791).

The round will start at Apr/15/2023 12:05 (Moscow time) and will last for 2 hours. Please notice the unusual time. Each division will have 6 problems. The round will be held according to the Codeforces rules and will be rated for both divisions.

Problems were proposed and prepared by Um_nik, DishonoredRighteous, FairyWinx, golikovnik, I_love_kirill22, grphil, Kon567889, TeaTime, Tikhon228 and dshindov.

I would like to thank Artyom123 for great round coordination and our testers: Ormlis, bashkort, mir, I_LOVE_ANTON_DONBASS, kiyotaka, iakovlev.zakhar, Mangooste, Siberian, SomethingNew, stepanov.aa, talant, rt3, towrist, Aaeria, Alexdat2000, qxforever, Renatyss, Renedyn, sevlll777, towrist, valerikk, Tiagodfs, wiz_cs, Setsuna, ezraft, Gornak40, HunterXD, kbats183, Nathan_McKane, nik_sn, Nitelike, Tilt, ak2006, KiruxaLight, 9kin.

Of course, I would like to thank all Codeforces team for this beautiful platform!

Scoring distribution will be announced later.

I hope you will enjoy our problems. Wish you good luck and high rating!

UPD: Scoring distribution:

Div.1: 750 – 1250 – 1500 – 2000 – 2750 – 3000

Div.2: 500 – 1000 – 1750 – 2000 – 2500 – 3500

UPD: Winners!

Div 2:

• yy_chen
• dengtingyu12138
• keyurchd_11
• Lyamzin_alexandr
• 39_w_M9

Div 1:

• BurnedChicken
• Radewoosh
• turmax
• yzc2005
• tourist

UPD: Editorial is available here

Hello, Codeforces.

I have implemented automatic translation of problem statements in Polygon (yes, yes, through ChatGPT). Here's an example of how to use it:

• Suppose we have a problem statement only in Russian and we want to have it in English as well.

• Create an empty problem statement in English.

• Go to the bottom of the problem statement and click on "Add automatic translation."

• In the popup window, you can choose the original language for translation (we only have Russian, so there's nothing to choose) and the section of the problem statement to translate (by default, it usually selects the appropriate option — translate everything).

• Click the "Translate" button.

• Wait for ChatGPT to translate the text (it may take up to a couple of minutes).

• When the translation is ready, it will be loaded into the popup window.

• Click "Save Translation."

• Done.

• Remember to proofread the statement yourself. Although it's a quality machine translation, it's still a machine translation.

One useful thing to note is that this method of translation miraculously preserves most of the LaTeX markup.

When using it, remember that the API is not free. I have set quotas, and if they are exceeded, I will have to turn off the feature. I hope this doesn't happen.

There are a few more ideas on how to use ChatGPT for peaceful purposes. Don't go too far.

Hello, Codeforces community!

We are happy to invite you to participate in National University of Singapore (NUS) CS3233 Final Team Contest 2023 Mirror on Monday, April 10, 2023, at 09:35 UTC. CS3233 is a course offered by NUS to prepare students in competitive problem solving.

The contest is unofficial and will be held in Codeforces Gym. Standard ICPC rules (Unrated, ICPC Rules, Teams Preferred) apply. The contest is unrated. Note the unusual starting time.

The problems are written and prepared by user202729_, rama_pang, and pooty.

We would also like to thank:

• Dr. Steven Halim for coordinating and teaching the CS3233 course;
• user202729_ and rama_pang as teaching assistants;
• stack.py (Pyqe, hocky, faustaadp) for testing the contest;
• errorgorn for existing;
• the Kattis team for the platform used in the CS3233 course and in the official contest;
• Codeforces Headquarters for letting us announce on the main page; and finally
• MikeMirzayanov for the amazing Codeforces and Polygon platform!

The contest will last for 5 hours and consist of 14 problems. While it is preferred to participate in a team, individual participation is also allowed.

The problems themselves may be quite standard as they are targeted toward those who have just learned competitive problem solving. However, we have also included a few challenging problems for stronger teams, such as ex-IOI or ICPC participants taking part in the course as well. So, the participants can expect a good mix of problems of varying difficulty levels, that we hope can be educational!

We hope you will enjoy and have fun in the contest. Good luck!

UPD: Contest is over! Editorial is up!

Congratulations to P+P+P (998batrr, 244mhq, 353cerega) for the win!

Happy Easter, Codeforces! Sadly the round will not be Easter themed :(

We (arvindf232, culver0412, snowysecret, potatoo, jerryliuhkg) are delighted to invite you to participate in Codeforces Round 865 (Div. 1) and Codeforces Round 865 (Div. 2), which will take place on Apr/09/2023 17:45 (Moscow time). Participants with a rating lower than 1900 will participate in Division 2, while participants with a rating of at least 1900 will participate in Division 1. Notice the unusual starting time.

All the problems were authored and prepared by arvindf232, culver0412, snowysecret and potatoo. Huge thanks to the following people, without whom the round would not be possible:

• Artyom123 for excellent coordination and translation of statements.
• KAN for help with round preparation.
• jerryliuhkg for problem proposals which didn't make it to the final problem set.
• gamegame, dorijanlendvaj, abc864197532, ShuiLaoshi, ACGN, Rekaxem, xiaoziya, Perpetually_Purple, prvocislo, Qingyu, JeffreyLC, wyhong3103, Nahian9696, NemanjaSo2005, Dakto, triple__a, Singinginginging, Imakf, Ritwin, TomiokapEace, dbscts, mariowong123, jerryliuhkg, Flower08, Codula, prabhav_, rsj, __jk__, Aaeria, DBSHoShunNgai, Tutis, ak2006 for testing and valuable feedback.
• rsj for providing a nicer solution to one of the problems.
• MikeMirzayanov for Codeforces and Polygon platforms.
• You, for participating!

In both divisions, you will have 2 hours and 15 minutes to solve 6 problems. One of the problems is interactive, please see the guide of interactive problems if you are not familiar with it.

Wish you good luck and high ratings!

UPD1: Score distribution is as follows:

• Div. 1: 500-1250-1750-2500-3000-3500
• Div. 2: 500-1000-1250-2000-2500-3250

UPD2: Editorial

UPD3: Congratulations to the winners!