The Fizz Buzz problem is a very basic problem to solve that is used by some to weed out interviewees that don't know how to program. The problem is:
Set N = [0,100] Set F = x in N where x % 3 == 0 Set B = x in N where x % 5 == 0 Set FB = F intersect B For all N: if x in F: print fizz if x in B: print buzz if x in FB: print fizzbuzz if x not in F|B|FB print x
The object of this modification of the Fizz Buzz problem is to perform the above algorithm using C++ templates such that as few runtime operations are necessary as can be done.
You can reduce N to a smaller range if you need to in order to fit within TMP objects where necessary.
This isn't expected to be a "golf".