can some1 explain me the two test cases of this question.. http://codeforces.com/problemset/problem/9/D..
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
can some1 explain me the two test cases of this question.. http://codeforces.com/problemset/problem/9/D..
Название |
---|
On the first sight I thought there is a problem which requires 9-Dimensional Segment Trees. LOL :D
First of all, your link to the problem isnt correct. I think you meant this.The task in simple english is :
Given n ( no. of distinct nodes) and h (the minimum height) , you need to print the number of binary search trees possible. For sample case 1, the no. of distinct nodes is 3 and the minimum height required is 2. So the following 5 BST are possible.![](/predownloaded/9f/dd/9fdd8376ab2be05954b49c2bd4f3434ac9a79846.png)
I hope the problem is clear now.