Jolly Jumpers
时间: 1ms 内存:64M
描述:
A sequence of n > 0 integers is called a jolly jumper if the absolute values of the differences between successive elements take on all possible values 1 through n - 1. For instance,
1 4 2 3
is a jolly jumper, because the absolute differences are 3, 2, and 1, respectively. The definition implies that any sequence of a single integer is a jolly jumper. Write a program to determine whether each of a number of sequences is a jolly jumper.
输入:
Each line of input contains an integer n < 3, 000 followed by n integers representing the sequence
输出:
For each line of input generate a line of output saying ``Jolly'' or ``Not jolly''.
示例输入:
4 1 4 2 3
5 1 4 2 -1 6
示例输出:
Jolly
Not jolly
提示:
参考答案:
文章评论