<doocs>1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K_1.py
def dfs(k):
    if k < 2:
        return k
    a = b = 1
    while b <= k:
        a, b = b, a + b
    return 1 + dfs(k - a)
def sample_funcname ( var_1 ) :
    if var_1 < 2 :
        return var_1
    var_5 = var_3 = 1
    while var_3 <= var_1 :
        var_5 , var_3 = var_3 , var_5 + var_3
    return 1 + var_0 ( var_1 - var_5 )
