int combi(int n, int m){ //求组合数的函数 int res = 1; for(int i = 0; i < m; ++i) { res *= n - i; res /= i + 1; } return res; }
#define MAXN 20 int C[MAXN][MAXN]; int n; int main() { scanf("%d", &n); for(int i = 1; i <= n; ++i) { C[i][0] = C[i][i] = 1; for(int j = 1; j < i; ++j) { C[i][j] = C[i-1][j-1] + C[i-1][j]; } } return 0; }
原文：https://www.cnblogs.com/FengZeng666/p/13929966.html