possibleCombinations.py

solution = []


def possibleCombinations(N, items):
    if N < 0:
        return
    if N == 0:
        print solution
    else:
        for k in items:
            key = k
            v = items[key]
            del items[k]
            solution.append(key)
            possibleCombinations(N - v, items)
            solution.pop(-1)
            items[k] = v


items = {"a": 23, "b": 34, "c": 36, "d": 64,
         "e": 50, "f": 50, "g": 40, "h": 60}
possibleCombinations(100, items)