KNAPSACK 0-1 DANILIN, Python 3

Language: Layout:

n=5; N=n+1; G=5; a=2**N			# N=7: L=5: a = 2^(N+1): 'knapsack.bas DANILIN
L=[];C=[];e=[];j=[];q=[];s=[]		# Dim L(N), C(N), j(N), q(a), q$(a), d(a)
d=[];L=[1]*n;C=[1]*n;e=[1]*a	
j=[1]*n;q=[0]*a;s=[0]*a;d=[0]*a

from random import randint	# Randomize Timer 
for i in range(0,n):		# For i=1 To N: 
    L[i]=randint(1,3)		# L(i)=Int(Rnd*3+1) 
    C[i]=10+randint(1,9)	# C(i)=10+Int(Rnd*9) 
    print(i+1,L[i],C[i])	# Print i, L(i), C(i)
print()

for h in range(a-1,(a-1)//2,-1):	# For h=a-1 To 0 Step -1  # 
    b=str(bin(h))
    e[h]=b[3:len(b)]			# binary without origin
        
    for k in range (n):			# For k=1 To N:
        j[k]=int(e[h][k])		# j(k)=Val(Mid$(q$(h), k, 1)) ' from chifer              
        q[h]=q[h]+L[k]*j[k]*C[k]	# q(h)=q(h)+L(k)*j(k)*C(k) ' 0 or 1
        d[h]=d[h]+L[k]*j[k]		# d(h)=d(h)+L(k)*j(k)	Next
        #print(e[h],L[k],j[k],C[k],d[h], q[h])
        
    if d[h]<= G:			# If d(h) <= L Then 
        print(e[h], G, d[h], q[h])  	# Print #1, d(h), q(h), q$(h)	Next
print()

max=0; m=1 				# max=0: m=1: 
for i in range(a):			# For i=1 To a
    if d[i]<=G and q[i]>max:	 	# If d(i)<=L Then If q(i) > max 
        max=q[i]; m=i			# Then max=q(i): m=i	Next
print (d[m], q[m], e[m])		# Print #1,: Print #1, d(m), q(m), q$(m): End

[ + ] Show input
Absolute running time: 0.17 sec, cpu time: 0.05 sec, memory peak: 11 Mb, absolute service time: 0,29 sec