Hello Codeforces!

On Dec/03/2023 17:35 (Moscow time) Educational Codeforces Round 159 (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, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Hello Codeforces!

We are going to hold The 2023 ICPC Asia Jakarta Regional Contest.

We invite you to join the online mirror contest 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred on Codeforces. It will be held on Dec/03/2023 07:35 (Moscow time) and will last for 5 hours.

The mirror will be held using ICPC-style scoring with 10 to 13 problems. The problem statements will only be available in English. We encourage participating as a team using only one computer for coding (as in ICPC contests). The mirror will be unrated.

Some useful links:

• The 2023 ICPC Asia Jakarta homepage
• The regional information in ICPC Global
• The onsite scoreboard (TBA)

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

Γεια σου (Hello), Codeforces once again!

Adam_GS and I are glad to invite you to participate in Codeforces Round #912 (Div. 2) which will take place on Nov/30/2023 19:35 (Moscow time). Note the unusual start time of the round. As usual, this round will be rated for participants with rating lower than 2100.

Problems were created and prepared by Adam_GS and me. We tried to make them interesting, with short and clear statements. We hope that you will enjoy them!

I would like to thank:

• ScarletS for amazing coordination of this round.

• Adam_GS for joining as an author after testing the contest.

• fishy15, Andreasyan, phattd, Murinh0, irkstepanov, wuhudsm, Ari, satyam343, Qualified, nyaruhodo, Trumling, Earlyamazon, freedommo33, jeroenodb, Nafis, czauderna, m.szeliga, Piokemon, Marky, jerzyk, jamjanek, t.kwiatkowski, AverageDiv1Enjoyer, revanth2002, htetgm, purp4ever, nor for testing the problems and providing useful feedback.

• MikeMirzayanov for Codeforces and Polygon platforms.

You will be given $$$6$$$ problems (and one subtask) and $$$2$$$ hours and $$$15$$$ minutes to solve them.

The score distribution will also be announced shortly.

Good luck and have fun!

UPD1:

Score Distribution: $$$500-1000-1500-(1500-2500)-2250-3500$$$

UPD2:

Editorial

UPD3:

Congratulations to the winners:

Div2:

1. DoIodu123

2. 69JohnMouse69

3. transfeft

4. vflower

5. Top2Greece

Div1 + 2:

1. Um_nik

2. ecnerwala

3. Ormlis

4. tourist

5. noimi

Hello, Codeforces!

Riblji_Keksic and I are glad to invite you to Codeforces Round 911 (Div. 2), which will start on Nov/26/2023 17:35 (Moscow time). You will be given 6 problems and 2 hours to solve them.

The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially.

All problems are invented and prepared by Riblji_Keksic and me.

Special thanks go to n0sk1ll and TimDee for their great work during the testing process of the round.

And of course, I would love to thank the people who made this round possible:

• pashka for his great coordination of the round!

• IgorI for helping host the round!

• Alexdat2000 for helping translate the round!

• prvocislo, wxhtzdy, valeriu, satyam343, n0sk1ll, TimDee, wuhudsm, AlphaMale06, Blagoj, priyanshu.p, Acanikolic73, gubica, ognjentesic, VeljkoGalovic and repmann for testing the round and providing valuable feedback!

• KAN for his contribution towards the round!

• MikeMirzayanov and the team for the codeforces and polygon platforms!

• You for participating!

We hope that you will participate and enjoy the round!

Update 1: The score distribution is 500 — 1000 — 1250 — 2000 — 2250 — 3000

Update 2: Congratulations to the winners:

Div. 2:

1. TransFeftAutoV

2. vflower

3. eloge

4. Illumina

5. Im_dik

6. Gold_Record

7. Haaland

8. mban259

9. hazzler

10. 111445

All participants:

1. fallleaves07

2. turmax

3. A_G

4. ppavic

5. minato

6. Yuu

7. potato167

8. Rubikun

9. Heltion

10. emthrm

First solvers:

A. people_plus_plus in 0:01

B. A_G in 0:04

C. WLZ in 0:04

D. A_G in 0:12

E. Superposition in 0:17

F. turmax in 0:26

Update 3: Editorial

Hello, Codeforces!

We are happy to invite you to an exciting onsite event: 2024 New Year ICPC Challenge powered by Huawei，which will start on January 12, 2024, 15:00 (UTC+8).

In this Challenge, you will have a unique chance:

• to compete with top programmers globally
• to solve 1 exciting problem prepared by Huawei
• to win amazing prizes from Huawei!

It is an individual competition.

2024 New Year ICPC Challenge powered by Huawei:

Start: January 12, 2024, 15:00 (UTC+8)

Finish: January 26, 2024, 15:00 (UTC+8)

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

Problem

We are glad to propose to you an exciting challenge “Accuracy-preserving summation algorithm”, which is prepared by Huawei Computing Product Line..

With this challenge, we focus on summation algorithms of floating point numbers in different precisions with the goal to use the lowest possible precision without losing too much of the accuracy of the end result. This problem arises in high-performance computing as lower precision can be computed faster. At the same time it also loses accuracy faster and can even lose it completely. Finding the right balance between fast low precision calculations and higher precision intermediate summations is a challenging task on modern architectures, and you would have an opportunity to try addressing this challenge.

Prizes from Huawei

Challenge Rules and Conditions

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

Good luck, we hope this will be fun!

Hello Codeforces,

We are very glad to invite you to participate in CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!), which will start on Nov/25/2023 17:50 (Moscow time). You will be given 8 problems and 2.5 hours to solve them. The round will be rated for everyone.

All the problems are written and prepared by lanhf, Mike4235, thenymphsofdelphi, xuanquang1999 and me.

We would like to give our sincere thanks to:

• errorgorn for his wonderful coordination!
• Alexdat2000 for translating problem statements.
• Um_nik and conqueror_of_tourist for Legendary Grandmaster testing.
• jeroenodb, Kuroni, dario2994 and dreamoon_love_AA for International Grandmaster testing.
• generic_placeholder_name, MofK, minhcool, dvdg6566 and magnus.hegdahl for Grandmaster testing.
• dantoh for International Master testing.
• apoorv_me, 18o3, beepbeepsheep, jamessngg, zengminghao, oolimry, iLoveIOI, pavement and jamielim for Master testing.
• Kofta, Dewi, Nahian9696, bensonlzl and Myrcella for Candidate Master testing.
• ABalobanov, AVdovin, Blagoj, teruel, xink and Antonn_114 for Expert testing.
• BeezMinh, aureg109, Yoo_Jeongyeon, Sunnyyyy and SYY for Specialist testing.
• NVGU for Pupil testing.
• vszda, tibinyte and hminh for Newbie testing.
• MikeMirzayanov for the great codeforces and polygon platform.
• You for participating in the round.

The score distribution is $$$500-1000-1500-2000-2250-2750-3250-(4000+1000)$$$.

Hope everyone can enjoy the round!

Congratulations to the winners!

1. Radewoosh
2. ksun48
3. ecnerwala
4. maroonrk
5. amiya
6. hos.lyric
7. zh0ukangyang
8. 244mhq
9. Vercingetorix
10. BigYellowDuck

Congratulations to the first solves as well!

• A: dXqwq
• B: tourist
• C: tourist
• D: tourist
• E: tourist
• F: ksun48
• G: Radewoosh
• H1: ksun48
• H2: ecnerwala

UPD1: The contest is delayed by 15 minutes due to prior issues with the registration system in order to make sure everyone is correctly registered. Please double-check that you are registered.

UPD2: Editorial

And here is the information from our title sponsor:

Hello, Codeforces!

We, the TON Foundation team, are pleased to support CodeTON Round 7.

The Open Network (TON) is a fully decentralized layer-1 blockchain designed to onboard billions of users to Web3.

Since July 2022, we have been supporting Codeforces as a title sponsor. This round is another way for us to contribute to the development of the community.

The winners of CodeTON Round 7 will receive valuable prizes.

The first 1,023 participants will receive prizes in TON cryptocurrency:

• 1st place: 1,024 TON
• 2–3 places: 512 TON each
• 4–7 places: 256 TON each
• 8–15 places: 128 TON each
• …
• 512–1,023 places: 2 TON each

We wish you good luck at CodeTON Round 7 and hope you enjoy the contest!

Hello, Codeforces!

We are glad to invite you to follow NWERC 2023! The 2023 Northwestern Europe Regional Contest will be held from the 24th till 26th of November 2023. The contest will be held on the campus of the Delft University of Technology, Netherlands.

NWERC is an official regional contest of ICPC which draws students' teams from colleges and universities throughout all over the Northwestern part of Europe. The team that solves the most problems at the end of the contest qualifies for the ICPC World Finals 2024, which is planned on September 2024, Kazakhstan.

There will also be an online spectator contest for you to solve the problems alongside the contestants. The contest will start at 10:30 CET on Sunday, November 26th. You can register at https://spectator.nwerc.eu/.

Please join us on the live broadcast on ICPCLive channel. All available events:

List of useful links:

• Live Scoreboard
• NWERC Homepage
• Schedule, November 24-26
• List of competing teams
• Spectator Contest

Main contest's broadcast starts on Sunday, November 26th at 10:00 (CET):

We wish good luck to all competing teams to have a great time spending!

Hello Codeforces!

On Nov/24/2023 17:35 (Moscow time) Educational Codeforces Round 158 (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, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Hello, Codeforces!

From the ICPC 2023 World Finals, we are happy to bring you an exciting online event: The ICPC 2023 Online Challenge powered by Huawei，which will start on November 20, 2023 15:00 UTC (UTC+8)

In this Challenge, you will have a unique chance:

• to compete with top programmers globally
• to solve 1 exciting problem prepared by Huawei
• to win amazing prizes from Huawei!

It is an individual competition.

The ICPC 2023 Online Challenge powered by Huawei:

Start: November 20, 2023 15:00 (UTC+8)

Finish: December 4, 2023 15:00 (UTC+8)

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

Problem

We are glad to propose to you an exciting challenge “Deterministic Scheduling for Extended Reality over 5G and Beyond”, which is prepared by Huawei Wireless Product Line.

In this contest, we focus on a XR-service scheduling problem to maximize the total number of successfully transformed XR-data frames under specific transmission requirements. Extended reality (XR) is an umbrella term for different types of realities such as virtual reality (VR), augmented reality (AR), and mixed reality (MR), which can provide people with immersive experience. To achieve better user-experience, scheduling algorithm should be proposed to efficiently utilize the limited radio resources, e.g., time resource, frequency resource, and power resource. Due to several practical constraints, the scheduling task is a typical NP-hard problem.

Prizes from Huawei

Challenge Rules and Conditions

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

Good luck, we hope this will be fun!