2013
11-11

# 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”.

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


Jolly
Not jolly


//* @author: 82638882@163.com
import java.util.HashSet;
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner in=new Scanner(System.in);
while(in.hasNext())
{
int a=in.nextInt();
int[] b=new int[a];
for(int i=0;i< a;i++)
b[i]=in.nextInt();
HashSet< Integer> h=new HashSet< Integer>();
for(int i=1;i< a;i++)
h.add(Math.abs(b[i]-b[i-1]));
boolean bb=true;
for(int i=1;i< a;i++)
{
if(!h.contains(i)){
bb=false;
break;
}
}
if(bb) System.out.println("Jolly");
else System.out.println("Not jolly");
}
}
}