| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
|
0
|
|
+10
|
|
+33
Thank you Pyqe for carrying |
|
+18
Only 30 minutes until TROC 27! GLHF Everyone ❤️ |
|
+9
G is a harder version of this problem |
|
+29
"A Participant choosing to participate in both divisions could win prizes in both divisions. Limit one (1) prize per division per Participant.". So, is it possible that best 50 in both divisions is exactly the same? |
|
The broken statement is only at English statement, if im not mistaken. |
|
Do you know the cutoff for the medalists? |
|
+8
Even through all the stress, you made it to the next stage of IOI selection, congrats man! |
|
0
What do you do in your spare time? |
|
+35
|
|
0
now |
|
0
You should try this 7 0 3 0 5 1 4 2 The correct answer is 2, not 3. |
|
0
Lazy Propagation 1114F — Please, another Queries on Array? |
|
0
I did it in O(N+26), my submission : 66916571 |
|
0
Spent almost 1 hour find O(N) solution in div2B because didnt realize that solution O(N^2) will pass :( |
|
On
ch_egor →
Codeforces Round #583 (based on Olympiad of Metropolises) (div. 1 + div. 2), 7 years ago
+4
|
|
0
Welcome to Speedforces!! |
|
+17
calm down... |
|
0
Are there statistics for this round? |
|
+7
Im sorry all Blackpink Members :( |
|
0
Jennie Blackpink and Lisa Blackpink will get angry if they see this post. |
|
+19
To become blue, you need to join the contest |
|
0
My Friend Handle in CF : julianfernando Submissions : His submissions in Qual GCJ 19 He solve using string :) |
|
0
Good Luck and Have Fun all!! |
