aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-04-30 12:34:36 -04:00
parent 4bb20c9b71
commit cbaf4c4b64
12390 changed files with 318560 additions and 27248 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Task/Knapsack-problem-0-1/Python/knapsack-problem-0-1-4.py
View file

@ -1,4 +1,4 @@
n, G = 5, 5 # KNAPSACK 0-1 DANILIN
n, G = 5, 5 # KNAPSACK 0-1 DANILIN
N = n + 1 # rextester.com/BCKP19591
a = 2 ** N
L, C, j, q, s, d, e = [1]*n, [1]*n, [1]*n, [0]*a, [0]*a, [0]*a, [""]*a
@ -26,5 +26,5 @@ print()
max, m = 0, 1
for i in range(a):
if d[i] <= G and q[i] > max:
max, m = q[i], i
max, m = q[i], i
print(d[m], q[m], e[m])