Determine the largest int n so that n factorial is less than numeric_limits::max(). Then form an array of n+1 or more distinct ints and test if next_permutation can reorder them without causing an integer overflow.

Describe how the STL numeric algorithm power could use the bit structure of the integer exponent to compute the power via multiplications. For example, suppose that we want to compute the nth power of a square matrix.