gistfile1.hpp

#include <iostream>

// Recursive case:
template <int N> struct Fib {
    enum { val = Fib<N-1>::val
               + Fib<N-2>::val };
};

// Base cases:
template <> struct Fib<0> { enum { val = 0 }; };
template <> struct Fib<1> { enum { val = 1 }; };

int main()
{
    std::cout << "first ten fibonacci numbers: "
              << Fib<0>::val << ", "
              << Fib<1>::val << ", "
              << Fib<2>::val << ", "
              << Fib<3>::val << ", "
              << Fib<4>::val << ", "
              << Fib<5>::val << ", "
              << Fib<6>::val << ", "
              << Fib<7>::val << ", "
              << Fib<8>::val << ", "
              << Fib<9>::val << std::endl;
    return 0;
}