knapsack_blackjack.py

import random

def solution(N, L):
  #Given budget of integer N, and a list of items of length S
  #each with their own cost C, return the sub-list that uses
  #the highest value <=N.
  res = (0, 0, 0)
  for idx, item in enumerate(L):
    i = 0
    l = 0
    for item in L[idx:]:
      if i + item <= N:
        i += item
        l += 1;
      else:
        break;
    if i > res[2]:
      res = (idx, l, i)
  return res

budget = 60
x = [random.randint(1,50) for x in range(30)]

print("Budget of", str(budget))
print("In list", str(x))

res = solution(budget, x)

print("Solution at index", str(res[0]), "with contents", str(x[res[0]:res[0]+res[1]]), "having sum", str(res[2]))