斐波那契数列

我们以从零开始的斐波那契为例实现斐波那契数列的求解，
（0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986）

#include <iostream>

void Fibonacci(int n)
{
    long long int a = 0, b = 1;
    long long int num;
    if (n >= 0)
    {
        std::cout << 0 << " ";
    }
    if (n >= 1)
    {
        std::cout << 1 << " ";
    }

    for (int i = 2; i <= n; i++)
    {
        num = a + b;
        a = b;
        b = num;
        std::cout << num << " ";
    }
    std::cout << std::endl;
}

int main()
{
    Fibonacci(39);

    system("pause");
    return 0;
}