We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
What do you mean by non-isomorphic trees? Isomorphism is defined on two trees. Do you want the size of the set of trees for which no pair of trees are isomorphic?
When will this problem be posted on the open challenges on the main part of the website?
I'm looking for a solution written in C++, couldn't find one so far. If you have one, could you please share it with me?
How is the hash in the editorial calculated?
What do you mean by non-isomorphic trees? Isomorphism is defined on two trees. Do you want the size of the set of trees for which no pair of trees are isomorphic?
Yes. You need to find the size of the largest set of subtrees of the given tree, for which no two trees are isomorphic.
Quite a problem you have here, the graph isomorphism problem is NP-hard. I'm looking forward to see the editorial on this one
Look at the constraints.