Prioject Euler problem2 :Even Fibonacci numbers
2017-07-28 22:59
483 查看
问题描述:
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.
C++实现:
#include <bits/stdc++.h> using namespace std; int main(){ long f1 = 1; long f2 = 2; long f3 = 2; long sum = 0; for (; f3 < 4000000 ;) { if(f3 % 2 == 0){ sum += f3; } f3 = f1 + f2; f1 = f2; f2 = f3; } cout<< sum << endl; return 0; }
python 实现:
i = 1 j = 2 f = 2 sum = 0 max = 4E6 while f < max: if f % 2 == 0: sum += f f = i + j i = j j = f print(sum)
相关文章推荐
- [projecteuler]Even Fibonacci numbers
- (Problem 2)Even Fibonacci numbers
- Project Euler 2 Even Fibonacci numbers
- Project Euler 002 Even Fibonacci numbers
- 欧拉计划(2)Even Fibonacci numbers
- (Problem 2)Even Fibonacci numbers
- 【Project Euler】【Problem 2】Even Fibonacci numbers
- (Problem 2)Even Fibonacci numbers
- ProjectEuler编程之旅:2. Even Fibonacci numbers
- PE2 Even Fibonacci numbers(最大菲波那列偶数)
- 2 Even Fibonacci numbers - Project Euler
- Problem 2 : Even Fibonacci numbers
- PE2-Even Fibonacci numbers
- Problem 2 Even Fibonacci numbers
- Even Fibonacci numbers
- Project Euler Problem 2 - Even Fibonacci numbers
- 【欧拉计划2】Even Fibonacci numbers
- 欧拉项目第二题 Even Fibonacci numbers
- Even Fibonacci numbers
- 【欧拉计划2】Even Fibonacci numbers