1.杨辉三角(队友懂的真多)
cc数组,cc[10][1]代表组合数c(10,1)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int mod = 999999999;
int main()
{
int cc[510][510];
for(int i = 0; i <= 500; i++)
{
cc[i][0] = cc[i][i] = 1;
for(int j = 1; j <= i - 1; j++)
{
cc[i][j] = (cc[i - 1][j - 1] + cc[i - 1][j]) % mod;
}
}
return 0;
}
2、线性求组合数(递推)
c(k,n) = ((n - k + 1) / k) * c(k - 1,n)