https://onlinejudge.org/external/100/10038.pdf

10038 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. 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 sequence of a single integer is a jolly jumper. You are to write a program to determine whether
or not each of a number of sequences is a jolly jumper.

Input
Each line of input contains an integer n ≤ 3000 followed by n integers representing the sequence.

Output
For each line of input, generate a line of output saying ‘Jolly’ or ‘Not jolly’.

Sample Input

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

Sample Output
Jolly
Not jolly

-----------------------------------------------分隔線---------------------------------------

提問：

題目字串一個值應該為N。

而出題者誤導

Jolly Jumpers:

一. 1 2 4 為Jolly， 因為其差值為1 2。 (差值1~(n-1[=2])皆有)

二. 1 3 4 為Jolly， 因為其差值為2 1。 (差值1~(n-1[=2])皆有)

三. 1 2 3 為Not Jolly，因為其差值為1 1。(差值1~(n-1[=2])並非都有，僅只有1而已)

是不是應該為

一、3 1 2 4

二、3 1 3 4

三、3 1 2 3

改偵測字串第一個字為N，
就變AC了