Can anyone help me to understand the logic behind this problem.Thanks https://www.hackerearth.com/practice/algorithms/graphs/min-cut/practice-problems/algorithm/mancunian-the-confectioner/editorial/
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | Um_nik | 151 |
| 7 | djm03178 | 151 |
| 9 | luogu_official | 149 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Max Flow Problem — Mancunian, The Confectioner (Hackerearth)
Revision en1, by himanshu219, 2018-06-12 16:08:24
History
Revisions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/12/2025 22:45:53 (h1).
Desktop version, switch to mobile version.
Supported by
