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
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ 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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/19/2024 09:25:46 (l2).
Desktop version, switch to mobile version.
Supported by
