105860386 If I'm not mistaken the complexity of this code is O(n) with 1 <= n <= 10^9 . Please explain to me !!. Thank you.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Here
Ok I got it thanks you
Amazing compiler~~~
Check this — 106281265
"tle" doesn't effect the answer, so the compiler ignored it.
Maybe he added it on purpose to make others hack it. My friend has been tricked. Ha ha!
Actually that's my code. I was trying to show that even o(10^18) will not get tle.
So whats the reasn for that?
already answered
Check this: https://codeforces.me/contest/1398/submission/90016644
O(n^2) solution passed in 1.6sec for 1<=n<=10^5.