## Welcome To SDIBT ACM-ICPC Online Judge

Problem 1022. -- Jolly Jumpers ## Jolly Jumpers

Time Limit: 1 Sec Memory Limit: 64 MB

Submit: 83 Solved: 26

[Submit][Status][Forum]## Description

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.

## Input

Each line of input contains an integer n < 3, 000 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 6

## Sample Output

Jolly
Not jolly

## HINT

poj2575

## Source

Waterloo local 2000.09.30

[Submit][Status][Forum]

HOME
Back

한국어 中文 English

All Copyright Reserved 2008-2010 SDIBT TEAM

GPL2.0 2003-2010 HUSTOJ Project TEAM

Anything about the Problems, Please Contact Admin:admin