Menu Close

Given the number k, return the minimum number of Fibonacci…-FTC

Given the number k, return the minimum number of Fibonacci numbers whose sum is equal to k, whether a Fibonacci number could be used multiple times. The Fibonacci numbers are defined as:
F1 = 1
F2 = 1
Fn=Fn-1 + Fn-2, for n > 2.
It is guaranteed that for the given constraints we can always find such Fibonacci numbers that sum k.
Input: k=7
Output: 2

def fibo(x):
    if x <= 1:
        return x
    else:
        return (fibo(x-1)+fibo(x-2))

N=int(input('Enter the K value : '))
L=[]
for i in range(N):
    if fibo(i) < N:
        L.append(fibo(i))
    else: break

i,c=0,0
L=sorted(L,reverse=True)
while i<len(L)-1:
    c+=N//L[i]
    N%=L[i]
    i+=1
print(c)

Input_1:
Enter the K value : 7
Output:
2


Input_2:
Enter the K value : 10
Output:
2


Input_3:
Enter the K value : 19
Output:
3


Input_4:
Enter the K value : 900
Output:
4


Input_5:
Enter the K value : 17
Output:
3


Morae Q!

->Convert Numbers into Roman Numerals
->Given the string s, return the size of the longest sub-string
->Given an array of string words. Return all strings in words which is sub-string of another word in any order.
->Return the minimum positive value of startValue such that the step by step is never less than 1.
->Given the number k, return the minimum number of Fibonacci.
->Given a string s of zeros and ones, return the maximum score after splitting the string
->Given a sorted array and a value x,Write a efficient functions to find floor of x.
->Print all numbers less than n which are having digits only 3 or 7 or both.
->Function that returns true if given array can be divided into pairs.
->Find the smallest element in the list that is larger than the given target.
->Print the First N prime numbers.
->The Chef’s Binary Tree.
->The minimum number of strikes he will have to make.(so that all his enemies have the same name)
->Sum of Natural Numbers.
->Sum of the Input.
->Find the Sum of the Series: 1 + 1/2 + 1/3 + .. + 1/N.
->Put Even and Odd elements in a List into Two Different Lists.
->Python Program to Merge Two Lists and Sort it.
->Median of Three.
->Python Program to Find the Largest Number in a List.