Find the minimum number of nodes to be removed to convert a graph into a tree.↵
↵
number of nodes < 1e5↵
↵
number of edges < 2e5↵
↵
Any help, please...
↵
number of nodes < 1e5↵
↵
number of edges < 2e5↵
↵
Any help, please...
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3976 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3482 |
| 8 | hos.lyric | 3382 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3357 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 157 |
| 5 | Dominater069 | 157 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 148 |
→ Find user
→ Recent actions
Convert a graph to a tree
Difference between en1 and en2,
changed 2 character(s)
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
b_like_karthik | 2024-07-18 12:12:59 | 2 | Tiny change: 'odes < 1e5\nnumber of ' -> 'odes < 1e5number of ' | |
| en1 |
|
b_like_karthik | 2024-07-18 12:12:04 | 174 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/12/2025 01:44:22 (g1).
Desktop version, switch to mobile version.
Supported by
