diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/num_dice_roll_target_sum.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/num_dice_roll_target_sum.cpp')
-rw-r--r-- | other/num_dice_roll_target_sum.cpp | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/other/num_dice_roll_target_sum.cpp b/other/num_dice_roll_target_sum.cpp new file mode 100644 index 0000000..abb7596 --- /dev/null +++ b/other/num_dice_roll_target_sum.cpp @@ -0,0 +1,21 @@ +#include "leetcode.h" + +class Solution { +public: + int numRollsToTarget(int n, int k, int target) { + int mod = 1000000007; + vvd dp(n + 1, vector<int>(target + 1, 0)); + dp[0][0] = 1; + for (int i = 1; i <= n; i++) + for (int j = 1; j <= target; j++) + for (int x = 1; x <= k; x++) + if (x <= j) + dp[i][j] = ((dp[i][j] % mod) + (dp[i - 1][j - x] % mod)) % mod; + return dp[n][target]; + } +}; + +int main() { + Solution obj; + cout << obj.numRollsToTarget(1, 6, 3); +} |