catalan numbers related problem

Правка en1, от MrAutro, 2019-07-29 02:43:29

Hello I managed to understand the problem and what it needs but my idea is to use Catalan numbers to count number of binary trees but in problem it wants to count the number of BS trees of length n with height at least h and root and leafs included but I could not discard or exclude all count of trees of height less than h from Catalan numbers

Any hint please I will be thankful and grateful and thanks in advance

https://codeforces.com/problemset/problem/9/D

Теги #dp, #combinatorics

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский MrAutro 2019-07-29 21:01:58 25
en1 Английский MrAutro 2019-07-29 02:43:29 498 Initial revision (published)