Fibonacci sequence calculation with large numbers (high-speed implementation)

from functools import lru_cache
import sys
# 设置递归深度限制
sys.setrecursionlimit(100000)


# 缓存最近100个计算结果
@lru_cache(100)
def fib(num):
    if num<2:
        return num
    else:return fib(num-1)+fib(num-2)

print(fib(1000))
# 清理缓存
fib.cache_clear()

Guess you like

Origin blog.csdn.net/CXY00000/article/details/131782488