面试题43：n个骰（tou）子的点数

题目：把n个骰子扔在地上，所有骰子朝上一面的点数之和为S。输入n，打印出S的所有可能的值出现的概率。

分析：我们可以考虑用两个数组来存储骰子点数每一总数出现的次数。在一次循环中，第一个数组中的第n个数字表示骰子和为n出现的次数。那么在下一循环中，我们加上一个新的骰子。那么此时和为n的骰子出现的次数，应该等于上一次循环中骰子点数和为n-1、n-2、n-3、n-4、n-5与n-6的总和。所以我们把另一个数组的第n个数字设为前一个数组对应的第n-1、n-2、n-3、n-4、n-5与n-6之和。

#include <math.h>
#include <iostream>

using std::cout;
using std::endl;

void print_probability(int n)
{
    if (n <= 0){
        cout << "there is no dice" << endl;
        return;
    }

    int *probability[2];
    probability[0] = new int[6 * n + 1];
    probability[1] = new int[6 * n + 1];
    for (int i = 0; i <= 6 * n; i++){
        probability[0][i] = 0;
        probability[1][i] = 0;
    }

    int flag = 0;
    for (int i = 1; i <= 6; i++){
        probability[flag][i] = 1;
    }

    for (int i = 2; i <= n; i++){
        //[0,i-1]
        for (int j = 0; j < i; j++){
            probability[1-flag][j] = 0;
        }

        //[i,6i]
        for (int j = i; j <= i * 6; j++){
            //probability[1 - flag][j] = probability[flag][j - 1] + probability[flag][j - 2]
            //  + probability[flag][j - 3] + probability[flag][j - 4]
            //  + probability[flag][j - 5] + probability[flag][j - 6];
            probability[1 - flag][j] = 0;
            for (int k = 1; k <= 6 && k<=j; k++){

                probability[1 - flag][j] += probability[flag][j - k];
            }

        }

        flag = 1 - flag;
    }

    int total = pow(6, n);
    for (int i = n; i <= 6 * n; i++){
        //[n,6n]
        double ratio = (double)probability[flag][i] / total;
        cout << i << ": " << ratio << endl;
    }

    delete[] probability[0];
    delete[] probability[1];

}