| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 2 | adamant | 163 |
| 4 | nor | 151 |
| 4 | maroonrk | 151 |
| 4 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
A question about time complexitiy
In Codeforces Round 635 (Div. 2) ,I tried to hack this submission 76834239 but failed.
His time complexity seems to be $$$O(Td)$$$
The hack I used was
$$$1000$$$
$$$1\space 1 \space 1\space 10^9$$$
$$$1\space 1\space 1\space 10^9$$$
$$$1\space 1\space 1\space 10^9$$$
$$$\dots$$$
Why would this fail?
Does it have something to do with the language he chose?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
tianxiawoyou | 2020-04-16 03:35:10 | 398 | Initial revision (published) |
