
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 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 | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Hello Codeforces!
Halloween is coming up soon, and I have no idea what a good costume would be. Last year, I was a segment tree.

Well, it is now a new year, so it is time for a new costume. I've decided to be whatever the most upvoted comment (with my approval) suggests me to be. I'm expecting competitive programming related responses.
I'll make sure to share my costume for this year once it's created.
I love you segment tree❤️❤️❤️

Dear Segment Tree, You are such a wonderful data structure! I love being able to obtain results for range queries in $$$O(\log(n))$$$. You are so optimized. Though you are insecure of your laziness, I find it beautiful how I can lazily propagate range updations. You also have wonderful beats- what a musician! Thank you for being such a wonderful data structure! I truly cannot get my mind off you!
| Name |
|---|


