组合数C满足递推公式
C(n, m) = C(n -1, m - 1) + C(n - 1, m)
代码如下:
void getc ()
{
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]);
}
}
组合数C满足递推公式
C(n, m) = C(n -1, m - 1) + C(n - 1, m)
代码如下:
void getc ()
{
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]);
}
}