Hello!

It is always satisfying and important for me when former contest participants offer their help to the community and support the development of programming competitions. And now I am in a hurry to share the news that thanks to the support of XTX Markets and the personal participation of Yuri Bedny and Alexander Gerko, we are launching a new line of Codeforces Global Rounds. Hooray!

Like many of you, I had never heard of XTX Markets before but it is one of the largest quantitative-driven electronic liquidity providers in the world. I understand little about the financial sector, but with their 34,148 cores and 42 petabytes of usable storage in their research cluster, XTX’s rapid growth and strong market share globally speak for themselves.

So, in 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all authors and problem testers.

I will be very happy for Codeforces to work with the best authors of the problems. I hope that the XTX Markets initiative will allow for interesting and testing rounds that will delight community members! We have the opportunity to pay $800, double fee, for the preparation of a full set of problems (for some rounds we may collect problems from different authors).

The first Global Round will take place very soon — starting Feb/07/2019 16:35 (Moscow time). I hope you will enjoy the round!

— MikeMirzayanov

Hello Everyone!

I would like to invite you to CodeCraft-19, which is a part of Felicity, the annual techno-cultural fest of IIIT Hyderabad. It will take place on Feb/03/2019 18:35 (Moscow time).

The round will be rated for Div 2 participants (whose ratings are lower than 2100). As usual, participants from the first division can participate in the contest out of the competition. You will be given 5 problems, all of which are based on the theme of our fest, "Superheroes".

I would like to thank the CodeCraft team -- nir123, additya1998, devanshg27, gaurav172, night_fury208, shaanknight, psaini, sharmaritvik60, swetanjal and vivace_jr -- for helping in preparation of the problemset. I would also like to thank KAN and 300iq for round coordination, ----------, Aleks5d and mohammedehab2002 for testing the round and MikeMirzayanov for the great Codeforces and Polygon platforms.

Following the convention, score distribution will be announced shortly before the contest.

Good luck to all the participants!

UPD1: 500-1000-1500-2000-2500

UPD2 Editorial is published! We sincerely apologize for the weak pretests in B and for the difficulty gap from C to D which turned out to be harder than what we expected.

UPD3 Congratulations to the winners!

1. prodakcin

2. Taiyaki

3. yww_AFO

4. Mindstorm

5. ThankGodItsFriday

6. Issh

7. hfctf0210

8. Y.nnnnnnn

9. kirillbogatiy

10. PedyD

Hello, Codeforces!

It's my honor to invite you to Codeforces Round #536 (Div. 2), which takes place at 12:35 UTC, January 31st, 2019. The round will be rated for all division 2 participants (with rating less than 2100). Also we warmly welcome those division 1 participants to join us out of competition.

This is my second round on Codeforces platform, and my first round was on January 31st, 2018, which is such a coincidence that I would like to say thanks to KAN for his awesome coordination and great dedication to this round. Besides, much thanks to testers Aleks5d, cyand1317, mohammedehab2002, ---------- for their excellent testing work. Also, I would like to appreciate the Codeforces platform created and maintained by MikeMirzayanov, without which the round wouldn't be possible.

In order to celebrate the Lunar New Year (or Spring Festival) originated in China on February 5th, I proposed the round with 6 problems, whose theme is about the Lunar New Year. In this round, you are going to help Alice and Bob to solve some problems in the preparation of celebrating the Lunar New Year in 2 hours. I hope that those problems can interest you and improve your programming abilities, at the same time, bring you luckiness as well as high rating in the coming Lunar New Year!

As a convention, the scoring distribution will be announced soon.

Again, wish you more luckiness and higher rating!

UPD1: Editorial is published.

UPD2: The scoring distribution will be 500-1000-1250-1500-2250-3000. Note that there are 6 problems and you will be given 2 hours to solve them.

UPD3: System test is finished. We are sorry for that technical issue which ruined your happiness. Despite the issue, I hope you do learn something from the problem set, which might be far more important than the rating itself. Enjoy problems, and looking forward to the next contest with better problem set to learn something new, which in my opinion is what Codeforces platform wants to provide us with. Thanks for your participation and dedication even after the unrated announcement. :)

UPD4: The real Editorial is published. Thanks for your patience.

UPD5: Despite that the round is unrated, I have to announce the winners, who deserve it because of their hard work.

Div. 2

1. developer227

2. newbieyzr

3. Zharaskhan

4. I_AM_CHTHOLLY

5. mzhmxzh

6. radoslav192

7. Vit.C

8. visitWorld

9. yycdage

10. xuzhiyuan1

11. zhangqingqi

12. Crossguard

13. gtrhetr

14. Itst

15. HwSh

Hello Codeforces!

On Jan/26/2019 18:35 (Moscow time) Educational Codeforces Round 59 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: You can discuss the problems after the contest on a local Discord server.

Our friends at Harbour.Space also have a message for you:

Hello Codeforces!

A quick reminder to check out the Hello Muscat Programming Bootcamp!

Every day, both the Hello Programming Bootcamp and the Moscow ICPC Workshop will be competing simultaneously, 4,000 kilometers from each other — our camp will take place in Oman, from March 9th to March 15th, 2019 — registration is still open for this unique opportunity, so be sure to give it a look, we would love to see you there with us!

And, don’t forget that Harbour.Space University’s opportunity for a fully funded Master’s in Robotics programme scholarship is still open! Head over to their website to see the details, and apply before the registration date closes.

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem:

UPD2: The editorial is out

<copy-pasted-part>

Hello!

Codeforces Round 535 (Div. 3) will start at Jan/23/2019 17:35 (Moscow time). You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have 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. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

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

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) 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 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</copy-pasted-part>

UPD: I also would like to thank testers ismagilov.code, budalnik, Arpa, filippos, eddy1021 for the great help in round preparation!

UDP2: I don't sure about G63-AMG so I included top-6 instead of top-5 in the table. And I'm also don't sure that some hackers aren't cheat so forgive me if my information is wrong.

UPD3: Editorial is published!

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem:

Hey everyone!

I'm glad to invite you to Codeforces Round 534 (Div. 1) and Codeforces Round 534 (Div. 2), they will start on Jan/22/2019 17:35 (Moscow time). The round will be rated for both divisions.

Problems were prepared by me, Ivan isaf27 Safonov, Denis altruist Anishchenko and Ildar 300iq Gaynullin. Thanks to Um_nik for testing and MikeMirzayanov for the great Codeforces and Polygon platforms.

You will be given five problems in each division and two hours to solve them.

UPD: Score distribution: Div1:500-1000-2000-3000-3500, Div2:500-1000-1500-2000-3000

UPD: Congratulations to the winners!

Div. 1:

1. mnbvmar

2. whzzt

3. aid

4. dotorya

5. TLE

Div. 2:

1. aequa

2. RatingBooster_2

3. ujerpacul

4. Igor_Zakharov

5. halohalo

UPD: Editorial

Hi, Everyone!

At Jan/20/2019 15:05 (Moscow time) will start Codeforces Round 533 (Div. 2). Round will be rated for second division (rating below 2100). As usual, participants from the first division can participate in the contest out of competition.

The round will consist of 5 problems in which you will be helping some of my friends and you will be given two hours to help them.

I would like to thank MikeMirzayanov for the Codeforces and Polygon platforms, cdkrot for round coordination and help with preparation. Also thanks to vintage_Vlad_Makeev, Aleks5d,budalnik, Arpa, mohammedehab2002 and ---------- for help with preparation and testing round.

As usual score distribution will be announced shortly before the contest.

Good luck!

UPD1: I'll be on the Discord channel after the contest, so we will be able to discuss the problems.

UPD2: Score distribution : 500-1000-1500-2000-2500

UPD3: The Editorial is ready.

Hi, Codeforces!

At Jan/13/2019 17:35 (Moscow time) will start Codeforces Round 532 (Div. 2). Round will be rated for second division (rating below 2100). As usual, participants from the first division can participate in a contest out of competition.

The round will consist of 6 problems and you will be given two hours to solve them.

Task prepared by me, den2204.

Thanks MikeMirzayanov for the platform Codeforces, KAN for round coordination and help with preparation. Thanks vintage_Vlad_Makeev, Andreikkaa, Flyrise, Um_nik, Aleks5d and ---------- for help with preparation and testing round, arsor for translating statements into English, arsijo for assistance in conducting the round. Thanks Andreikkaa for the idea of the problem E.

Good luck!

P.S. It is my first round on Codeforces, please, do not judge strictly :)

UPD: Added editorial. Thank you all for participating and for the feedback on the contest. I apologize for the leap in complexity between tasks and for weak pretests for some tasks, I’ll take this into account when further preparing contests.

Hello Codeforces!

On 11.01.2019 17:35 (Московское время) Educational Codeforces Round 58 (рейтинговый для Див. 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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Grigory vintage_Vlad_Makeev Reznikov and me.

Good luck to all participants!

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem:

UPD: The editorial is out