Calculates the sum of the first N members of the sequence of Fibonacci: 0, 1, 1, 2, 3, 5, 8, 13, 21, - CSharp Data Structure Algorithm

Description

Calculates the sum of the first N members of the sequence of Fibonacci: 0, 1, 1, 2, 3, 5, 8, 13, 21,

Demo Code

using System;/*from  w  w w  . j  a va  2s. com*/
using System.Numerics;

class Fibonacci
{
    static void Main()
    {
        int n = int.Parse(Console.ReadLine());
        BigInteger temp = 0;
        BigInteger firstNum = 0;
        BigInteger secondNum = 1;
        BigInteger sum = 0;
        if (n == 0 || n == 1)
        {
            Console.WriteLine(0);
        }
        else
        {
            for (int i = 0; i < (n - 2); i++)
            {
                temp = firstNum + secondNum;
                firstNum = secondNum;
                secondNum = temp;
                sum += temp;
            }
            Console.WriteLine(1 + sum);
        }
    }
}

• Previous
• Next

Related Tutorials

• Prints all possible cards from a standard deck of 52 cards
• Calculate the Nth Catalan number by given N
• Calculates the greatest common divisor (GCD) of given two numbers. Use the Euclidean algorithm.
• For a given two integer numbers N and X, calculates the sumS = 1 + 1!/X + 2!/X2 + ... + N!/XN
• Calculates N!/K! for given N and K (1<K<N).