My brute force solution for knapsack problem, http://xkcd.com/287/

knapsack.py

weights = [215, 275, 335, 355, 420, 580]
limit = 1505

ds = {
    i * w: [w] * i
    for w in weights
    for i in range(1, 1 + (limit // w))
}

for w in weights:
    for key, base in sorted(ds.items()):
        for i in range(1, 1 + (limit - key) // w):
            ds[key + w * i] = base + [w] * i

print sorted(ds.keys())