跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0500. Problem C: Jolly Jumpers

  • ID: 506
  • 传统题
  • 1000ms
  • 128MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Problem C: Jolly Jumpers

题目描述

Problem C: Jolly Jumpers

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".

样例 1

输入

4 1 4 2 3
5 1 4 2 -1 6

输出

Jolly
Not jolly

题目来源:fps-zhblue-waterloo-000930.xml;FPS 共享题包,题包内第 3 题。保留原作者与原赛事署名。