HDU3240 Counting Binary Trees (卡特兰数,拓欧求逆元)
Counting Binary Trees HDU
- 3240
There are 5 distinct binary trees of 3 nodes:
Let T(n) be the number of distinct non-empty binary trees of no more than nnodes, your task is to calcu
原创
2017-07-26 21:11:22 ·
549 阅读 ·
0 评论