n个骰子的点数

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

方法1：基于递归求骰子点数。n个骰子的所有点数的排列数为$6^n$。需要统计出每一个点数出现的次数，然后把每个点数出现的次数除以$6^n$就能求出每个点数出现的概率。

int g_maxValue = 6;

void PrintProbability(int number){
    if (number < 1){
        return;
    }

    int maxSum = number * g_maxValue;
    int* pProbabilities = new int[maxSum - number + 1];
    for (int i = number; i <= maxSum; ++i){
        pProbabilities[i - number] = 0;
    }

    Probability(number, pProbabilities);

    int total = pow((double)g_maxValue, number);
    for (int i = number; i <= maxSum; ++i){
        double ratio = (double)pProbabilities[i - number] / total;
        printf("%d: %e\n", i, ratio);
    }

    delete[] pProbabilities;
}

void Probability(int number, int* pProbabilities){
    for (int i = 1; i <= g_maxValue; ++i){
        Probability(number, number, i, pProbabilities);
    }
}

void Probability(int original, int current, int sum, int* pProbabilities){
    if (current == 1){
        pProbabilities[sum - original]++;
    }
    else {
        for (int i = 1; i <= g_maxValue; ++i){
            Probability(original, current - 1, i + sum, pProbabilities);
        }
    }
}

方法2：基于循环求骰子点数，时间性能好。用两个数组存储骰子点数的每一个总数出现的次数。在一次循环中，第一个数组中的第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-6与n-6之和。

void PrintProbability(int number){
    if (number < 1){
        return;
    }

    int* pProbabilities[2];
    pProbabilities[0] = new int[g_maxValue * number + 1];
    pProbabilities[1] = new int[g_maxValue * number + 1];
    for (int i = 0; i < g_maxValue * number + 1; ++i){
        pProbabilities[0][i] = 0;
        pProbabilities[1][i] = 0;
    }

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

    for (int k = 2; k <= number; ++k){
        for (int i = 0; i < k; ++i){
            pProbabilities[1 - flag][i] = 0;
        }

        for (int i = k; i <= g_maxValue * k; ++i){
            pProbabilities[1 - flag][i] = 0;
            for (int j = 1; j <= i && j <= g_maxValue; ++j){
                pProbabilities[1 - flag][i] += pProbabilities[flag][i - j];
            }
        }

        flag = 1 - flag;
    }

    double total = pow((double)g_maxValue, number);
    for (int i = number; i <= g_maxValue * number; ++i){
        double ratio = (double)pProbabilities[flag][i] / total;
        printf("%d: %e\n", i, ratio);
    }

    delete[] pProbabilities[0];
    delete[] pProbabilities[1];
}

测试用例：

• 功能测试（1、2、3、4个骰子各点数的概率）
• 特殊输入测试（输入0）
• 性能测试（输入较大的数字，比如11）