find the sum of the even-valued terms

最新推荐文章于 2024-11-15 13:54:53 发布

ethan w.

最新推荐文章于 2024-11-15 13:54:53 发布

阅读量308

点赞数 1

分类专栏： Project Euler 文章标签： C C++ C#

Project Euler 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一个关于斐波那契数列的问题：计算不超过四百万的所有偶数值项的总和。通过一个简单的Java程序实现了这一目标，程序采用迭代的方式生成斐波那契数列，并累加其中的偶数值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 FibonacciSequence {

	public static void main(String args[]){
		int sum = 0;
		int a = 1;
		int b = 2;
		int c = 3;
		/**
		 * 求偶数之和
		 * 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
		 * a, b, c
		 *    a, b, c
		 *       a, b, c
		 *          a, b, c
		 * */
		while (b < 4000000){
			sum += b;			
			a = b + c;
			b = a + c;
			c = a + b;
		}
		System.out.println(sum);
	}
}