By awoo, history, 21 hour(s) ago, translation, In English

Neapolis University Pafos

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos.

On Apr/12/2024 17:35 (Moscow time) Educational Codeforces Round 164 (Rated for Div. 2) will start.

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!

Full text and comments »

  • Vote: I like it
  • +148
  • Vote: I do not like it

By mainyutin, history, 5 days ago, translation, In English

Hello! Codeforces Round 938 (Div. 3) will start at Apr/08/2024 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.

Problems have been created and written by our team: mainyutin, vmanosin7, ssor96 and ZergTricky.

We would like to thank:

  1. Vladosiya for help with ideas and great coordination of the round;

  2. FairyWinx, sevlll777 for red testing;

  3. ace5, Nickir, senjougaharin, vladmart for yellow testing;

  4. natalina for blue testing;

  5. bitthal04 for cyan testing;

  6. Alequisk, Mohamed_Hesham for green testing;

  7. MikeMirzayanov for Polygon and Codeforces platforms.

Good luck!

UPD: There was an issue with the validation of hacks for problem G, but it has now been resolved. All successful hacks will be rejudged. Pretests were not affected by the issue and remain unchanged.

UPD2: Editorial is out.

Full text and comments »

  • Vote: I like it
  • +27
  • Vote: I do not like it

By Kuroni, history, 9 days ago, In English

Xin chào Codeforces (・ω・)ノ

We are pleased to announce the resumption of the Global Rounds. Thanks to XTX Markets for supporting the initiative! In 2024, we will hold 4 such rounds. The series results will take into account the best 3 participations out of 4.

On Apr/06/2024 17:35 (Moscow time) we will host Codeforces Global Round 25.

Codeforces Global Round 25 marks the first round in the 2024 series of Codeforces Global Rounds. These rounds are open and rated for everyone.

The prizes for this round are as follows:

  • The top 30 participants will receive a t-shirt.
  • 20 t-shirts will be randomly distributed among participants ranked between 31 and 500, inclusive.

The prizes for the 4-round series in 2024:

  • In each round, the top-100 participants get points according to the table.
  • A participant's final score will be the sum of the points they earned in their 3 highest-placing rounds.
  • The top 20 participants across the series will receive sweatshirts and placement certificates.

We extend our gratitude to XTX Markets for supporting the global rounds initiative in 2024!

The problems were all marinated and cooked by MofK and Kuroni.

Our sincerest gratitudes go to:

Round Information:

  • Duration: $$$3$$$ hours.
  • Number of problems: $$$9$$$ problems.
  • Score distribution: $$$500 - 1000 - 1500 - 1750 - 2250 - 2750 - 3250 - 3500 - 4000$$$.

A tiny bit of personal note at the end, this is our first round on Codeforces in 3 years, and it feels a bit nostalgic to be back here again :) We eagerly anticipate your participation and let's all make it an awesome contest together!

Blooper

UPD: Added score distribution.

UPD: The round has concluded. Congratulations to the winners!

  1. Geothermal
  2. ecnerwala
  3. Um_nik
  4. maroonrk
  5. jqdai0815
  6. Benq
  7. hos.lyric
  8. antontrygubO_o
  9. cmll02
  10. AlternatingCurrent

Tutorial can be found here, and playlist of songs used in the problem statements can be found here.

Full text and comments »

Announcement of Codeforces Global Round 25
  • Vote: I like it
  • +599
  • Vote: I do not like it

By ICPCNews, 11 days ago, In English

text

Hello, Codeforces!

The ICPC Challenge World Finals in Luxor is approaching for some of you, and we are delighted to provide an additional exciting opportunity to compete open to all!

We are happy to invite you to the 2023 Post World Finals Online ICPC Challenge, powered by Huawei starting on May 6, 2024 at 15:00 UTC and ending on May 20, 2024 at 14:59 UTC.

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.

2023 Post World Finals Online ICPC Challenge powered by Huawei:

Start: May 6, 2024 15:00 UTC

Finish: May 20, 2024 14:59 UTC

We hope you'll enjoy this complex 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

REGISTER

Prizes from Huawei

Rank Prize
Grand Prize (Rank 1) € 12 000 EUR + a travel trip to the 48th Annual ICPC World Finals in a guest role
First Prize (Rank 2-10) € 8,000 EUR
Second Prize (Rank 11-30) € 3,000 EUR
Third Prize (Rank 31-60): € 800 EUR
TOP 200 Participants Souvenir T-shirt
* If the allocated Huawei Challenge prize cannot be delivered to your region for any reason it may be replaced by another prize (if no legal restrictions), at the discretion of the Sponsor.

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!

Full text and comments »

  • Vote: I like it
  • +155
  • Vote: I do not like it

By AlperenT, 2 weeks ago, In English

Hello, April Fools lovers Codeforces!

We, AlperenT, flamestorm, ToxicPie9, and willy108, would like to invite everyone on Codeforces to April Fools Day Contest 2024! The 12th April Fools Day Contest will take place on Apr/01/2024 17:35 (Moscow time). This is a joke competition in which solving the problem is often easier than figuring out what the actual task is.

In this round, you will be given $$$n$$$ cool bugaboos where $$$-1 \le n \le \textbf{[REDACTED]}$$$ and 2 hours to solve them. The contest will use extended ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them). You can submit solutions in any language allowed by Codeforces, unless the problem says otherwise.

Please note that the round is unrated and that the penalty for a wrong submission is 10 minutes.

To get an idea of what the contest will look like, you can check out the contests of the past years: 2012, 2013, 2014, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023. (It has been 12 years since the first April Fools Day Contest, thank you Nickolas!)

Please do not send any clarification requests in the contest, as we definitely will not be sending funny responses like we did last year.

Good luck, and have fun!

UPD: Editorial is released!

UPD: Congrats to the winners:

  1. tiger2005
  2. emthrm
  3. Enchom
  4. arvindf232
  5. KumaTachiRen

And the first solves on each problem:

Full text and comments »

  • Vote: I like it
  • +822
  • Vote: I do not like it

By cry, 7 weeks ago, In English

Hello Codeforcers!

We are pleased to invite you to participate in CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!). This round will start on Mar/30/2024 17:35 (Moscow time) and will be rated for all participants. There will be $$$8$$$ problems to be solved in $$$3$$$ hours, with one divided into two subtasks. Similar to USACO, you will help Farmer John and his cows resolve a series of first world problems. Be there or be square.

This round was cooked up by smax, sum, oursaco, cry, and buffering.

We would like to thank the following people for making the round possible:

Score Distribution:

$$$500 - 1000 - (1250 + 750) - 2250 - 2500 - 3000 - 3000 - 4500$$$

Editorial

Congratulations to our Winners and First Solves!

Top 5:

  1. maroonrk

  2. Radewoosh

  3. ecnerwala

  4. cnnfls_csy

  5. orzdevinwang

First Solves:

A. A_G
B. jiangly
C1. ksun48
C2. turmax
D. Omer223
E. tourist
F. Radewoosh
G. tourist
H. ecnerwala

And here is the information from our title sponsor:

Hello, Codeforces!

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

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 8 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 8 and hope you enjoy the contest!

Full text and comments »

  • Vote: I like it
  • +502
  • Vote: I do not like it

By flamestorm, 2 weeks ago, In English

Hej, Codeforces!

mesanu, SlavicG and I are very excited to invite you to Codeforces Round 937 (Div. 4)! It starts on Mar/28/2024 17:45 (Moscow time).

The format of the event will be identical to Div. 3 rounds:

  • 5-8 tasks;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth 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 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Thanks a lot to the testers: erekle, vladmart, nskybytskyi, Vladosiya, KrowSavcik, Dominater069, LucaLucaM, MADE_IN_HEAVEN, tvladm, nor.

We suggest reading all of the problems and hope you will find them interesting. Good luck!

UPD: The round is delayed by 10 minutes: https://codeforces.com/blog/entry/127616?#comment-1133556.

UPD: The editorial is posted!

Full text and comments »

  • Vote: I like it
  • +147
  • Vote: I do not like it

By Una_Shem, history, 3 weeks ago, In English

Update: TON Tact Smart Challenge #2 has been postponed. More information here.

Please note: CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) will take place as scheduled. We will be glad to see you among the participants!

Hello, Codeforces!

Have you heard about TON Tact Smart Challenge #2? It's an amazing competition organized by our title sponsor, the TON Foundation in their ecosystem.

This challenge is designed to engage participants in creating a decentralized social network prototype utilizing the Tact smart contract language. The project consists of five stages, each aimed at implementing a core feature of the social network, from user profiles to decentralized management.

We encourage the Codeforces community to participate in this contest. Dive deep into the world of TON Blockchain and explore the limits of what's possible.

Challenge starts on March 25, and lasts until April 3. To enter the challenge, register through @smartchallengebot. You'll receive all the essential details, including start times, submission guidelines, and insights into the challenge stages.

For more information, visit this page.

TON Tact Smart Challenge #2 →

The scoring system is simple:

Each stage can bring you a max of 6 points. You get 5 points for solving a stage. You get an extra point if you solve it without using any gas.

Minimum amount of points to be eligible for the prize is 6 points.

Prizes:

  • $7,000 in TON — The top 15% of eligible participants
  • $7,000 in TON — The middle 30% of eligible participants
  • $6,000 in TON — The bottom 55% of eligible participants

Impressive, right? Hurry up and join!

Good luck!

Full text and comments »

  • Vote: I like it
  • +143
  • Vote: I do not like it

By dario2994, 3 weeks ago, In English

The European Championship 2024 will take place on the 24th of March in Prague. The top teams from the European ICPC regionals CERC, NWERC, SEERC, SWERC will compete for the title of European champions. It is the first edition of this ICPC super-regional.

The mirror contest European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) will be held on Codeforces at Mar/24/2024 13:00 (Moscow time) and will last 5 hours.

The mirror contest will contain the same problems as the official competition.

I am the chief judge for the competition and I want to thank:

  • The amazing set of judges who proposed and prepared the problems: antontrygubO_o, bicsi, Giove, Martin Kacer, MZuenni, Petr.
  • Our beloved tester ksun48 who showed us that our perception of the difficulties was not exactly spot on...
  • Our beloved proofreader Philae for proofreading the statements.
  • Everyone involved in the organization of EUC. In particular our director Boba Mannová, and Fernando Silva, Václav Herman, Ondřej Votava, Jan Kubr, Jan Baier.
  • The developers of DOMjudge, the contest system used in the official contest.
  • MikeMirzayanov for Polygon (that we used to prepare the problems) and for letting us host the mirror on Codeforces.

I invite you to participate in the contest and I hope that you will like the problems.

On the difficulty
The contest features problems with difficulties from div1A to div1E. It should be enjoyable for many, and challenging even for the strongest teams in the world.

Rules

  1. The contest is unrated, so your codeforces rating will not be affected.
  2. The scoring is ICPC-style: teams are first sorted by number of problems solved, then the time-penalty is used as a tie-break. An incorrect submission gives a 20 minutes penalty.
  3. We encourage participation as a team.
  4. If you are participating in a team, we encourage you to use only one computer for coding the solutions (as in an ICPC contest). Regarding using templates, googling, and copy-pasting code: feel free to do it.
Rationale of rule 4.

UPDATE: We hope you liked the problems!

Congratulations to the winners, and especially to the first two teams for AK:

  1. dw my perception of the difficulties was not exactly spot on: tourist, ecnerwala.
  2. xinyoudui: PubabaOnO, orzdevinwang, jqdai0815
  3. MIPT: Yolki-palki: Tikhon228, Pechalka, Kapt
  4. Captain take me!: crazy_sea, A_zjzj, 275307894a
  5. Beyond Three Wolves: Kevin114514, CrTsIr, Atomic-Jellyfish
  6. HSE: FFTilted: Kirill22, Ormlis

We uploaded the editorial of the contest.

Tune in to ICPCLive to see the closing ceremony and find out how the onsite teams did at 18:00 CET!

UPDATE 2:

Congratulations to the medalists of the onsite contest:

  1. Warsaw Eagles 2024 — University of Warsaw (the only team with 9 problems)
  2. Zagreb 1 — University of Zagreb
  3. KNU_0_GB_RAM — Taras Shevchenko National University of Kyiv
  4. ELTE 1 — Eötvös Loránd University
  5. UWr 1 — University of Wroclaw
  6. ENS Ulm 1 — École Normale Supérieure de Paris

Full text and comments »

  • Vote: I like it
  • +388
  • Vote: I do not like it

By yunetive29, history, 4 weeks ago, translation, In English

Hola, Codeforces!

We are pleased to invite you to participate in Codeforces Round 936 (Div. 2), which will start on Mar/22/2024 17:35 (Moscow time).

The round was prepared by exhausted, max0000561, azureglow and myself.

This round will be rated for participants whose rating is below 2100. Participants with higher ratings may participate out of the competition.

You will be given 6 problems and 2 hours to solve them. We hope you find them interesting.

We would like to thank:

Special thanks to KoT_OsKaR and teraqqq for their help in creating tasks.

Good luck on the round and high rankings to everyone!

Score Distribution: 500−1000−1500−1750−2250−2750.

UPD: The date of the round has been changed to avoid interference with a competition on another platform.

UPD: Editorial

Full text and comments »

  • Vote: I like it
  • +605
  • Vote: I do not like it