通过递推公式计算单个
- 组合数递推公式:C(n,m) = C(n - 1,m) + C(n - 1,m - 1)
- C(n,m) = C(n,n - m)
long long res[67][67] = { 0 };
long long C(long long n, long long m) {
if (m == 0 || m == n)
return 1;
if (res[n][m])
return res[n][m];
res[n][m] = C(n - 1, m) + C(n - 1, m - 1);
return res[n][m];
}
通过递推公式打表
#define MAXN 67
long long res[MAXN][MAXN] = { 0 };
void calC() {
for (int i = 0; i < MAXN; i++) {
res[i][0] = 1;
res[i][i] = 1;
}
for (int i = 2; i < MAXN; i++) {
for (int j = 0; j <= i / 2; j++) {
res[i][j] = res[i - 1][j] + res[i - 1][j - 1];
res[i][i - j] = res[i][j];
}
}
}
参考
《算法笔记》(胡凡)