RMI 2025 is taking place on November 26-28 in Bucharest.
Let's use this blog to discuss problems and share solutions after each contest day. We would also very much appreciate your feedback :)
UPD1: First contest day is finished.
Problems:
UPD2: Second contest day is finished.
Problems
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
As a participant, I don't know the subjects.
I knows only the basics , but the problem was difficult for the to solve.
What is the solution to day 1 problem 2?
Tomorrow is the first day :)
It was a great contest, we didn't have the tasks, but luckily I guessed them and AK in ~30min
Is there an online mirror?
Hello, nothing planned unfortunatelly.
Is there going to be an editorial after the contest finishes (unlike the previous year)?
Auto comment: topic has been updated by tibinyte2006 (previous revision, new revision, compare).
Is there a scoreboard after day 1
Yes
Am I missing something? I can't find it on the website.
RMI Contest > ResultsFrom the left side list
Oh wow, apparently it was locally cached since I looked at it earlier today. Thanks.
How to solve problem guess permutation 😨
Maybe ask the author, TimDee
all my homies hate gimi gugustiuc
agree
I love gimi :((
Are day 2 results available anywhere / do you know when they will be uploaded?
Hello, they should be available on the website.
Hos to solve problem King of Rats 🇷 tibinyte2006
If we add two blocks of $$$0$$$ at the end of the matrix like:
$$$.......0$$$
$$$.......0$$$
then the number of $$$1$$$-component is the number of time we transition from a $$$1$$$-component to a $$$0$$$-component (from left to right).
There are only $$$5$$$ $$$2 \times 2$$$ blocks that will always cause a transition (and only these block causes a transition):
$$$10$$$ $$$10$$$ $$$01$$$ $$$10$$$ $$$00$$$
$$$10$$$ $$$01$$$ $$$10$$$ $$$00$$$ $$$10$$$
So the task becomes counting the expected value of the amount of these blocks in a matrix (which you can easily count by contribution of each block of each position).
(sorry I don't know how to format blocks)
How to solve CheapAi?
Is there any site where we can upsolve?