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-02-01 16:33:20 -08:00
parent 5150844a7d
commit 4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -1,30 +1,30 @@
n=5; N=n+1; G=5; a=2**N # KNAPSACK 0-1 DANILIN
L=[];C=[];e=[];j=[];q=[];s=[] # rextester.com/BCKP19591
d=[];L=[1]*n;C=[1]*n;e=[1]*a
j=[1]*n;q=[0]*a;s=[0]*a;d=[0]*a
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
from random import randint
for i in range(0,n):
L[i]=randint(1,3)
C[i]=10+randint(1,9)
print(i+1,L[i],C[i])
for i in range(n):
L[i] = randint(1, 3)
C[i] = 10+randint(1, 9)
print(i+1, L[i], C[i])
print()
for h in range(a-1,(a-1)//2,-1):
b=str(bin(h))
e[h]=b[3:len(b)]
for h in range(a-1, (a-1)//2, -1):
b = str(bin(h))
e[h] = b[3:len(b)]
for k in range (n):
j[k]=int(e[h][k])
q[h]=q[h]+L[k]*j[k]*C[k]
d[h]=d[h]+L[k]*j[k]
for k in range(n):
j[k] = int(e[h][k])
q[h] = q[h]+L[k]*j[k]*C[k]
d[h] = d[h]+L[k]*j[k]
if d[h]<= G:
if d[h] <= G:
print(e[h], G, d[h], q[h])
print()
max=0; m=1
max, m = 0, 1
for i in range(a):
if d[i]<=G and q[i]>max:
max=q[i]; m=i
print (d[m], q[m], e[m])
if d[i] <= G and q[i] > max:
max, m = q[i], i
print(d[m], q[m], e[m])