【Project Euler】2 第二题

最新推荐文章于 2024-12-17 13:51:13 发布

转载最新推荐文章于 2024-12-17 13:51:13 发布 · 69 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/nomasp/blog/503367

本文探讨了斐波那契数列中不超过四百万的偶数值项的总和问题，通过C#代码实现，展示了如何生成斐波那契数列并筛选出符合条件的项进行求和。

//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.

    static void Main()
        {
            int max = 0;
            int[] num=new int[10000];
            num[0]=1;
            num[1]=2;
            int sum = 2;

            for(int i=0;max<4000000;i++)
            {
                num[i + 2] = num[i] + num[i + 1];
                max = num[i + 2];
                if (max % 2 == 0)
                {
                    sum = sum + num[i + 2];
                    if (max > 4000000)
                    {
                        sum = sum - num[i + 2];
                    }
                }

            }
            Console.WriteLine(sum);