for (i = c[0][0] = 1; i <= n; i++)
for (j = c[i][0] = 1; j <= i; j++)
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
for (i = c[0][0] = 1; i <= n; i++)
for (j = c[i][0] = 1; j <= i; j++)
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
本文标题:组合数
本文链接:https://www.haomeiwen.com/subject/gxtuvktx.html
网友评论