Hello Codeforces!
I'm excited to invite you to Weekend Practice round #13 , taking place on 9th November, at 14:00 UTC. This is a rated contest at Eolymp.
Format and Difficulty
Same as in previous rounds, the competition is primarily aimed at improving practical skills. There will be $$$2$$$ hours for $$$5$$$ tasks of varying difficulty, the easiest of which can even be solved by beginners.
The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made earlier will be ranked higher in the leaderboard.
The statements will be available in the following languages: English, Ukrainian, Azerbaijani, Russian.
One of the problems will be interactive so please make sure to be familiar with them.
Registration
You can join the competition on the competition page.
Prizes
The top-10 participants of the competition, as well as 10 random participants from those who rank from 11th to 100th place, will receive prizes in the form of t-shirts. Please, note, that we have changed how prizes are awarded,
Visit Frequently Asked Questions section to learn more.
Credits
- MathModel For Coordinating The Round 😎.
- De3b0o for authoring problems 🔥 .
- Sergey Kolodyazhnyy for creating Eolymp 😎.
- Denisov for Ukrainian and Russian Translations.
- Denisov , kimononawa , JuicyGrape , edogawa_something , Pa_sha , Haidora , 0pt1mus23 for testing the contest.
Scoring
Congratulations to Winners $$$!$$$ :
Congratulations to First Solvers $$$!$$$ :
A : hieptk
B : physics0523
C : physics0523
D : liympanda
E : NA









Best way to spend weekend, let's compete!!
This time conflicts with the ARC.
Any specific reason this is not held in original time? Normally it's 3 hours later.
Hi ! , Thanks for bringing this to my attention.
Fixed !
We're looking forward for your participation !
Auto comment: topic has been updated by MathModel (previous revision, new revision, compare).
Auto comment: topic has been updated by MathModel (previous revision, new revision, compare).
The problems are very nice and challenging. Hope to see you there!
As a tester, Orz De3b0o.
As a tester, De3b0o is genius.
Contest starts in $$$3$$$ hours.
Contest starts in $$$2$$$ hours.
Contest starts in $$$1$$$ hour.
screencast: https://youtu.be/NgoL96DxnvA
How to get full for task E?
Close to your dp solution, but in the optimal solution u won't multiply by x more than log(z) times if you've already multiplied by y more than log(z) times (and the same otherwise), and since the max answer is 1e11 u just do dp[log][500000] and dp[500000][log].
Hi , Congrats on the Win !
Editorial writeup will be up soon.
Problem A
Problem B
Problem C
Problem D
Problem E