方法1:(只能用于较小数字,当采用n:20,k:2或其他组合时,计算错误)eg:不知道为什么;
C(n,k)=n!/(n-k)!*k!(这个公式为什么不可以呢?)
#include <iostream>
using namespace std;
unsigned n, k, m, s, f, w;
unsigned fac1(unsigned s) {
if (s == 0)
f = 1;
else
f = fac1(s - 1) * s;
return f;
} //设置阶乘函数fac1
unsigned fac2(unsigned n, unsigned k) {
if (n == k || k == 0)
m = 1;
else if (k > n)
m = 0;
else
m = fac1(n) / (fac1(n - k) * fac1(k));
return m;
} //设置二项式函数fac2
int main() {
cout << "please enter n and k:" << endl;
cin >> n; cin >> k;
w = fac2(n, k);
cout << "从" << n << "个人中选取" << k << "个人组成一个委员会共有" << w << "种组合" << endl;
return 0;
}
方法2:书上例题采用的方法;
#include <iostream>
using namespace std;
//计算从n个人里选k个人的组合数
int comm(int n, int k) {
int f;
if (k > n)
f = 0;
else if (k == n || k==0)
f = 1;
else
f = comm(n - 1, k) + comm(n - 1, k - 1);
return f;
}
int main() {
int n, k;
cout << "please enter n and k :" << endl;
cin >> n >> k;
cout << "C(n,k)=" << comm(n, k);
return 0;
}