Problem 2 of Fibonacci

最新推荐文章于 2024-03-08 09:30:00 发布

原创最新推荐文章于 2024-03-08 09:30:00 发布 · 617 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string #class #each #c

欧拉项目专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个关于斐波那契数列的问题：计算不超过四百万的所有偶数值的斐波那契数之和。通过Java实现的程序代码展示了如何生成斐波那契数列并筛选出符合条件的项进行求和。

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.

public class Fibonacci {
	public static void main(String args[]){
		int a=1,b=2,c=0,sum=0;
		do {
			if(a%2==0){
				sum+=a;
			}
			if(b%2==0){
				sum+=b;
			}
			c=a+b;
			a=c;
			b=c+b;
		} while (c<4000000);
		System.out.println("sum="+sum);
	}
}

Answer:

4613732