17 июля 2025
Фотография
нажмите — покажем
1.4K · нажмите — покажем
def MathChallenge(num):
coins = [1, 5, 7, 9, 11]
dp = [float('inf')] * (num + 1)
dp[0] = 0
for i in range(1, num + 1):
for coin in coins:
if i >= coin:
dp[i] = min(dp[i], dp[i - coin] + 1)
return dp[num]
AssestSense✅
//q2
3 · 1.5K · def ArrayChallenge(strArr):
s1, s2 = strArr[0], strArr[1]
n, m = len(s1), len(s2)
dp = [[0] * (m + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, m + 1):
if s1[i - 1] == s2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[n][m]
AssestSense ✅
//q1
2 · 1.6K ·