→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 144 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 6 | AmShZ | 137 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Comments
|
On
shaeekhshuvro →
(Update-Solved) Help needed for Lightoj 1201 (problem on biparite matching), 7 years ago
0
Yes, the max won't matter here..printing n-min cover is enough. I wasn't sure about this then :( |
|
On
shaeekhshuvro →
(Update-Solved) Help needed for Lightoj 1201 (problem on biparite matching), 7 years ago
0
Thank you everyone. I've found the bug. I should've returned 0 instead of 1 in the recursive function |
|
0
That was sarcasm you dumbhead |
|
On
ivplay →
getting WA need help (lighoj1390 - Weight Comparison) (Category: Cycles, Topological Sorting, Strongly Connected Component), 9 years ago
0
Have you been able to figure it out?I'm struggling in this proble |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/27/2026 08:05:20 (g2).
Desktop version, switch to mobile version.
Supported by
