I absolutely tanked the last div1 + div2, dropping to candidate master. But the ratings are temporarily rolled back, so does this mean my participation in this current contest (div 2) is unrated even after ratings come back?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
I absolutely tanked the last div1 + div2, dropping to candidate master. But the ratings are temporarily rolled back, so does this mean my participation in this current contest (div 2) is unrated even after ratings come back?
I was looking at the Josephus Problem II in the CSES problem set, and couldn't find a c++ solution that didn't use ordered_set, which is not in the standard library. This made me wonder if I need to learn about other libraries to get good at cp. Any input appreciated.
Also if someone knows how to solve the Josephus Problem II only using the standard library please outline it for me ty
I'm reading through Competitive Programming 3, and the book recommends that you learn java on top of c++ to use biginteger. I don't know any java, so I don't know if it is worth it to learn just to use biginteger. I've never encountered a problem outside of the uva problem set that would be greatly simplified with biginteger, so I was wondering if any more experienced programmers could give some input. Thanks!
Name |
---|