问计算从数组到特定数字之和所需的最小数目

EN

def solve(numbers, target):
    '''Return a list of the largest of numbers whose sum is target, 
    None if impossible'''

    if not numbers:
        return None

    # make sure that numbers is sorted
    numbers = list(sorted(numbers))
    # get the largest number and remove it from the list
    largest = numbers.pop()
    # we start with as many times the largest number as possible
    quotient, remainder = divmod(target, largest)
    # did we reach the target?
    if remainder == 0:
            return [largest] * quotient

    # if not, try with a deacreasing number of times the largest    
    # (including 0 times)
    for n in range(quotient, -1, -1):
        remainder = target - n * largest
        # and recursively try to obtain the remainder with the remaining numbers
        solution = solve(numbers, remainder)
        if solution:
            return [largest] * n + solution
    else:
        return None

solve([1, 3, 5], 12)
# [5, 5, 1, 1]

solve([3, 5], 12) # no 1, we have to use smaller numbers
# [3, 3, 3, 3]

solve([7, 3, 4], 15)
# [7, 4, 4]

solve([3, 4], 5) # Impossible
# None

n = int(input())
a = [1, 3, 5]
ans = []
while n > 0:
    n -= max(a)
    if n == 0:
        ans.append(max(a))
        break
    if n > 0:
        ans.append(max(a))
    if n < 0:
        n += max(a)
        a.pop(a.index(max(a)))

print(ans)