Online Judge - 10038 - Jolly Jumpers
來源代碼：UVa
時間限制：3 s
題目說明
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 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.
輸入說明
Each line of input 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’.
輸入輸出範例
範例輸入
4 1 4 2 3 5 1 4 2 -1 6
範例輸出
Jolly Not jolly
討論
登入後即可加入討論。
登入
目前還沒有討論文章。