哈深夏令营机试题1：n个色子的点数之和为m的概率计算

实际就是求n个色字点数之和为m的组合数。
动态规划:
转移方程：
dp[i][j]=dp[i-1][j-6] + dp[i-1][j-5] +dp[i-1][j-4]+dp[i - 1][j - 3] +dp[i-1][j-2] +dp[i-1][j-1]

边界条件是:
dp[0][0]=1;

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
using namespace std;


const int maxn=100;
int dp[maxn][maxn*6];



int main()
{
	int n, m;
	cin >> n >> m;
	dp[0][0] = 1;
	for(int i=1;i<=10;i++)
		for (int j = i; j <= m; j++) {
			for (int k = 1; k <= 6; k++) {
				if(j-k>=0)
					dp[i][j] += dp[i - 1][j - k];				
			}
			//cout << i << " " << j << ":" << dp[i][j] << endl;
		}
	double p = dp[n][m] / pow(6, n);
	cout << p;

	return 0;
}