AcWing-80-サイコロの点数

class Solution {
public:
    vector numberOfDice(int n) {
        vector> dp(n + 1, vector(6 * n + 1, 0));
        dp[0][0] = 1;
        for(int i = 1; i <= n; i++){
            for(int j = i; j <= 6 * i; j++){
                for(int k = 1; k <= min(j, 6); k++){
                    dp[i][j] += dp[i-1][j-k];
                }
            }
        }
        vector ans(dp[n].begin() + n, dp[n].end());
        return ans;
     }
};