project Eulert 学习笔记 之 problem 25
来源:互联网 发布:云计算和大数据的区别 编辑:程序博客网 时间:2024/05/18 13:27
The Fibonacci sequence is defined by the recurrence relation:
Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits.
What is the index of the first term in the Fibonacci sequence to contain 1000 digits?
解题思路:题目给出了一个斐波那契数列,要求求出第一个位数达到1000位的数的索引:
程序是这样的:
f = {}
f[0] = 1
f[1] = 1
for n in range(2,100000,1):
f[n] = f[n - 1] + f[n - 2]
s = str(f[n])
numlist = [int(s[item: item + 1]) for item in range(0, len(s), 1)]
if len(numlist) < 1000:
print(n+2)
"""
思路:
定义f[0],f[1]
第3个数等于第1个加第2个的和
将结果转换为字符
将字符转换为N个组
统计共有多少位
小于1000位的F[n]加上2(f[0]和f[1])就是要求的f[n]
"""
阅读全文
0 0
- project Eulert 学习笔记 之 problem 25
- project Eulert 学习笔记 之 problem 29
- project Eulert 学习笔记 之 problem 8
- project Eulert 学习笔记 之 problem 22
- Maven POM学习笔记之<Project>元素
- Project Euler - Problem 25
- Project Euler Problem 25
- Project Euler problem 25
- project euler Problem 25
- Project-taobao 学习笔记
- castle project 学习笔记1
- 【安卓学习之常见问题】 使用Eclipse clean时,出现“cleaning all project has encountered a problem”提示
- 学习C#之First Project
- Dynamic Web Project 的学习笔记
- Dynamic Web Project 项目学习笔记
- Dynamic Web Project 的学习笔记
- InstallShield2010 Basic MSI Project 学习笔记
- Dynamic Web Project 的学习笔记
- PDFMiner
- swagger2 注解说明
- hadoop2.x常用端口、定义方法及默认端口、hadoop1.X端口对比
- leetcode447. Number of Boomerangs
- pod删除已导入的第三方库和移除项目中的cocoapods
- project Eulert 学习笔记 之 problem 25
- oracle将时间段分割,按小时分组,求各个子时间段的分钟数
- Java List
- [LeetCode]726. Number of Atoms
- CentOS中使用PyCharm的技巧-PyCharm找不到cv2的解决方案
- Lucene教程详解
- Freak特征描述+BruteForceMatcher匹配+RANSAC剔除误匹配
- weblogic10.3登录控制台报错Exception: java.lang.OutOfMemoryError thrown from the UncaughtExceptionHandle解决办法
- this is my first blog