How to solve the last problem? Link
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 162 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/18/2024 00:59:16 (h1).
Desktop version, switch to mobile version.
Supported by
Find number of distinct subtrees (non isomorphic rooted) of second tree. Find number of distinct leaves in first subtree. The answer is product of both of them.
Note: distinct leaves means that one cannot act as substitute for another(Bad explanation).
To find distinct subtrees or distinct leaves ,use hashing (strong one ,easy ones are hacked)
There are some details left to work on your own. refer to the code for help.
My code for reference: Here
How to solve second last problem?
one)
(equal
problem statement not visible bro!