九野的博客,转载请注明出处:http://blog.csdn.net/acmmmm/article/details/12318011
组合数:
公式递推代码
C(n, m) = C(n -1, m - 1) + C(n - 1, m)
C[1][0] = C[1][1] = 1;
for (int i = 2; i < N; i++){
C[i][0] = 1;
for (int j = 1; j < N; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]);
}
//