Codeforces Beta Round #9 (Div. 2 Only)D

短小精悍的代码

dp[i][j] +=dp[k][j-1]*[i-k-1][j-1] i个结点 J层

#include <iostream>
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
using namespace std;
#define LL __int64
LL dp[40][40];
int main()
{
    int i,j,k,n,d;
    scanf("%d%d",&n,&d);
    for(i = 0; i <= n ; i++)
    dp[0][i] = 1;
    for(i = 1; i <= n ; i++)
    {
        for(j = 1; j <= n ; j++)
        {
            for(k = 0 ; k < i ; k++)
            dp[i][j]+=dp[k][j-1]*dp[i-k-1][j-1];
        }
    }
    printf("%I64d
",dp[n][n]-dp[n][d-1]);
    return 0;
}