Using C++ templates to compute Fibonacci numbers at compile time

FibonacciWithTemplates.cpp

#include <iostream>

template <int n> struct Fib
{
    enum { val = Fib<n - 1>::val + Fib<n - 2>::val };
};

template<> struct Fib<0> { enum { val = 0 }; };
template<> struct Fib<1> { enum { val = 1 }; };

int main()
{
    std::cout << Fib<0>::val << std::endl;
    std::cout << Fib<1>::val << std::endl;
    std::cout << Fib<2>::val << std::endl;
    std::cout << Fib<3>::val << std::endl;
    std::cout << Fib<4>::val << std::endl;
    std::cout << Fib<5>::val << std::endl;
    std::cout << Fib<6>::val << std::endl;
    getchar();
    return 0;
}

Using

template <unsigned long long n>
struct fib {
    enum : unsigned long long { result = fib<n - 1>::result + fib<n - 2>::result };
};
template<> struct fib<0> { enum { result = 0 }; };
template<> struct fib<1> { enum { result = 1 }; };

OR

template <unsigned long long n>
struct fib {
    static constexpr unsigned long long result = fib<n - 1>::result + fib<n - 2>::result;
};
template<> struct fib<0> { static constexpr int result = 0; };
template<> struct fib<1> { static constexpr int result = 1; };

you an compute up-to fib<105>::result which is 17704020980446223138.