We are glad to inform you that Volga Summer Camp 2020 – open competitive programming camp – will take place on July 7-18. It is organised by NUST MISIS together with P.G. Demidov Yaroslavl State University with the support of SIT (Schaffhausen Institute of Technology).

At the moment a lot of events are held in the remote mode and our camp is not an exception. This year it will be conducted online.

Teams of up to 3 members are invited to join.

There are two levels of difficulty (two divisions):

• DivC welcomes teams, getting ready for the semi-final of ICPC. Half of the time they are going to deal with quarter-final ICPC contests, and the rest of it will be dedicated to private thematic contests. The focus of our lessons will be on coordinate compression, number theory, probability problems, network flow in graph theory.
• DivB is for teams aiming directly at ICPC final. All the contests here are team ones. The contests are going to be of the two difficulty levels: those of semi-finals and quarter-finals of ICPC.

During the camping period there will be 10 training days and 2 days off. Training days will have the usual schedule: contest→ tutorial→upsolving. For divC there will be lectures before private contests. The lectures in the camp will be given by coaches from NUST MISiS, YarSU and ITMO on one of the platforms for video conferencing. It is the first time foreign teams are invited to DivB. DivB classes will be held in two languages: both in Russian and in English.

Arrangement fee for participants from EAEU is 5000 rubles per person.

Arrangement fee for participants from other countries is 100 euros per person.

To participate fill in the application form before the 25th of June.

Volga Camp in VK: https://vk.com/volgacamp

Official Volga Camp page: http://volgacamp.ru/en/camp

The information about previous camps can be found on our official website: http://acm.misis.ru/camp/

The camp is supported by SIT(Schaffhausen Institute of Technology) and ICPC NERC HQ (ICPC: Northern Eurasia Contests Headquarters).

Hi everyone!

Codeforces round #649 will take place on Jun/13/2020 18:05 (Moscow time). It's rated for the second division, but, as usual, first division participants can take part out of competition.

The problems were created by me. I'd like to thank my forever orzable coordinator antontrygubO_o; my incredible army of testers dorijanlendvaj, 300iq, Osama_Alkhodairy, AmShZ, taran_1407, TigranMec, _Aaryan_, Mohammad_Yasser, zoooma13, lavish315, Utkarsh.25dec, far_from_NOOB, and Laggy; and, of course, you-know-who for the amazing codeforces and polygon platforms.

This time, in an effort to kill type-races and because I'm lazy, you'll be given 5 problems and 2 hours to solve them.

UPD: the scoring distribution will be 750-1000-1500-2000-2500.

UPD: the editorial is out.

UPD: congratulations to the winners!

Div.1:-

1. Um_nik
2. 244mhq
3. hank55663
4. noimi
5. neal

Div.2:-

1. SanyaSaske
2. Chloristendika
3. el_risitas
4. Ehaam
5. RinkaSnow

Good luck & Have fun :D

Microsoft's Quantum team is excited to announce the Q# Coding Contest – Summer 2020, the third in the series of Q# contests! In this contest you can put your quantum programming skills to the test, solving quantum computing tasks in Q#. The winners (as well as some lucky participants) will receive a Microsoft Quantum T-shirt!

Quantum computing is a radically different computing paradigm compared to classical computing. Indeed, it is so different that some tasks that are believed to be classically intractable (such as factoring integers or simulating physical systems) can be performed efficiently on a quantum computer. In December 2017 Microsoft introduced the Quantum Development Kit which includes the Q# programming language.

In summer of 2018 we hosted the first quantum programming contest, which included problems on introductory topics in quantum computing: superposition, measurement, quantum oracles and simple algorithms. In winter of 2019 we hosted the second quantum programming contest, which offered harder problems on those topics plus some tasks on implementing unitary transformations. This contest will introduce new types of tasks, as well as some twists on the previous ones.

The contest will run from June 19 to June 22. As usual, we will hold a warmup round the weekend before the contest, from June 12 to June 15, to give you an opportunity to get familiar with the contest environment and submission system before the main contest. Participation in the warmup round is optional.

Good luck! We hope you enjoy the contest!

The rules of the contest are:

Hello Codeforces!

On Jun/11/2020 17:35 (Moscow time) Educational Codeforces Round 89 (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 Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, 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!

A couple of weeks ago, we had the pleasure of hosting a webinar featuring Sergey Gordeichik, CIO of the Inception Institute of Artificial Intelligence and Director of the University’s Cybersecurity Programme.

In his talk, Sergey shared his expertise and insights on how AI is being used both positively and negatively during the COVID-19 global pandemic. He touched on topics such as the ethics of using this technology, and how it was implemented during each phase of the pandemic.

We know not everyone had the chance to tune in during the webinar, so we thought you’d be interested in having a look at the slide deck of his presentation.

You can check it out here.

If this was interesting for you, let us know in the comments, and we’ll do our best to try and provide more content like this. Keep an eye out for the final two talks in our webinar series — they might be of interest to you :)

Finally, don’t forget that this July, Sergey is teaching a course on the Cybersecurity of Cloud, Big Data, and AI. The course will be 100% online, so be sure to check it out on our website if you’re interested. Here’s the link.

That’s all from us!

Good luck in the round, and we’ll see you soon!

Congratulations to the winners:

Congratulations to the best hackers:

1115 successful hacks and 2003 unsuccessful hacks were made in total!

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

UPD: Editorial is out

Hi everyone!

I would like to invite you to my fifth Codeforces Round, that I set with my friends FastestFinger, Vivek1998299 and ridbit10.

We are excited to bring another contest within a week :D

With that said, I bring to your attention our new Codeforces Round 648 (Div. 2) that will take place on Jun/07/2020 17:35 (Moscow time). If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition.

I would really like to thank:

• FastestFinger, Vivek1998299 and ridbit10 for helping with preparing problems and giving new ideas.
• 300iq for coordinating our round.
• Um_nik, antontrygubO_o, ksun48, Jeel_Vaishnav, aryanc403, Savior-of-Cross, KonaeAkira, _Aaryan_, Ari, Devil, lavish315, AmShZ, Shuba_Buba and smartnj for testing the problems.
• the_hyp0cr1t3 and BarseSnow for testing as well as proofreading and making suggestions for the problems.
• MikeMirzayanov for Codeforces and Polygon platforms.

You will be given 7 problems and 2 hours 15 minutes to solve them.

Good luck! :D

The scoring distribution will be: $$$500 - 750 - 1250 - 1500 - 2000 - 2500- 3000$$$

Upd: Quick Editorial — Hope you guys enjoyed the contest :D

Hello Codeforces!

We have a pleasure to invite you to Codeforces Round #647 (Div. 1) and Codeforces Round #647 (Div. 2). This round will take place on Jun/04/2020 17:35 (Moscow time). In both divisions, you will have 2.5 hours to solve 6 problems. Three of them will be shared.

The problems for this round were prepared by MicGor, Grzmot, Okrut and me.

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

• budalnik for the excellent coordination;

• Lewin, sstrong for invaluable advice and extensive testing;

• KrK, yarek, -is-this-fft-, w0nsh, Marckess, Ari, Fortin, Dup4, craborac, 300iq, Sumeet.Shirgure, HIR180 for taking the time to test and providing useful feedback;

• MikeMirzayanov for great platforms Codeforces and Polygon.

We hope you will enjoy the problem set! Good luck!

UPD: Score distribution:

• Div 1: $$$500$$$ $$$-$$$ $$$1250$$$ $$$-$$$ $$$2000$$$ $$$-$$$ $$$2500$$$ $$$-$$$ $$$3000$$$ $$$-$$$ $$$3500$$$
• Div 2: $$$500$$$ $$$-$$$ $$$1000$$$ $$$-$$$ $$$1500$$$ $$$-$$$ $$$2000$$$ $$$-$$$ $$$2750$$$ $$$-$$$ $$$3500$$$

UPD: Editorial

UPD: Congratulations to the winners!

Div. 1:

• tourist
• Um_nik
• boboniu
• ecnerwala
• maroonrk

Div. 2

• rainboy
• Charbel
• icypiggy
• _khushi_
• KPATKOBPEMEHHOCTb

Below is a message for you from MikeMirzayanov:

With this round, we want to say thank you to Algo Muse for the significant contribution and support!

Algo Muse is an educational site that conducts online algorithmic contests in pen-and-paper style (no coding). It was originally started to help students prepare for theory qualifiers for graduate admissions. At present, the problems have a broader appeal, though occasionally an odd problem may require knowledge of linear algebra, probability, or group theory. The website is maintained by former students of IIT Bombay. To find out more, visit their website or their twitter account.

Hello!

Together with colleagues Schaffhausen Institute of Technology we hold such an event. If you want to study in Switzerland, then perhaps this is your chance!

— Mike

Hello, Codeforces!

We are thrilled to announce a new SIT STAR Contest by the Schaffhausen Institute of Technology in Switzerland. The winners will have a chance to get a fully-funded Master’s scholarship in Computer Science and Software Engineering.

What is the SIT STAR Contest?

The goal of the SIT STAR Contest is to promote interest in the field of Computer Science and Software Engineering, give students an opportunity to demonstrate their knowledge of programming, and be considered for a fully-funded graduate scholarship. You can apply to the contest here!

The SIT STAR Contest consists of:

1. June 1-7, 2020 | Practice: To familiarize yourself with the testing environment, you will first be granted access to a practice round. You can practice any time from 1st to 7th June 2020. This is an optional step but we highly recommend to take part in it. The results of this round won’t affect the final score.
2. June 17, 2020 | SIT STAR Contest: The final round will take place on 17th June. The participants will be given 4 hours to complete it.
3. June — July, 2020 | Interviews and Winners announcement: Top participants with the highest scores will be invited for the interviews with the professors from the Schaffhausen Institute of Technology.

The SIT STAR Contest will include 8-12 problems of various levels of difficulty in algorithmic programming.

Hi everyone!

I would like to invite you to my fourth Codeforces Round, which I have made with my friends FastestFinger and TheOneYouWant. In terms of problems, it is my favorite among all my rounds.

With that said, I bring to your attention our new Codeforces Round 646 (Div. 2) that will take place on 31.05.2020 17:35 (Московское время). If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition.

I would really like to thank:

• FastestFinger and TheOneYouWant for helping with preparing problems and giving new ideas.
• antontrygubO_o for coordinating our round
• 300iq, Jeel_Vaishnav, Ari, aryanc403, mahmoudbadawy, Vivek1998299, Uzumaki_Narutoo, Bakry, smartnj and Nikhil_Medam for testing the problems.
• MikeMirzayanov for Codeforces and Polygon platforms.

You will be given 6 problems and 2 hours to solve them. Scoring distribution will be announced later.

Good luck! :D

UPD: Scoring Distribution: $$$500-1000-1500-2000-2250-3000$$$

UPD2: Editorial (with memes, and detailed explanation) — Hope you guys enjoyed the contest! :D

Hello, Codeforces!

First and foremost, we would like to say a massive thank you to everyone who entered and submitted their answers to the first, second and third Kotlin Heroes competitions which were held previously. Congratulations to the top 3 winners:

Episode 1

1. Petr
2. ecnerwala
3. eatmore

Episode 2

1. tourist
2. eatmore
3. Benq

Episode 3

1. Egor
2. tourist
3. Benq

Ready to challenge yourself to do better? The fourth "Kotlin Heroes" competition will be hosted on the Codeforces platform on May/29/2020 17:35 (Moscow time). The contest will last 2 hours 30 minutes and will feature a set of problems from simple ones, designed to be solvable by anyone, to hard ones, to make it interesting for seasoned competitive programmers. Top three winners will get prizes of $512, $256, and $128 respectively, top 50 will win a Kotlin Heroes t-shirt and an exclusive Kotlin sticker, competitors solving at least one problem will enter into a draw for one of 50 Kotlin Heroes t-shirts.

Registration is already open and available via the link. It will be available until the end of the round.

The round will again be held in accordance with a set of slightly modified ICPC rules:

• The round is unrated.
• The contest will have 9 problems of various levels of complexity.
• You are only allowed to use Kotlin to solve these problems.
• Participants are ranked according to the number of correctly solved problems. Ties are resolved based on the lowest total penalty time for all problems, which is computed as follows. For each solved problem, a penalty is set to the submission time of that problem (the time since the start of the contest). An extra penalty of 10 minutes is added for each failed submission on solved problems (i.e., if you never solve the problem, you will not be penalized for trying that problem). If two participants solved the same number of problems and scored the same penalty, then those of them who had previously made the last successful submission will be given an advantage in the distribution of prizes and gifts.

If you are still new to Kotlin we have prepared a tutorial on competitive programming in Kotlin and a practice round, where you can try to solve a few simple problems in Kotlin. All the solutions are open, which means that you can look at the solution even if you haven't solved the problem yet. The practice round is available by the link.

We wish you luck and hope you enjoy Kotlin.

UPD: The editorial can be found here. Thank you for participation! I hope you enjoyed the problems.