leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE

1155.cpp (572B)


0 class Solution {
1 static const int MOD = 1E9 + 7;
2 static int dp[31][1001];
4 public:
5 Solution() { memset(dp, 0xFF, sizeof(dp)); }
6 int numRollsToTarget(int n, int k, int target, int crnt = 0) {
7 if (target < 0) return 0;
8 if (crnt == n) return target == 0;
9 if (dp[crnt][target] != -1) return dp[crnt][target];
10 int res = 0;
11 for (int i = 1; i <= k; i++) {
12 res = (res + numRollsToTarget(n, k, target - i, crnt + 1)) % MOD;
13 }
14 return dp[crnt][target] = res;
15 }
16 };
18 int Solution::dp[31][1001];