又对啦。。。开心~~~~

只是代码可能不符合PEP标准什么的。。。

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

def Fibonacci(number):
    if number < 1:
        pass
    if number == 1:
        return  1
    if number == 2:
        return  2
    return  Fibonacci(number-1) + Fibonacci(number-2)

sum_even = 0
num = 1
while Fibonacci(num) <= 4000000:

    if Fibonacci(num) % 2 == 0:
        sum_even += Fibonacci(num)
        print 'Num count is', num,'Fibonacci is', Fibonacci(num), 'Sum is',sum_even
    else:
        print 'Num count is', num,'Fibonacci is', Fibonacci(num), 'This number is not even_value.'
    num += 1

输出:

C:\webpy\webpy\Scripts\python.exe C:/pycode/euler.py
Num count is 1 Fibonacci is 1 This number is not even_value.
Num count is 2 Fibonacci is 2 Sum is 2
Num count is 3 Fibonacci is 3 This number is not even_value.
Num count is 4 Fibonacci is 5 This number is not even_value.
Num count is 5 Fibonacci is 8 Sum is 10
Num count is 6 Fibonacci is 13 This number is not even_value.
Num count is 7 Fibonacci is 21 This number is not even_value.
Num count is 8 Fibonacci is 34 Sum is 44
Num count is 9 Fibonacci is 55 This number is not even_value.
Num count is 10 Fibonacci is 89 This number is not even_value.
Num count is 11 Fibonacci is 144 Sum is 188
Num count is 12 Fibonacci is 233 This number is not even_value.
Num count is 13 Fibonacci is 377 This number is not even_value.
Num count is 14 Fibonacci is 610 Sum is 798
Num count is 15 Fibonacci is 987 This number is not even_value.
Num count is 16 Fibonacci is 1597 This number is not even_value.
Num count is 17 Fibonacci is 2584 Sum is 3382
Num count is 18 Fibonacci is 4181 This number is not even_value.
Num count is 19 Fibonacci is 6765 This number is not even_value.
Num count is 20 Fibonacci is 10946 Sum is 14328
Num count is 21 Fibonacci is 17711 This number is not even_value.
Num count is 22 Fibonacci is 28657 This number is not even_value.
Num count is 23 Fibonacci is 46368 Sum is 60696
Num count is 24 Fibonacci is 75025 This number is not even_value.
Num count is 25 Fibonacci is 121393 This number is not even_value.
Num count is 26 Fibonacci is 196418 Sum is 257114
Num count is 27 Fibonacci is 317811 This number is not even_value.
Num count is 28 Fibonacci is 514229 This number is not even_value.
Num count is 29 Fibonacci is 832040 Sum is 1089154
Num count is 30 Fibonacci is 1346269 This number is not even_value.
Num count is 31 Fibonacci is 2178309 This number is not even_value.
Num count is 32 Fibonacci is 3524578 Sum is 4613732

Process finished with exit code 0

求四百万以内Fibonacci(number)数列偶数结果的总和的更多相关文章

  1. 第2章 数字之魅——斐波那契(Fibonacci)数列

    斐波那契(Fibonacci)数列 问题描述 递归算法: package chapter2shuzizhimei.fibonacci; /** * Fibonacci数列递归求解 * @author ...

  2. 2.裴波那契(Fibonacci)数列

    裴波那契(Fibonacci)数列 f(n)= ⎧⎩⎨0,1,f(n−1)+f(n−2),n =0n =1n>1 求裴波那契数列的第n项.(题目来自剑指offer) 1.递归解法,效率很低的解法 ...

  3. 求出10000以内所有的完全数-python

    题目: 如何用python去求出下一个(大于28的)完全数? (求出10000以内所有的完全数) 分析: 如果一个数恰好等于它的因子之和,则称该数为"完全数".各个小于它的约数(真 ...

  4. Algorithms - Fibonacci Number

    斐波那契数列(Fibonacci Number)从数学的角度是以递归的方法定义的: \(F_0 = 0\) \(F_1 = 1\) \(F_n = F_{n-1} + F_{n-2}\) (\(n \ ...

  5. Buge's Fibonacci Number Problem

    Buge's Fibonacci Number Problem Description snowingsea is having Buge’s discrete mathematics lesson, ...

  6. [UCSD白板题] The Last Digit of a Large Fibonacci Number

    Problem Introduction The Fibonacci numbers are defined as follows: \(F_0=0\), \(F_1=1\),and \(F_i=F_ ...

  7. [UCSD白板题 ]Small Fibonacci Number

    Problem Introduction The Fibonacci numbers are defined as follows: \(F_0=0\), \(F_1=1\),and \(F_i=F_ ...

  8. (斐波那契总结)Write a method to generate the nth Fibonacci number (CC150 8.1)

    根据CC150的解决方式和Introduction to Java programming总结: 使用了两种方式,递归和迭代 CC150提供的代码比较简洁,不过某些细节需要分析. 现在直接运行代码,输 ...

  9. Fibonacci number

    https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Moc ...

随机推荐

  1. H - Highways - poj 1751(prim)

    某个地方政府想修建一些高速公路使他们每个乡镇都可以相同通达,不过以前已经修建过一些公路,现在要实现所有的联通,所花费的最小代价是多少?(也就是最小的修建长度),输出的是需要修的路,不过如果不需要修建就 ...

  2. oracle用户解锁和改密

    alter user hs_user account unlock; alter user hs_asset account unlock; alter user hs_his account unl ...

  3. WebLogic简单的备份和恢复

    万一发生故障,为了迁移或者恢复WebLogic域,应定期地备份管理服务器机器上的整个域目录树.这样,只需恢复域目录并重启管理服务器就可以使服务器从硬件或者系统故障中恢复.在WebLogic生产域中,需 ...

  4. python Eve RESTFul 尝试笔记

    0.前言 最近重点研究了yeelink平台的原理和使用,yeelink平台和多数云平台设计一样应用了RESTFul框架.嵌入式侧(或者是客服端侧)的相关技术研究的比较充分(个人这么认为),是不是该弄弄 ...

  5. Spring 3 来创建 RESTful Web Services

    Spring 3 创建 RESTful Web Services 在 Java™ 中,您可以使用以下几种方法来创建 RESTful Web Service:使用 JSR 311(311)及其参考实现 ...

  6. HDU1007 Quoit Design 【分治】

    Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

  7. Java集合类具体解释

    假设您喜欢这些文章,欢迎点击此处订阅本Blog 集合类说明及差别 Collection ├List │├LinkedList │├ArrayList │└Vector │ └Stack └Set Ma ...

  8. 我的Android进阶之旅------>Android 设置默认语言、默认时区

    1. 设置默认时区 PRODUCT_PROPERTY_OVERRIDES += \ persist.sys.timezone=Asia/Shanghai\ 注:搜索“persist.sys.timez ...

  9. Json序列反序列类型处理帮助类

    Json序列反序列类型处理帮助类. JSON反序列化 JSON序列化 将Json序列化的时间由/Date(1294499956278+0800)转为字符串 将时间字符串转为Json时间 using S ...

  10. Linux 基础入门----推荐课程

    Linux 基础入门课程:https://www.shiyanlou.com/courses/1 很好的一门Linux基础课,精炼.简洁!推荐! 课程内容: 第1节 Linux 系统简介 https: ...