求四百万以内Fibonacci(number)数列偶数结果的总和
又对啦。。。开心~~~~
只是代码可能不符合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)数列偶数结果的总和的更多相关文章
- 第2章 数字之魅——斐波那契(Fibonacci)数列
		
斐波那契(Fibonacci)数列 问题描述 递归算法: package chapter2shuzizhimei.fibonacci; /** * Fibonacci数列递归求解 * @author ...
 - 2.裴波那契(Fibonacci)数列
		
裴波那契(Fibonacci)数列 f(n)= ⎧⎩⎨0,1,f(n−1)+f(n−2),n =0n =1n>1 求裴波那契数列的第n项.(题目来自剑指offer) 1.递归解法,效率很低的解法 ...
 - 求出10000以内所有的完全数-python
		
题目: 如何用python去求出下一个(大于28的)完全数? (求出10000以内所有的完全数) 分析: 如果一个数恰好等于它的因子之和,则称该数为"完全数".各个小于它的约数(真 ...
 - Algorithms - Fibonacci Number
		
斐波那契数列(Fibonacci Number)从数学的角度是以递归的方法定义的: \(F_0 = 0\) \(F_1 = 1\) \(F_n = F_{n-1} + F_{n-2}\) (\(n \ ...
 - Buge's Fibonacci Number Problem
		
Buge's Fibonacci Number Problem Description snowingsea is having Buge’s discrete mathematics lesson, ...
 - [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_ ...
 - [UCSD白板题 ]Small Fibonacci Number
		
Problem Introduction The Fibonacci numbers are defined as follows: \(F_0=0\), \(F_1=1\),and \(F_i=F_ ...
 - (斐波那契总结)Write a method to generate the nth Fibonacci number (CC150 8.1)
		
根据CC150的解决方式和Introduction to Java programming总结: 使用了两种方式,递归和迭代 CC150提供的代码比较简洁,不过某些细节需要分析. 现在直接运行代码,输 ...
 - Fibonacci number
		
https://github.com/Premiumlab/Python-for-Algorithms--Data-Structures--and-Interviews/blob/master/Moc ...
 
随机推荐
- war文件
			
原文地址:http://blog.sina.com.cn/s/blog_4cbc6fdd0100fojv.html jar包和war包的区别:war是一个web模块,其中需要包括WEB-INF,是可以 ...
 - jQuery.each() 的5个案例
			
1.基本的jQuery.each实例 看看 each() 函数是如何处理一个 jQuery 对象的.首先选取所有的a标签 并且打印出他们的href属性. 需要注意的是, 在 each() 当中使用 j ...
 - C++ STL set集合容器
			
汇总了一些set的常用语句,部分参考了这篇:http://blog.163.com/jackie_howe/blog/static/199491347201231691525484/ #include ...
 - 深搜最基础题---全排列And组合数
			
这个是理解标记和取消标记,用一个vis数组来标记 全排列代码: #include <stdio.h> ]; ]; int n; void dfs(int step)//step是当前已经进 ...
 - Cannot modify header information - headers already sent by
			
有时候你在使用 header("Location: http://localhost/myblog/index.php/manager/listview");的时候会出现这个问题, ...
 - sping注解原理
			
持续更新中.. spring注解用的是java注解,用到的是java反射机制. 参考文档如下: http://zxf-noimp.iteye.com/blog/1071765 对应spring源码如下 ...
 - Android开发手记(9) DatePickerDialog 和 TimePickerDialog
			
1.DatePickerDialog 用于获取用户输入的日期信息.其原型为: public DatePickerDialog(Contex contex, DatePickerDialog.OnDa ...
 - Swift - 42 - 类的基本使用
			
import Foundation /* 1.class表示类的关键字 2.class后面表示类名 3.类名后面的大括号内表示类的内部 */ /* 1.属性封装了set和get方法 2.方法里面封装了 ...
 - react-native-router-flux 下部导航
			
github url:https://github.com/aksonov/react-native-router-flux API: https://github.com/aksonov/react ...
 - C++:MEMSET的大坑三两事
			
之前写了一题费用流,竟然硬是在写SPFA时为DIS数组赋初始值用了MEMSET数组QAQ 调试了很久也没有弄明白自己是卡在那里了,,,感觉被自己蠢哭了QWQ 错误的姿势!! #include < ...