algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java
View File

@ -11,13 +11,12 @@ keep on counting the results that sum to X. This can be done using recursion. */
And it can be done using Dynamic Programming(DP).
Following is implementation of Dynamic Programming approach. */
// Code ---->
// Java program to find number of ways to get sum 'x' with 'n'
// dice where every dice has 'm' faces
// Java program to find number of ways to get sum 'x' with 'n'
// dice where every dice has 'm' faces
class DP {
/* The main function that returns the number of ways to get sum 'x' with 'n' dice and 'm' with m faces. */
public static long findWays(int m, int n, int x) {
/* Create a table to store the results of subproblems.
One extra row and column are used for simplicity
(Number of dice is directly used as row index and sum is directly used as column index).
@ -50,7 +49,6 @@ class DP {
System.out.println(findWays(4, 3, 5));
}
}
/*
OUTPUT:
0
@ -60,4 +58,3 @@ OUTPUT:
6
*/
// Time Complexity: O(m * n * x) where m is number of faces, n is number of dice and x is given sum.