The
only tricks of this problem is hidden is the definition of the
jolly jumpers �A sequence of n > 0 integers is called a
jolly jumper if the absolute values of the difference between
successive elements take on all the values 1 through n-1�.
Note that a jolly jumper must be greater then zero but the input
n can be zero (0) and which is "Not
jolly".
|