Hello. What were your scores for day 1 in Romanian Masters of Informatics?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/26/2026 03:33:21 (g2).
Desktop version, switch to mobile version.
Supported by
189(
$$$134$$$ :(
day 2: 157) i’ve solved task A but not B and C which are easier lmao, same like the first day
Have you solved A with merge sort tree?
Nope, it is the first contest where i’ve used segment tree beats)
Does $$$O(n \log^3(n))$$$ get AC or do you have a better solution?
150
Sho did your cp girlfriend help you at RMI 2021?
61 ((
What are your results for day 2? I have 61 as well, same as day 1.
$$$169$$$
98
Day1: $$$140$$$
Day2: $$$161$$$
94
61, my n(n+k)log solution on the third got WA :)
Me :
Kitsune
Day 1: 98 Day 2: 161 (or 169, I didn't see the result on my last submission)