Problem 25 1000-digit Fibonacci number
Problem 25: 1000-digit Fibonacci number
The Fibonacci sequence is defined by the recurrence relation:
Fn = Fn−1 + Fn−2, where F1 = 1 and F2= 1.
Hence[……]
分类
- 编程点滴 (69)
- 生活感悟 (22)
- 所有文章 (172)
- 解决方案 (9)
- PythonChallenge (12)
- ProjectEuler (63)