//函數(shù)功能 ： 從撲克牌中隨機(jī)抽5張牌，判斷是不是一個(gè)順子 
//函數(shù)參數(shù) ： pCards為牌，nLen為牌的張數(shù) 
//返回值 ： 是否順子 
bool IsContinuous(int *pCards, int nLen) 
{ 
 if(pCards == NULL || nLen <= 0) 
  return false; 
 
 sort(pCards, pCards + nLen); //調(diào)用標(biāo)準(zhǔn)庫(kù)的排序算法 
 
 int i; 
 int zeroCount = 0; //大小王用0表示 
 int capCount = 0; //間隔數(shù) 
 //統(tǒng)計(jì)0的個(gè)數(shù) 
 for(i = 0; i < nLen; i++) 
 { 
  if(pCards[i] == 0) 
   zeroCount++; 
  else 
   break; 
 } 
 //統(tǒng)計(jì)間隔數(shù) 
 int preCard = pCards[i];  
 for(i = i + 1; i < nLen; i++) 
 { 
  int curCard = pCards[i]; 
  if(preCard == curCard) //與前一張牌比較 
   return false; 
  else 
   capCount += curCard - preCard - 1; //累加間隔數(shù) 
  preCard = curCard; 
 } 
 return (zeroCount >= capCount)? true: false; //只要王的個(gè)數(shù)大于間隔數(shù) 
} 

     /  = F(k-1, n-6) + F(k-1, n-5) + F(k-1, n-4) + F(k-1, n-3) + F(k-1, n-2) + F(k-1, n-1)  對(duì)于 k > 0, k <= n <= 6*k
 F(k, n) =  
     \  = 0    對(duì)于 n < k or n > 6*k

const int FACE_NUM = 6; //骰子的面數(shù) 
 


//函數(shù)功能 ： n個(gè)骰子的點(diǎn)數(shù) 
//函數(shù)參數(shù) ： number為骰子數(shù) 
//返回值 ： 無(wú) 
void PrintSumProbabilityOfDices(int number) 
{ 
 if(number <= 0) 
  return; 
 
 int *pSum = new int[number * FACE_NUM + 1]; //和的種類(lèi) 
 double total = pow(6.0, number); //<cmath> 
 int size = number * FACE_NUM; 
 int i,j,k; 
 
 //初始化 
 pSum[0] = 0; 
 for(i = 1; i <= FACE_NUM; i++) 
  pSum[i] = 1; 
 for(; i <= size; i++) 
  pSum[i] = 0; 
 
 for(i = 2; i <= number; i++) //骰子個(gè)數(shù)從2到n 
 { 
  for(j = i * FACE_NUM; j >= i; j--) //第i個(gè)骰子的和的范圍為 [i, i*FACE_NUM] 
  { 
   pSum[j] = 0; 
   for(k = 1; k <= 6 && j >= k; k++) //其實(shí)展開(kāi)就是 F(i, j) = F(i-1, j-6) + F(i-1, j-5) + F(i-1, j-4) + F(i-1, j-3) + F(i-1, j-2) + F(i-1, j-1) 
   { 
    pSum[j] += pSum[j-k]; 
   } 
  } 
  //不可能的情況，即i個(gè)骰子的和不可能小于i 
  for(j = i - 1;j >= 0; j--) 
   pSum[j] = 0; 
 } 
 
 //打印結(jié)果 
 for(i = 0; i <= size; i++) 
  cout<<"sum = "<<i<<", p = "<<pSum[i] / total<<endl; 
}