| # | 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 |
|
On
PersistentLife →
As an CNOI Gold Medalist: How I Train CNOI Gold Medal Winning Competitive Programmers, 2 months ago
+17
CNOI GOLD >>>>>>> IOI GOLD |
|
+27
Now You are a CM and you can enjoy upvotes :) |
|
+6
26 |
|
-14
Read this : queue approach blog |
|
-21
I told best approach to escape queues but still some people post "Queueforces" |
|
+9
Hope to see grader in CF! |
|
+4
|
|
0
Good luck !! Also you can share your teammate Handles if you want. |
|
0
seems probable!! |
|
0
Good luck! |
|
-33
Tehran University team : AA_Surely , s.seraj.shafie, SarahLynn |
|
-32
AA_Surely(Tehran University) will win ICPC WF 2025! |
|
0
ABSOLUTELY!!! |
|
+8
|
|
On
ender_shayan →
Problem from Div1+Div2 Contest (July 20, 2025) — Tighter Constraints, Better Order, 16 months ago
0
Great idea! |
|
0
seems probable!! |
|
+5
Oh I am sorry! |
|
+5
Actually He is not a participant of IOI 2025! |
|
+10
I am sure at least He will become the best Gold Medal in Iran! |
|
0
Thanks!! |
|
+48
Hamed_Ghaffari will win IOI 2025! |
|
0
AA_Surely will win ICPC WF 2025. |
|
+11
actually you can first participate and then judge the contest. sweetweasel is my teacher and I am sure his contest will be fantastic. |
|
0
at least everyone can participate |
|
+10
The score distribution will be announced soon. When is 'soon'? |
|
-20
Wtf segment tree problem in D? It is bad |
|
On
thaonguyendethuongvai →
can somebody explain why my solution got TLE on some case: https://cses.fi/problemset/task/1670/ , 22 months ago
+44
You are LGM bro, you can solve the problem yourself :) |
|
+5
They forgot reason of being here! |
|
0
Farming contribution ??!! |
|
0
useful |
|
+3
AA_Surely will win ICPC |
|
+47
Who is Tourist tester????? |
|
+11
AmirAli-Asgari will win IOI 2024. |
|
0
I had the same problem! |
|
+5
stay expert |
|
+3
Me too |
|
0
Geometry + Constructive + implementation |
|
+8
It is a graph THEORY problem |
|
-43
share more useful content!!! |
|
+3
DP |
|
0
Try to reach pupil first |
|
0
They are being judged now :) |
|
0
Why can't you recognize colors? Is Mhn_Neek cyan???? |
|
0
Sorry Quera lover! |
|
0
Toxic teachers toxic alireza's |
|
0
I know but he loves Quera |
|
0
Go and practice in quera:))) |
|
-20
Fast Editoral |
|
0
when u solve a problem in a group it doesn't count for others |
|
0
It was helpful. Thanks! Can somebody debug my code? I used the similar idea. https://codeforces.me/contest/1922/submission/242316177 |
|
0
You must learn English and coding first :)) |
|
+8
You can use heap but it is O(log n) for each. I think it is the best for your need. |
|
0
Easy A,B,C problems. |
|
+3
Hi! I can come too |
|
+1
Fast tutorial! |
|
-7
Isn't it a bit late for not putting Editorial? |
