```c
class Solution {
public:
vector<int> res;
vector<int> numberOfDice(int n) {
vector<vector<int> >f(n+1,vector<int>(6*n+1));//f[i][j]表示选了i个数,和为j的所有方案
f[0][0]=1;
for (int i = 1; i <= n; i ++ )
for (int j = 0; j <= 6*n; j ++ )
{
for (int k = 1; k <= 6; k ++ )
if(j>=k) f[i][j]+=f[i-1][j-k];
cout << i<<' '<<j<<' '<<f[i][j]<<endl;
}
for (int i = n; i <= 6*n; i ++ )
res.push_back(f[n][i]);
return res;
}
};
标签:numberOfDice,骰子,cout,int,vector,点数
From: https://www.cnblogs.com/tangxibomb/p/17399352.html