2783. jolly jumper

单点时限: 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.

样例

Input
2
4 1 4 2 3
5 1 4 2 -1 6
Output
Jolly
Not jolly

93 人解决,130 人已尝试。

107 份提交通过,共有 409 份提交。

3.9 EMB 奖励。

创建: 11 年,11 月前.

修改: 4 年,2 月前.

最后提交: 1 周,1 天前.

来源: ECNU 2009 ACM selective trial From waterloo

题目标签