| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | awoo | 158 |
| 4 | cry | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
Who can hack me in 1307D ???
I passed 1307D - Cow and Fields with code which is obviously wrong! Because I solve the promble in this way: - if k<7000 using the $$$O(n^2)$$$ algorithm. - else use a obviously fake algorithm which should be hacked.
Submission is here : 71566996
Who can hack me?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
JinhaiChen | 2020-02-21 20:51:38 | 2 | Tiny change: 'his way:\n- if k<7' -> 'his way:\n\n- if k<7' | |
| en1 |
|
JinhaiChen | 2020-02-21 20:51:03 | 303 | Initial revision (published) |
