Created
March 2, 2016 08:07
-
-
Save joe-henke/fdbfbe52f7f96f6f72c8 to your computer and use it in GitHub Desktop.
Knapsack problem dynamic programming no repetition of items
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Uses python3 | |
| import sys | |
| def knapSackNoRep(capacity, bars): | |
| amount = len(bars) | |
| value=[[0 for row in range(0, amount+1)] for col in range(0, capacity+1)] | |
| for i in range(1, amount+1): | |
| wi = bars[i-1] | |
| vi = bars[i-1] | |
| for w in range(1, capacity+1): | |
| value[w][i] = value[w][i-1] | |
| if wi <= w: | |
| val = value[w-wi][i-1] + vi | |
| if value[w][i] < val: | |
| value[w][i] = val | |
| return value[capacity][amount] | |
| if __name__ == '__main__': | |
| input = sys.stdin.read() | |
| W, n, *w = list(map(int, input.split())) | |
| print(knapSackNoRep(W, w)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment