Dashboard Temp Share Shortlinks Frames API

HTMLify

Dice throw
Views: 4 | Author: prakhardoneria
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution:
    def noOfWays(self, m, n, x):
        dp = [[0] * (x + 1) for _ in range(n + 1)]
        
        dp[0][0] = 1
        
        for i in range(1, n + 1):
            for j in range(1, x + 1):
                for k in range(1, m + 1):
                    if j - k >= 0:
                        dp[i][j] += dp[i-1][j-k]
                    else:
                        break
                        
        return dp[n][x]