project euler 02

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

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

 

源码如下：

            int sum = 0, n = 0;
            for (int i = 1; Fun02(i) < 4000000; i++)
            {
                n = Fun02(i);
                if (n % 2 == 0)
                {
                    sum += n;
                }
            }
            MessageBox.Show(sum.ToString());
int Fun02(int n)
        {
            if (n == 2 || n == 1)
                return n;
            else
                return this.Fun02(n - 1) + Fun02(n - 2);
        }