zoukankan      html  css  js  c++  java
  • 【Project Euler】2 第二题

    

    //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);

            }

    版权声明:本文为 NoMasp柯于旺 原创文章,如需转载请联系本人。

  • 相关阅读:
    HttpModule学习总结实例应用读书笔记
    SEO入门教程之入门相关
    HttpHandler学习总结实例应用读书笔记
    服务器安全设置总结(Win2003)
    网站建设合同书
    HTML标签解释大全
    敏捷之痒
    一个google浏览器很意思的东东
    C#访问非托管DLL
    随着DzNT的开源,我将投入到.NET的开发当中
  • 原文地址:https://www.cnblogs.com/NoMasp/p/4786200.html
Copyright © 2011-2022 走看看