C++ 实现组合数

vector<vector<int>> c;
c.assign(n, vector<int>(n));
c[0][0] = 1;
for (int i = 1; i < n; ++i) {
    c[i][0] = 1;
    for (int j = 1; j < n; ++j) {
        c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
    }
}