剑指offer面试题43:n个骰子的点数

#include "iostream"
using namespace std;
int g_maxValue = 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;
		cout << i << ": " << ratio << endl;
	}
	delete[] pProbabilities[0];
	delete[] pProbabilities[1];
}
int main()
{
	PrintProbability(4);
	system("pause");
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值