class Solution:
def numRollsToTarget(self, d: int, f: int, target: int) -> int:
dp = []
for i in range(d+1):
a = []
for j in range(target+1):
a.append(-1)
dp.append(a)
def trav(d, f, target):
if target == 0 and d == 0:
return 1
if target <= 0 or d<= 0:
return 0
if dp[d][target] != -1:
return dp[d][target]
dp[d][target] = 0
for i in range(1, f+1, 1):
dp[d][target] += trav(d-1, f, target - i)
return dp[d][target]
return trav(d, f, target)%(10**9 + 7)
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |
1038B - Non-Coprime Partition | 43A - Football |
50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |
1648A - Weird Sum | 427A - Police Recruits |
535A - Tavas and Nafas | 581A - Vasya the Hipster |
1537B - Bad Boy | 1406B - Maximum Product |
507B - Amr and Pins | 379A - New Year Candles |