| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3977 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3483 |
| 8 | hos.lyric | 3381 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3358 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 159 |
| 5 | djm03178 | 157 |
| 5 | Dominater069 | 157 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 8 | awoo | 152 |
| 10 | TheScrasse | 148 |
A interesting puzzle
Some straight lines are drawn on a piece of paper, none of which are parallel to each other and have no points of intersection where more than two lines intersect. What is the minimum number of lines that can be drawn to ensure that the paper is divided into at least 2024 parts?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
arifin_fuad_kashfy | 2025-01-07 21:32:10 | 355 | Initial revision (published) |
