Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
0-1 Knapsack
def knapsack(C,n,W,V): if(C==0 or n==0): return 0 if(W[n-1]>C): return knapsack(C,n-1,W,V) else: return max((knapsack(C-W[n-1],n-1,W,V)+V[n-1]),knapsack(C,n-1,W,V)) W = [10,20,30] V = [60,100,120] C = 50 n = 3 print(knapsack(C,n,W,V))
run
|
edit
|
history
|
help
0
aaa
Single and double qoute
9th jan quiz2
Prueba
snake water gun correct
PyLSV
problem
Prime Numbers :-> Sieve of Eratosthenes
вправи в пайтон
PyAbs