Hello, Codeforces!
First and foremost, we would like to say a massive thank you to everyone who entered and submitted their answers to the seven Kotlin Heroes competitions which were held previously: Episode 1, Episode 2, Episode 3, Episode 4, Episode 5: ICPC Round, Episode 6, and Episode 7.
Ready to challenge yourself to do better? The Kotlin Heroes: Episode 8 competition will be hosted on the Codeforces platform on 07.10.2021 17:35 (Московское время). 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.
Prizes:
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 10 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 Kotlin Heroes: Practice 8, where you can try to solve a few simple problems in Kotlin. The practice round is available by the link.
And last but not the least: two-time ICPC World Champion and winner of four previous Kotlin Heroes episodes Gennady tourist Korotkevich will be featured in a livecoding session, conducted by JetBrains, where he is going to show how to solve the problems from the Practice round, so you can learn how to use Kotlin in contests from the most famous competitive programmer in the world. The JetBrains Presentation and livecoding session from Gennady will be streamed on ICPC Live and Kotlin YouTube channel. The stream starts at 10 a. m. on the 2nd of October, Moscow time (UTC+3), you can join the stream by the link.
We wish you luck and hope you enjoy Kotlin.
Comment about not getting Kotlin Heroes 7 t-shirt goes here
.
_
It will be more polite to avoid such messages under new KH announce post. I can definitely say, that Mike made all that he could to send your gift for you already. But here in Russia we have some very specific part of our lifestyle — it is Russian Post. This organization can deliver any packages for a years... may be even decades. So if you get your t-shirt in 5 years — well you are lucky guy.
Just a heads up, there's a small error in the announcement:
Anyhow, looking forwards to this contest!
Holy shit, they do this since Kotlin Heroes 6 announcement
I think variables should be defined inside the text for these things
Is it rated?
No. It's unrated.
Heroes needn't be rated!
Which plugin was the tourist using to parse the contest?
Edutools plugin I believe.
But I can't get it to work — when I try to load a Kotlin round it says no language available, even though the Kotlin plugin is installed on the IDE.
Does anyone know what I'm doing wrong??
:)
How to solve 1570H - Chainword?
The practice contest uses problems from old contests from Codeforces.
So you are basically asking solution to this problem.
I hope you enjoyed Kotlin and our problems!
The current version of the editorial is available here. I'll post an official editorial later.
You can do G without any sort of max BIT by using a TreeSet invariant, similar to LIS. 131088882
Is there a set in Kotlin? My I failed during the contest cause MutableSet turned out not to be a set (or maybe it is and I'm just dumb and can't use it properly) and I couldnt google anything in 5 minutes. I later realized that there is a priority queue and I could have used that for this problem but I'm still interested about the set.
MutableSetis the same as C++'sunordered_set. You can use TreeSet (imported fromjava.util) for an ordered set.Alright, tried it and it works, thank you! I guess I'm bad at fast googling)
who won the t-shirts
Later there will be a post in which there will be 50 random winners, now you can only wish everyone Good Luck))
I have received this notification :D
Whatever it is don't give your credit card details...Me: Oh, that's a new contest. Also me whho don't know Kotlin: Well, i will try to do this another time.