1155. 掷骰子等于目标和的方法数 - 力扣(LeetCode)
#define MOD 1000000007
class Solution {
public:
long long f[1005];
int numRollsToTarget(int n, int k, int target) {
for (int i = 1; i <= k; i++) f[i] = 1;
for (int i = 2; i <= n; i++) {
for (int j = target; j >= i; j--) {
f[j] = 0;
for (int l = 1; l <= k; l++) {
if (j - l < i - 1) break;
f[j] = (f[j] + f[j - l]) % MOD;
}
}
}
return f[target];
}
};