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

只是代码可能不符合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. JDK 高性能编程之容器

    高性能编程在对不同场景下对于容器的选择有着非常苛刻的条件,这里记录下前人总结的经验,并对源码进行调试 JDK高性能编程之容器 读书笔记内容部分来源书籍深入理解JVM.互联网等 先放一个类图util,点 ...

  2. A - 敌兵布阵 - hdu 1166

    Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了.A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些 ...

  3. UINavigationController 导航控制器 ,根据文档写的一些东西

    今天讲了导航控制器UINavigationController 和标签栏视图控制器UITabBarController 先来说一说导航视图控制器  UINavigationController 导航控 ...

  4. HDU3631:Shortest Path(Floyd)

    Problem Description When YY was a boy and LMY was a girl, they trained for NOI (National Olympiad in ...

  5. C#量转换为汉字表达

    /* 创造者:菜刀打好博客  * 创建日期: 2014年09一个月04号码  * 特征:Money类型转换  *  */ namespace Net.String.ConsoleApplication ...

  6. unity3d优化IOS

    1. using UnityEngine; class GarbageCollectManager : MonoBehaviour {       public int frameFreq = 30; ...

  7. Linux GRUB 2及修改默认启动项

    The GRUB 2 boot loader makes sure that you can boot Linux. GRUB 2 is installed in the boot sector of ...

  8. HDU 5139 Formula 卡内存

    题目就是求这个 n达到10^7,测试数据组数为10^5 为了防止TLE,一开始把每个n对应的值先求出来,但发现竟然开不了10^7的数组(MLE),然后就意识到这是第一道卡内存的题目... 只能离线做, ...

  9. javascript高级特性(面向对象)

    javascript高级特性(面向对象): * 面向对象: * 面向对象和面向过程的区别: * 面向对象:人就是对象,年龄\性别就是属性,出生\上学\结婚就是方法. * 面向过程:人出生.上学.工作. ...

  10. Hyper-V虚拟机和主机的网络配置

    Hyper-V虚拟机和主机的网络配置 方式1.共享式 这种方式是将Hyper-V内部的虚拟网络与外部网络共享.使得内部是一个私有的网络.属于NAT的类型.(不知道这么说对不对) 优点: 相对来说属于私 ...