| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
|
+1
think about Spoiler |
|
0
thanks) |
|
+64
hope to reach 1750+) |
|
+7
thanks for the info!) |
|
+20
|
|
+46
Uzbekistan:
Good luck to every participant! |
|
+30
hope for a good contest) |
|
+19
broo, hi!! ure that guy who wished me luck) hope u'll reach Expert soon! |
|
+32
it's because of Carrot extension, try to turn-off Carrot |
|
+22
bro just stop, ure losing ur reputation. or just use your main to comment. |
|
+29
|
|
+44
well, why wont u write it from your main (khba)? u knew, that after posting it soon u'll get downvoted, so u used ur alt to write this comment. but how i know, u also managed to upvote this comment from all your alts, u knew that after it u'll lose ur reputation. soo, good luck!) |
|
+45
bro, now u solve them within 5 minutes |
|
+16
tru |
|
+56
As a participant, hope to reach Expert!) |
|
On
Lavishe →
Could you please suggest some techniques and how to apply them to solve this problem?, 17 months ago
+9
what about Treap algorithm? |
|
0
thanks) |
|
+15
u mean, E unhackable? |
|
+29
congrats!! Wen IM bro) |
|
+12
hope to reach 1500+) |
|
+6
pain.. |
|
On
JeffLegendPower →
Anyone who comments under this post has to reach M by April or else..., 21 month(s) ago
0
orz |
|
0
hope to reach 1500+) |
|
0
thanks) |
|
0
finally, i did it |
|
0
sounds good) |
|
+8
dont judge a book by its cover) |
|
0
hope to reach Specialist!) |
|
+9
amazing contest |
|
0
u'll have a chance to change your handle only a week after registering, but near the new year you can also change your handle |
|
0
those who i know from Uzbekistan : Sunnatov , Timosh , heaven2808h , 0gur4ik and JahonaliX |
|
0
i'm 1/10 way there) |
|
On
IceKnight1093 →
Invitation to CodeChef Starters 165 (Rated upto 6 stars) — 18th December, 21 month(s) ago
0
hope problems are good) |
|
On
wuhudsm →
Invitation to TheForces Round #38 (Tree-Forces, TheForces Rated, Prizes!), 21 month(s) ago
0
as a tester, i'm a tester |
|
+11
Sunnatov Timosh Alfa 0gur4ik heaven2808h from Uzbekistan will win Izho 2025!! |
|
0
is there a link for the problem? |
|
+2
As a participant, i hope that problems are good) |
|
0
who said that unordered_map lets us access any element in O(1), this is a misconception. Worst case: O(n) Best case: O(1) So just use map instead, cuz map works O(log(n)) in any case |
|
+3
Segment Tree |
|
0
Sunnatov will win IOI 2024! |
|
+13
creator_by_kamroncik one of cheaters, who solved up to E in yesterday's contest |
|
0
good luck! |
|
+5
hope to reach Specialist in this contest! |
|
0
Another cry 's contest! I am glad to be a participant! |
|
+20
What happened with wxbqwq ? Why he became an unrated perticipant? |
|
+10
Thanks! |
|
0
If you want to solve problems by comparing your code with others, or just want to see test cases, I recommend the KEP.uz website. You can download the test cases in a zip version, but you will need KEPcoin to download them. You can collect KEPcoin by completing daily tasks. If you want to receive notifications about competitions, you can simply follow to NaZaR.IO's blog. He publishes a blog about all KEP.uz competitions on Codeforces. |
|
0
Congratulations!!! |
|
0
Finally, Reyna is back! |
|
On
Qingyu →
The 3rd Universal Cup Announcement (with Details of Upcoming Online and Onsite Event on June 23!), 2 years ago
-10
That's good. I will participate! |
|
0
thanks |
|
0
U mean it will be fixed? |
|
0
I agree with you, I lost 22 pts( |
|
0
Thanks you for good contest! I enjoyed it! |
|
0
Thanks for your opinion and attention! |
|
0
Hi, thanks for your answer and attention! But I have already solved problems in cses that are about Data Structs! I like your opinion! |
|
0
When will start System testing? |
|
0
tomato |
|
0
Yes it seems quite same, but I wrote it myself. I can prove you with everything. I don't know either of them. And there can be a reason when I blocked my solution. After someone in my room could block his solution, and just shared or gave my code to others, because he knows that if he will share his code his solution can be ignored. Please check this! I think you comprehended me, so thanks in advance! |
|
0
Hello dear Codeforces and MikeMirzayanov. I want to tell you that I got a message where it was said But I don't know one of them and task B was easy. I mean 8532 people solved task B, there can be solutions that are similar to each other. I want you to check my code again please. Check everything that you know, please! Thanks you in advance! |
|
0
thanks you! I hope we both will reach Pupil |
|
+1
I am gonna reach Pupil at this contest!! |
