CF 9D. How many trees?(dp)

题目链接

以前做过类似的，USACO，2.3，开始数组开小了，导致数据乱了，然后超数据范围了，。。

#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;
#define LL __int64
LL dp[101][101][101];
LL c[71][71];
int main()
{
    int i,j,n,k,u,h;
    for(i = 0; i <= 70; i ++)
    {
        c[i][0] = 1;
    }
    for(i = 1; i <= 70; i ++)
    {
        for(j = 1; j <= 70; j ++)
            c[i][j] = c[i-1][j-1] + c[i-1][j];
    }
    dp[1][1][1] = 1;
    scanf("%d%d",&n,&h);
    for(i = 1; i < n; i ++)
    {
        for(j = 1; j <= n; j ++)
        {
            for(k = 1; k <= n; k ++)
            {
                if(dp[i][j][k] == 0) continue;
                for(u = 1; u <= 2*k; u ++)
                    dp[i+1][j+u][u] += c[2*k][u]*dp[i][j][k];
            }
        }
    }
    LL ans = 0;
    for(i = h; i <= n; i ++)
    {
        for(k = 1; k <= n; k ++)
        {
            ans += dp[i][n][k];
        }
    }
    printf("%I64d
",ans);
    return 0;
}