Pro.ID21148 TitleJolly Jumpers Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21148 AC74 Submit290 Ratio25.52% 时间&空间限制描述A sequence of 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 3is 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.输入Each line of input contains an integer n < 3000 followed by n integers representing the sequence. 输出Description A sequence of 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 3is 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 < 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 jollySource 样例输入4 1 4 2 3
5 1 4 2 -1 6样例输出Jolly
Not jolly作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2024-9-21 19:41 , Processed in 0.015260 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
