Approach 1: Counting, Prufer Code Theorem to find number of trees possible with n nodes
Approach 2: Bitmask DP
Statistics
67%
Solution Ratio
YouKnowWhoEarliest,
YouKnowWhoFastest, 0.0s
YouKnowWhoLightest, 131 kB
ovis96Shortest, 545B
Approach 1: Counting, Prufer Code Theorem to find number of trees possible with n nodes
Approach 2: Bitmask DP
