# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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: