之前一直不明白组合数怎么求出来的(指代码),今天顿悟了,写个blog记录一下
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
int choose[3000][3050];
signed main()
{
for(int i = 0; i < 3000; i++)
{
choose[i][0] = choose[i][i] = 1;
for(int j = 1; j < i; j++)
{
choose[i][j] = choose[i - 1][j - 1] + choose[i - 1][j];
if(choose[i][j] >= MOD)
choose[i][j] -= MOD;
}
}
int a,b;
cin>>a>>b;
cout<<"C a b = "<<choose[a][b]<<endl;
return 0;
}
用C 9 7来举列子的话,choose[i - 1][j - 1]
等于 7/9 份C 9 7(少乘一个9,少除一个7),choose[i - 1][j]
等于 2/9 份C 9 7(少乘一个9,少除一个2),所以choose[i][j] = choose[i - 1][j - 1] + choose[i - 1][j];