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 sumFib(n):
result = 0
first = 1
second = 1
while True:
first,second = second,first + second
if second > n:
break
elif second % 2 == 0:
result += second
return result
print(sumFib(4000000))
本文介绍了一个关于斐波那契数列的问题:计算不超过四百万的所有偶数值项的总和。通过递推公式生成斐波那契数列,并筛选符合条件的偶数项进行求和。
886

被折叠的 条评论
为什么被折叠?



