Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

solution:-

number=int(input("enter the value of number:="))
ans = []
def add(number):
    n1=0
    n2=1
    n4 = [];
    n4.extend([1,1])
    for i in range(number):
        n3 = n2 + n1
        n1 = n2
        n2 = n3
        n4.append(n3)
    print(n4)
    n = len(n4)
    c = 0
    for i in range(n - 1, -1, -1):
        if n4[i] == number:
            print(n4[i])
            c += 1
            break
        elif n4[i]<number:
            print(n4[i])
            number = number - n4[i]
            c += 1
    print("Total time of sum",c)
    return c

add(number)