2.8.1 快乐的跳跃着 Jolly Jumpers
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
本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来自 CHC's Blog！