| # | User | Rating |
|---|---|---|
| 1 | tourist | 3892 |
| 2 | jiangly | 3797 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3588 |
| 6 | ecnerwala | 3557 |
| 7 | Ormlis | 3532 |
| 8 | Benq | 3468 |
| 9 | Radewoosh | 3463 |
| 10 | Um_nik | 3450 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 2 | Qingyu | 159 |
| 3 | -is-this-fft- | 158 |
| 3 | atcoder_official | 158 |
| 5 | Dominater069 | 155 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 150 |
| 9 | awoo | 148 |
| 10 | maomao90 | 145 |
I have to surpass Karim__2 's rating before EGOI 2025 which is in 4 months exactly, reaching specialist is a sub-goal I aspire to achieve 2 months before the deadline above. Sub-rules:
— Participate in every contest I can participate in
— Reach specialist (expert?)
I'm greeeeen!!!!!!!!!!!!!
I would like to find ways I can look up the smallest element bigger than X that doesnt exist in a vector/set, without having to deal with TLE risks, if that is possible
