| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hey guys!
I've made a video editorial for problem D of today's contest, so that you can visualize the steps of the constructive algorithm if you were interested or perhaps struggling to understand from the text.
As always, please let me know if you have any suggestions, so that I can try and improve my video editorials!
Thank you!
Thank you for the video! The visualization really helped me to understand what the algorithm was
No problem!
Amazing video editorial! After grappling with this problem in-contest for an hour to no avail, I immediately (literally, immediately) saw what I had missed.
Maybe for the less experienced/those who haven't tried out the problem as long, you could elaborate on exactly how the algorithm works at 1:45 (every time you see a non-matching bit, shift the 1 to that position to flip it) as well as at 3:37, as it's not immediately evident that you can still apply the algorithm when the first few bits don't match. But those are fine as is, most viewers will be able to deduce those two ideas on their own.
You have earned yourself a subscriber (and hopefully many more).
Thank you so much!