How to form a k-nary tree with x nodes.
Is there any way to find whether a k-nary tree(need not be perfect or complete) which have x nodes exists or not. If exits then how to find it.
→ Pay attention
→ 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 |
| 3 | atcoder_official | 161 |
| 5 | djm03178 | 157 |
| 5 | Dominater069 | 157 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 148 |
→ Find user
→ Recent actions
How to form a k-nary tree with x nodes.
Revision en1, by noob_master, 2020-01-09 16:57:57
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
noob_master | 2020-01-10 09:02:17 | 7 | ||
| en3 |
|
noob_master | 2020-01-10 09:00:49 | 61 | ||
| en2 |
|
noob_master | 2020-01-09 16:59:08 | 18 | ||
| en1 |
|
noob_master | 2020-01-09 16:57:57 | 233 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/12/2025 18:11:39 (h1).
Desktop version, switch to mobile version.
Supported by
