def fib(n):
    if n == 0:
        return 1
    if n == 1:
        return 1
    a, b = 1, 1
    for i in range(2, n + 1):
        a, b = b, a + b
    return b


def PrintFN(m,n):
    lst = []
    for i in range(0, 27):
        if m <= fib(
 
i) <= n:
            lst.append(fib(i))
    return lst

---

相關推薦