]]>re: c++姹傜粍鍚堟暟http://www.shnenglu.com/izualzhy/archive/2013/06/15/188260.html#201026Yen-ChiehYen-ChiehSat, 15 Jun 2013 04:25:00 GMThttp://www.shnenglu.com/izualzhy/archive/2013/06/15/188260.html#201026 寰堝枩姝℃偍鎻愬嚭鐨勶紝綺劇啊
涓闁嬪鐪嬩笉鏄緢鎳?浣嗘槸鎴戞彃鍏ヤ簡璦卞璁婃暩瑙瀵熻看鍦堢Щ鍕曠殑鏂瑰紡涔嬪緦
閭勬槸鍏呮豢鐤戞儜錛屽厜鏄疌5鍙?鎴戝氨寰楀埌浜嗛欓杭涓涓?br>鍏朵腑鐨?quot;in"浠ｈ〃姣忛插幓涓嬈″壇紼嬪紡鎴戝氨鍗頒竴嬈℃鏌ヨ畩鏁?br> in n=5 k=2 in n=4 k=1 in n=3 k=0 in n=3 k=0 i=4 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=2 k=0 in n=2 k=0 i=3 k=1 combination(i-1, k-1)=1 totalCounts=2 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=3 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=4 in n=4 k=1 in n=3 k=0 in n=3 k=0 i=4 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=2 k=0 in n=2 k=0 i=3 k=1 combination(i-1, k-1)=1 totalCounts=2 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=3 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=4 i=5 k=2 combination(i-1, k-1)=4 totalCounts=4 in n=3 k=1 in n=2 k=0 in n=2 k=0 i=3 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=2 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=3 in n=3 k=1 in n=2 k=0 in n=2 k=0 i=3 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=2 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=3 i=4 k=2 combination(i-1, k-1)=3 totalCounts=7 in n=2 k=1 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=2 in n=2 k=1 in n=1 k=0 in n=1 k=0 i=2 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=2 i=3 k=2 combination(i-1, k-1)=2 totalCounts=9 in n=1 k=1 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=1 in n=1 k=1 in n=0 k=0 in n=0 k=0 i=1 k=1 combination(i-1, k-1)=1 totalCounts=1 i=2 k=2 combination(i-1, k-1)=1 totalCounts=10
淇敼寰岀殑code濡備笅
#include <stdio.h> #include <stdlib.h>
int combination(int n, int k) { printf("in n=%d k=%d \n" ,n,k);
if (k>n || k<0) { return 0; }
if (k == 0) { return 1; }
int totalCounts = 0; int i; int j; for (j=0, i = n ; i >= k ; --i,j++) { totalCounts += combination(i-1, k-1); printf("i=%d k=%d combination(i-1, k-1)=%d totalCounts=%d\n",i,k,combination(i-1, k-1),totalCounts); }
return totalCounts; }
int main() { int a, b; scanf("%d %d",&a,&b); printf("\n%d\n", combination(a,b));
]]>re: 鐢眎nt涓巙nsigned int 鐩稿姞鐪媍++綾誨瀷杞崲http://www.shnenglu.com/izualzhy/archive/2013/05/06/158169.html#200005izualzhyizualzhyMon, 06 May 2013 00:51:00 GMThttp://www.shnenglu.com/izualzhy/archive/2013/05/06/158169.html#200005