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
Before contest
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
*has extra registration
Before contest
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ 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-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/01/2026 17:42:40 (g2).
Desktop version, switch to mobile version.
Supported by
