GO Solution For UVa 10038 - Jolly Jumpers. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

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. For instance,

1 4 2 3

is a jolly jumper, because the absolutes differences are 3, 2, and 1 respectively. The definition implies that any

...

You can find the full details of the problem Jolly Jumpers at UVa Online Judge

Sample Input

4 1 4 2 3
5 1 4 2 -1 6

Sample Output

Jolly
Not jolly

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985