Hello Codeforces! How can I count the number of paths with length less than k in a tree? Please provide a solution without centroid decomposition. Thank you in advance!
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | Petr | 145 |
→ Find user
→ Recent actions
The number of paths in a tree with length less than k
Revision en1, by MaksatNIS9, 2021-01-02 11:09:17
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| ru1 |
|
MaksatNIS9 | 2021-01-02 11:10:08 | 192 | Первая редакция перевода на Русский | |
| en1 |
|
MaksatNIS9 | 2021-01-02 11:09:17 | 221 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/13/2024 10:38:24 (j1).
Desktop version, switch to mobile version.
Supported by
