※ 引述《katsuoli (katsuo)》之銘言：
: 8.Let C(n, k) denote the number of ways to select k out of n items without
: order. It is known that
: C(n ,1) = n, C(n, n) = 1, and C(n, k) = C(n-1, k-1)+C(n-1, k). Please write a
: recursive function
: comb(int n, int k) that computes C(n ,k) based on the above-mentioned
: knowledge
: 這也看不懂，好像是排列組合問題?
: 問題很多，麻煩各位了。
int comb(int n, int k)
{
if( n== k or k == 0 ) return 1;
return comb(n-1, k-1)+comb(n-1, k);
}
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.168.97.210