C++实现N个骰子的点数算法

#include 

using namespace std;

const int g_maxValue = 6;
const int number = 6;

int array[(number - 1) * g_maxValue + 1];

void probility(int original, int current, int sum, int *array)
{
 if (current == 0)
 {
 array[sum - original]++;
 return;
 }

 for (int i = 1; i <= g_maxValue; i++)
 {
 probility(original, current - 1, sum + i, array);
 }
}

void generateValue(int *array, int size)
{
 if (array == NULL || size <= 0)
 return;

 for (int i = number; i <= number * g_maxValue; i++)
 {
 array[i - number] = 0;
 }

 probility(number, number, 0, array);

 for (int i = 0; i <(number - 1) * g_maxValue + 1; i++)
 {
 cout <

#include 

using namespace std;

void PrintProbability(int number)
{
 const int g_maxValue = 6;

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

 for (int i = 0; i