→ Pay attention
→ Top rated
| # | 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 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 136 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Comments
|
0
Really Cool. Thanks for looking at the code! |
|
0
I'll keep that in mind from now. Thanks a ton! |
|
0
oh is it so? It's so frustating and unfortunate that python is slow. Thanks a lot! |
|
0
Oh, graph is a dictionary here (HashMap), constant lookup. |
|
0
Sir, it's not N^2. Could you please see my above reply to bleh0.5 |
|
0
Actually, the set size will never grow more than 3 elements (the inner loop). It looks N^2 but it's not |
|
0
It's the submission for C |
|
0
Could anyone please tell me why this was giving TLE? https://codeforces.me/contest/1325/submission/73271304 Thanks! |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/27/2026 02:37:59 (f1).
Desktop version, switch to mobile version.
Supported by
