By isaf27, history, 3 years ago, translation, In English

Hi all!

This weekend, at Nov/14/2021 09:05 (Moscow time) we will hold Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) and Codeforces Round 755 (Div. 2, based on Technocup 2022 Elimination Round 2). They are based on problems of Technocup 2022 Elimination Round 2 that will be held at the same time.

Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at Technocup website and take part in the Elimination Round.

Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests!

Have fun!

The scoring distribution:

  • Technocup: 500 — 500 — 1000 — 1500 — 2000 — 2500 — 3250
  • Div1: 500 — 1000 — 1500 — 2000 — 2750 — 3750
  • Div2: 500 — 500 — 1000 — 1500 — 2000 — 2500

The round is over. Congratulations to the winners:

Technocup

  1. Artyom123
  2. turmax
  3. Kirill22
  4. jiangbowen_
  5. Kapt

Div1

  1. ko_osaga
  2. maroonrk
  3. xay5421
  4. jiangly
  5. uwi

Div2

  1. 1443356159
  2. int65536
  3. strongerthanspeed
  4. DSair
  5. nunu03

Editorial

Full text and comments »

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

By JeevanJyot, 3 years ago, In English

Henlo Codeforces!

We are very glad to invite you to the Codeforces Round 754 (Div. 2), which will be held on 12.11.2021 17:35 (Московское время). This round will be rated for participants with a rating less than $$$2100$$$. For higher rated participants, we challenge you to solve problem F ;)

All the problems were authored and prepared by Ashishgup, the_hyp0cr1t3, ExplodingFreeze and me. We have tried our best to create an interesting problemset with clear statements. Hope you enjoy the round :D

You will be given $$$6$$$ problems and $$$2$$$ hours to solve them.

We would like to thank:

Good luck!

Here's the scoring distribution of the round:

$$$500 - 1000 - 1500 - 2000 - 2500 - 3500$$$

UPD: Editorial is out

Also, congratulations to the winners.

Div 1 + 2:

  1. SSRS_

  2. Vercingetorix

  3. MatikaneTannhauser

  4. codinglunch

  5. hank55663

Div 2:

  1. MatikaneTannhauser

  2. codinglunch

  3. huyinghao0706

  4. QuietBeautifulThoughts

  5. MyBotDear

Full text and comments »

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

By doreshnikov, history, 3 years ago, In English

Hello Codeforces!

Once again, we are glad to invite you all to Codeforces Round 753 (Div. 3), the third division round held on Nov/02/2021 17:35 (Moscow time). This round was prepared (again) by me and MikeMirzayanov. The problems are different but our anticipation is the same :) Hope you will like the problems we've prepared!

Big thanks to MikeMirzayanov for great ideas as well as for helping me with writing good statements and better tests. I'm still a bit slow with some aspects of preparing problems so it's a really noticeable help for me. (UPD: as of this moment, it became much more noticeable, so, really, thanks a lot!)

Also special thanks for testing the round to RisingWizard, Capta1n_Shy, Mazaalai, GustavoMG, nizamoff, 2020akadaver, ashmelev, p0kemanbr, Kofta and, as usual, to Gassa for valuable comments! And last but not least, thanks to everyone who'll be participating! This round contains 8 problems and is expected to have a 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 8 problems and 2 hours to solve them. We remind you that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes. Also please note that the number of problems has slightly increased since the last edit.

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 to everyone!

UPD: Editorial is out!

Full text and comments »

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

By YouKn0wWho, 3 years ago, In English

UPD: (28 April, 2022)

Donated Finally

আবার চলে এসেছি! (That's Bengali for "I am back! (in Terminator mode)")

I am super excited to invite you to participate in Codeforces Round 752 (Div. 1) and Codeforces Round 752 (Div. 2) which will be held on Oct/30/2021 17:35 (Moscow time). This round is rated for both divisions.

You will be given $$$6$$$ problems in each division and $$$2$$$ hours to solve them. All the problems are authored and prepared by me.

I would like to thank -

The statements are short and directly ask you what to do and I have tried to make the pretests strong. I highly encourage you to read all the problems.

Solve problems and help the poor! Yes, you heard it right, this time you can help the world by just solving problems. I will donate money based on the solve count of each problem by the following measure:

Donation Per AC

The total estimated money is half of what I will get from Codeforces for this contest(but you can make it more by just solving more problems!). I am a student, so pardon me if that's too little.

Also, did you know that you can still upvote my The Ultimate Topic List blog and make it to the top?

Finally, I would like to dedicate this contest to me! I want to thank me for believing in me, for doing all this hard work, for trying to do more right than wrong. I want to thank me for just being me at all times.

Score distribution:
Div.1: $$$750-1000-1750-2500- 3500-3750$$$.
Div.2: $$$500-1000-1750-2000-2750-3500$$$.

Good Luck! Love you blobheart.

UPD: Editorial

UPD: Congratulations to the winners.

Div.1:

  1. tourist
  2. djq_cpp
  3. Petr
  4. gop2024
  5. ecnerwala

Div.2:

  1. Rolling_Code
  2. Pecans
  3. fangzhijina2020
  4. whtdsjmr
  5. Graphcities

UPD: Here is how the donation amount looks like:

Donation

FYI I will get 400 USD for this contest. So the donation amount is indeed half of this as I have estimated before the contest, although didn't think that it would be this accurate.

I will update you again when I get the money from Codeforces, more likely after a few months as I haven't received my previous contest's payment yet which happened 3 months ago!

Also, thanks for being a part of this. You have just helped someone who is in need (I mean after I distribute the money).

Full text and comments »

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

By awoo, history, 3 years ago, translation, In English

Hello Codeforces!

On Oct/29/2021 17:35 (Moscow time) Educational Codeforces Round 116 (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!

UPD: Editorial is out.

Full text and comments »

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

By ch_egor, 3 years ago, translation, In English

Hi everybody,

This Sunday there will be a XIX Moscow Team Olympiad, high school students competition based in Moscow that is an elimination contest for All-Russian Team Olympiad. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Open Olympiad, Moscow Olympiad for Young Students and Metropolises Olympiad (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541, 545, 567, 583, 594, 622, 626, 657, 680, 704, 707, 727).

The round will be held at Oct/25/2021 09:35 (Moscow time) and will last for 2 hours. Note the unusual time of the round. Each division will have 6 problems. The round will be held according to the Codeforces rules and will be rated for both divisions.

We kindly ask all the community members that are going to participate in the competition to show sportsmanship by not trying to cheat in any manner, in particular, by trying to figure out problem statements from the onsite participants. If you end up knowing some of the problems of Moscow Team Olympiad (by participating in it, from some of the onsite contestants or in any other way), please do not participate in the round. We also ask onsite contestants to not discuss problems in public. Failure to comply with any of the rules above may result in a disqualification.

Problems are prepared by LHiC, cdkrot, isaf27, AlesyaIvanova, Tikhon228, voidmax, fedoseev.timofey, KiKoS, NiceClock, 4eT_llpuyHblJl, vintage_Vlad_Makeev and Daria Krokhina under my supervision with great help of GlebsHP, meshanya, Endagorion, Zlobober and Helen Andreeva.

Thanks to adedalic and KAN for the round coordination and verifying statement of original olympiad, adedalic and GlebsHP for statement translation, and also thanks for MikeMirzayanov for systems codeforces and polygon, which was used to prepare problems of this olympiad.

Also thanks to napstablook and Anti-Light for providing an additional problems that helped to create (I hope) a balanced problem set for the round

Good luck everybody!

UPD1: Thanks to Um_nik, PurpleCrayon, LHiC, VladaMG98, JovanB, TadijaSebez, AlanSkarica, Markadiusz, actinium16, jurichhh8 for testing.

UPD2: Scoring distribution:

Div.1: 500 — 1250 — 2000 — 2250 — 2250 — 3000

Div.2: 500 — 1000 — 1500 — 2250 — 3000 — 3250

UPD3: Editorial

UPD4: Winners!

Div. 1:

  1. djq_cpp
  2. ksun48
  3. maroonrk
  4. ko_osaga
  5. Radewoosh

Div. 2:

  1. zero4338
  2. C2020jzm
  3. SYDevil
  4. PPL_
  5. just_ice

Full text and comments »

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

By AlFlen, 3 years ago, translation, In English

Hello, Codeforces!

74TrAkToR and I are glad to invite you to our Codeforces Round 750 (Div. 2), which will be held at Oct/24/2021 13:05 (Moscow time). Notice the unusual time of the round. The round will be rated for all the participants with rating strictly less than 2100. At the time of the round the CheReKOSH olympiad will be held, where the problems from this round will be used!

We would like to thank everyone who helped us a lot with round preparation.

On the round you will be asked to help characters from animated series Luntik and his friends. You will be given 7 problems, one of which has two subtasks. You will have 2 hours 30 minutes to solve them.

UPD: Score distribution: $$$500-750-1500-1750-2500-(2000+1500)-3250$$$.

UPD2: Editorial

UPD3: Congratulations to the winners!

Div. 2:

  1. int65536

  2. hehezhouyyds

  3. trunkty

  4. m3owp1mp

  5. Chtholly-Nota-Seniorious

Div. 1 + Div. 2:

  1. SSRS_

  2. emthrm

  3. int65536

  4. turmax

  5. hehezhouyyds

We wish everyone good luck!

Full text and comments »

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