| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 162 |
| 3 | adamant | 161 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 8 | SecondThread | 146 |
| 8 | TheScrasse | 146 |
| 10 | Petr | 145 |
I made a video editorial for CF1923E : Count Paths discussing the DP solution that acts as the foundation of the small to large trick.
Youtube Link : https://youtu.be/D454rHDUb6E?si=FtfBwoKG3_p-8m7f
I also created practice contest with easy problems:
How do you learn these advanced algorithms and techniques
I wouldn't say it's an advanced concept as such. It's standard DP on Trees, which can be learnt from resources such as CP-Algorithms, USACO Guide and CF Blogs.