project euler Problem 25

最新推荐文章于 2018-10-16 14:08:04 发布

原创最新推荐文章于 2018-10-16 14:08:04 发布 · 670 阅读

0 ·

CC 4.0 BY-SA版权

Python 同时被 2 个专栏收录

44 篇文章

订阅专栏

算法导论 && ACM

37 篇文章

订阅专栏

本文通过Python代码展示了如何生成斐波那契数列，并设置了一个条件当数列中的数值长度达到1000位时停止计算，打印出此时数列中项的数量。

i=1
j=1
count=2
while(True):
    count=count+1
    temp=i+j
    i=j
    j=temp
    L=list(str(temp))
    
    if(len(L)>=1000):
        print count
        break

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

JKhere

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

Project Euler_Problem 140_Modified Fibonacci Golden Nuggets_生成函数+广义佩尔方程

m0_73695404的博客

04-05

281

【代码】Project Euler_Problem 140_Modified Fibonacci Golden Nuggets_生成函数+广义佩尔方程。

关于高斯模糊的详细介绍及python代码实现

热门推荐

坤的专栏

07-25

2万+

高斯模糊的算法讲的很详细，值得仔细阅读！

参与评论您还未登录，请先登录后发表或查看评论

Project Euler Problem 25

wxinbeings的博客

05-05

169

Problem 25The Fibonacci sequence is defined by the recurrence relation:F1 = 1 F2 = 1Fn = Fn−1 + Fn−2Hence the first 12 terms will be:F1 = 1F2 = 1F3 = 2F4 = 3F5 = 5F6 = 8F7 = 13F8 = 21F9 = 34F10 = 55F...

Project Euler Problem 25 (C++和Python)

jiafengfu的优快云博客

10-16

268

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 the first 12 terms will be: F1 = 1 F2 = 1 F3 = 2...

Project Euler Problem 19

wxinbeings的博客

04-29

193

Problem 19You are given the following information, but you may prefer to do some research for yourself.1 Jan 1900 was a Monday.Thirty days has September,April, June and November.All the rest have thir...

Project Euler Problem 18

wxinbeings的博客

04-28

243

Problem 18By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3That is, 3 + 7 + 4 + 9 = 23.Find the ...

Project Euler Problem 28

wxinbeings的博客

05-08

151

Problem 28Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:21 22 23 24 2520 7 8 9 1019 6 1 2 1118 5 4 3 1217 16 15 14 13It can ...

Project Euler Problem 26

wxinbeings的博客

05-07

323

Problem 26A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:1/2= 0.51/3= 0.(3)1/4= 0.251/5= 0.21/6= 0.1(6)1/7= 0.(142857...

Project Euler Problem 24

wxinbeings的博客

05-04

227

Problem 24A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetic...

Project Euler Problem 22

wxinbeings的博客

05-02

224

Problem 22Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alpha...

Project Euler Problem 17

wxinbeings的博客

04-27

206

Problem 17If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.If all the numbers from 1 to 1000 (one thousand) incl...

project euler problem 5

12-18

题目：Project Euler问题5——寻找最小公倍数在Project Euler的问题集中，问题5要求我们找到能被1至20所有数字整除的最小正整数。这个问题实际上是在寻找这组数字的最小公倍数（LCM）。对于较小的参数值，如本例中...

project_euler:Project Euler 问题的解决方案 https

05-31

project_euler Project Euler 问题的解决方案 ###Problem 1 - 3 和 5 的倍数### 如果我们列出所有 10 以下是 3 或 5 的倍数的自然数，我们得到 3、5、6 和 9。这些倍数的和是 23。求1000 以下所有 3 或 5 的倍数之...

project-euler-problem-downloader:将所有 projecteuler.net 问题下载到您的本地存储

07-03

而"project-euler-problem-downloader"是一个实用工具，它允许用户将Project Euler的所有问题下载到本地，以便离线浏览和解决。这个工具特别适合那些经常在没有网络连接或者希望通过本地编辑器解决Project Euler问题...

matplotlib画直方图（1）

坤的专栏

07-14

1万+

import numpy as np import matplotlib.pyplot as plt mu,sigma=100,15 x=mu+sigma*np.random.randn(10000) n,bins,patches=plt.hist(x,50,normed=1,facecolor='g',alpha=0.75) plt.xlabel('Smarts') plt.ylabel('

matplotlib画直方图（2）

坤的专栏

07-14

5871

import numpy as np import matplotlib.pyplot as plt ax=plt.subplot(111) t=np.arange(0,5,0.01) s=np.cos(2*np.pi*t) line=plt.plot(t,s,lw=2) plt.annotate('local max',xy=(2,1),xytext=(3,1.5),

python自动获取163邮箱的通讯录、收件箱中的寄件人和标题

坤的专栏

07-12

4580

#-*- coding:UTF-8 -*- import urllib,urllib2,cookielib import xml.etree.ElementTree as etree #xml解析类 class Login163: #伪装browser header = {'User-Agent':'Mozilla/5.0 (Windows; U; Windows NT 6.1;

"IDLE's subprocess didn't make connection. "的解决方法

坤的专栏

07-09

4251

“IDLE's subprocess didn't make connection. Either IDLE can't start a subprocess or personal firewall software is blocking the connection." 这个问题的解决方法是：打开所在安装目录下的 ../Lib/idlelib/PyShell.py 大约在1400行左右

python中PyQwt的使用

坤的专栏

10-19

4215

python中除了matplotlib外，PyQwt也可以用于画图。前者是基于wxpython，后者是基于PyQt，有异曲同工之妙。下面是一个小例子： # -*- coding: utf-8 -*- import sys import numpy as np from PyQt4.QtCore import * from PyQt4.QtGui import * from PyQt4.

寻找大整数的最大质因数：Project Euler Problem 3

在给定的标题"ProJectEulerProblem3"中，这是一个关于编程挑战的问题，源自著名的Project Euler系列，问题3要求找到600851475143这个数字的最大质因数。描述中提到，13195的质因数包括5、7、13和29，这可能是为了...