# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Getting TLE with a python solution for Coin Combination problem in here
I know that python is slow ..., but have seen other python users solving it here
def solve(n, x, lst):
dp = []
for i in range(n+1):
temp = [1] + [0]*x
dp.append(temp)
for i in range(1, n+1):
for j in range(1, x+1):
dp[i][j] = (dp[i][j] + dp[i-1][j]) % mod
if j - lst[i-1] >= 0:
dp[i][j] = (dp[i][j] + dp[i][j - lst[i-1]]) % mod
for i in dp: print(i)
return dp[n][x]
n, x = list(map(int, input().split()))
lst = list(map(int, input().split()))
print(solve(n, x, lst))
...
Creating the dp 2D array is even taking much time. Is there a way it can be optimized?
Thanks for taking your time and reading this!
Name |
---|
The dp can be 1 dimensional, let c[] be the coins and x the sum, then dp[x] is the answer: