96 人解决，135 人已尝试。
111 份提交通过，共有 439 份提交。
3.9 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
A sequence of $n (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.
The first line of input gives the number of cases, $T$ $(1 \leq T \leq 50)$. $T$ test cases follow. Each line is one case, which contains an integer $n < 3000$ followed by $n$ integers representing the sequence.
For each line of input, generate a line of output saying Jolly or Not jolly.
2 4 1 4 2 3 5 1 4 2 -1 6
Jolly Not jolly
96 人解决，135 人已尝试。
111 份提交通过，共有 439 份提交。
3.9 EMB 奖励。