How Many Trees?_BST递推_2018_2_20

How Many Trees?

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

The balanced binary tree is defined recursively as follows:

1. The difference in the depth of its left child tree and right child tree is at most 1.

2. Its left child tree is a balanced binary tree.

3. Its right child tree is also a balanced binary tree.

Now it is your job to calculate the number of balanced binary trees with given number of nodes and leaves.

Input

The input consists of multiple tests. Each test consists of 2 numbers n and m in a single line, the number of the nodes and the number of leaves. (0 < m <= n <= 20)

Output

The number of balanced binary trees which have exactly n nodes and m leaves.

Sample Input

5 2
15 9

Sample Output

4
0

---

Author: TANG, Jiqing

Source: ZOJ Monthly, December 2002

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
ll d[21][21][15];

ll solve(int n,int m,int k){
	ll ans=0;
	for(int i=0;i<n;i++)
	for(int j=0;j<=m;j++){
		ans+=d[i][j][k-2]*d[n-1-i][m-j][k-1];
		ans+=d[i][j][k-1]*d[n-1-i][m-j][k-1];
		ans+=d[i][j][k-1]*d[n-1-i][m-j][k-2];
	}
	return ans;
}

int main(){
	d[1][1][1]=d[0][0][0]=1;
	for(int i=2;i<=20;i++)
	for(int j=1;j<=i;j++)
	for(int k=2;k<=7;k++){
		d[i][j][k]=solve(i,j,k);
		//printf("%d %d %d %d\n",i,j,k,d[i][j][k]);
	}
	int n,m;
	while(~scanf("%d%d",&n,&m)){
		ll ans=0;
		for(int i=1;i<=7;i++)
		ans+=d[n][m][i];
		printf("%d\n",ans);
	}
}