I am litle shiny cute girl, AMA
→ Pay attention
Before contest
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
40:08:58
Register now »
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
40:08:58
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
→ Find user
→ Recent actions
deleted:
Hi codeforces
Do you know how to optimize Dijkstra Algorithm to O(n)? and is it posible?
Hello codeforces
Codeforces Round 891 (Div. 3) where hacks? why now is System testing? Can explain what it is?
Thank you
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/29/2024 01:26:03 (h2).
Desktop version, switch to mobile version.
Supported by
