unsigned long long C(unsigned int k, unsigned int n)
{
if (k > n)
return 0;
unsigned long long r = 1;
for (unsigned int d = 1; d <= k; ++d)
{
r *= n--;
r /= d;
}
return r;
}
Knuth的计算组合数的较高精度算法
最新推荐文章于 2022-01-10 17:11:01 发布