| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hey! Wanted to share a beautiful combinatorics problem — the best short-answer problem I've seen recently. Try it when you have 15 minutes to spare since your submission will be timed :)
Beautiful Combinatorics Problem
Hope you all enjoy! There is a solution on the 'post-contest' screen.
Hmmm, not suspicious at all...
I added it onto the site as a contest because of how beautiful it was haha
348D - Turtles
More generally, see the LGV Lemma
Yep, it's very nice
It is pretty cool. It reminds me of another one I saw that went like this:
You are an archer and you have to pop three columns of balloons. One column contains $$$2$$$ balloons and the other two columns contain $$$3$$$ balloons. You can pop a balloon from any column, but unfortunately, you can only pop the bottommost balloon in some column. In how many different ways can you pop all the balloons?
mine is this