gistfile1.txt

import numpy as np
def find_combination(choices, total):
    new_array = list(reversed(sorted(choices)))
    new = compare(new_array, total)[1]
    result=[]
    for number in choices:
        if number in new:
            new.pop(new.index(number))
            result.append(1)
        else:
            result.append(0)
    return np.asarray(result)


def compare(array, total):
    if total == 0:
        return (True,[])

    elif total < 0 or len(array) == 0:
        return (False,[])

    number = array[0]
    if total > number:
        have = compare(array[1:], total- number)
        dont_have = compare(array[1:], total)
        if have[0]:
            have[1].append(number)
            return (True,have[1])
        if dont_have[0]:
            return (True,dont_have[1])
        have[1].append(number)
        return (False,have[1])
    if total < number:
        return compare(array[1:],total)
    return (True ,[number])