Easy Tree DP?

A Bear tree is a binary tree with such properties : each node has a value of 2⁰,2¹…2^(N-1)(each number used only once),and for each node ,its left subtree’s elements’ sum<its right subtree’s elements’ sum(if the node hasn’t left/right subtree ,this limitation is invalid).
You need to calculate how many Bear trees with N nodes and exactly D deeps.

First a integer T(T<=5000),then T lines follow ,every line has two positive integer N,D.(1<=D<=N<=360).

For each test case, print "Case #t:" first, in which t is the number of the test case starting from 1 and the number of Bear tree.(mod 10⁹+7)

2
2 2
4 3

Case #1: 4
Case #2: 72

smxrwzdx@UESTC_Brightroar

2012 Multi-University Training Contest 6