Hello Codeforces,
\section{Introduction} I came across this problem a while back — https://cses.fi/problemset/task/1139/. Here the task is — "Given a rooted tree, determine the number of ditinct elements for each subtree of the tree".
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | nik_exists | 147 |
| 4 | Um_nik | 145 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | DNR | 132 |
| 8 | BledDest | 132 |
| 8 | AmShZ | 132 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
shadow9236 | 2022-05-21 09:59:32 | 0 | (published) | |
| en6 |
|
shadow9236 | 2022-05-21 09:58:27 | 6 | ||
| en5 |
|
shadow9236 | 2022-05-21 09:57:01 | 43 | Grammar | |
| en4 |
|
shadow9236 | 2022-05-21 09:52:36 | 44 | ||
| en3 |
|
shadow9236 | 2022-05-21 09:49:39 | 2815 | Tiny change: 'Thanks to @-is-this-f' -> 'Thanks to /profile/-is-this-f' | |
| en2 |
|
shadow9236 | 2022-05-21 09:17:42 | 529 | ||
| en1 |
|
shadow9236 | 2022-05-21 09:10:06 | 272 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/09/2026 12:04:50 (g2).
Desktop version, switch to mobile version.
Supported by
