| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | cry | 158 |
| 4 | atcoder_official | 156 |
| 4 | nor | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 153 |
| 7 | adamant | 153 |
| 7 | Um_nik | 153 |
| 10 | djm03178 | 146 |
Help with last Div3 Problem H
Editorial says Let's fix one x and try to solve this task for it.
okay makes our time complexity q*(something), moving on...
How to find number of i that ai mod x ≤ m for some m
We can use binary search of some sort, making our complexity
q*log(x)*checkerForM, how in the world is this complexity not TLE
Can anyone explain it to me.
