The "minimum number of streets to block" directly redirects us to Max Flow Min Cut Theorem.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en8 |
|
ved_226 | 2025-09-01 19:44:07 | 78 | ||
| en7 |
|
ved_226 | 2025-09-01 19:36:13 | 0 | (published) | |
| en6 |
|
ved_226 | 2025-09-01 19:35:21 | 67 | ||
| en5 |
|
ved_226 | 2025-09-01 19:34:28 | 230 | ||
| en4 |
|
ved_226 | 2025-09-01 19:30:33 | 21 | ||
| en3 |
|
ved_226 | 2025-09-01 19:27:47 | 1259 | ||
| en2 |
|
ved_226 | 2025-09-01 19:14:02 | 467 | Tiny change: 'ut Theorem.**' -> 'ut Theorem**' | |
| en1 |
|
ved_226 | 2025-09-01 19:08:12 | 107 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/20/2026 18:28:18 (g2).
Desktop version, switch to mobile version.
Supported by
