作业帮C++麻烦解释一下题目意思Description: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
来源：学生作业帮助网 编辑：作业帮 时间：2024/04/29 14:31:32
C++麻烦解释一下题目意思Description: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
C++麻烦解释一下题目意思
Description: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.
Input:Each line of input contains an integer n (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 6Sample Output:Jolly
Not jolly
C++麻烦解释一下题目意思Description: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
描述：一组由n个数字组成的序列,如果序列中所有两个连续数之间差值的绝对值刚好是1到n-1这些数,那么这个序列就称为jolly jumper.比如,1 4 2 3就是一个jolly jumper.因为差值的绝对值分别是3,2和1.这个定义同时告诉我们单独一个数字也是jolly jumper.你需要写一个程序来确定一组序列是否是jolly jumper.
输入：一行数字,包含一个n,和n个数字组成的序列.
输出：对于每一行输入,确定它们是否是Jolly.如果是输出Jolly.不是的话输出Not jolly.
例子输入：4 1 4 2 3
5 1 4 2 -1 6
例子输出：Jolly
Not jolly