Programming Challege

Warm-up problem

Try it yourselves without the help of Larry Page and Sergey Brin!!!

Do not post your solution here...

PM me your solution!!!
----------------------------------------------------------------------------

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.

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 6

Sample Output

Jolly
Not jolly

Each line of input contains an integer n <= 3000 followed by n integers representing the sequence.

waaaa. hindi ko maintindihan. T_T ibig sabihin may array[3000] ?

basag ang comprehension ko dito T_T

imba! kahirap nmn nyan.

pang CS kc....^^

paulgarcia wrote:pang CS kc....^^

Whether your BSCS or not, trying to solve this will increase your logic thinking.
Remember, almost all computer related courses are basically full of logic...

arscariosus wrote:

Each line of input contains an integer n <= 3000 followed by n integers representing the sequence.

waaaa. hindi ko maintindihan. T_T ibig sabihin may array[3000] ?

basag ang comprehension ko dito T_T

Try reading between the lines.
I might help you understand what is meant by n <= 3000.

david signature mo..XD

Chyrl wrote:

arscariosus wrote:

Each line of input contains an integer n <= 3000 followed by n integers representing the sequence.

waaaa. hindi ko maintindihan. T_T ibig sabihin may array[3000] ?

basag ang comprehension ko dito T_T

Try reading between the lines.
I might help you understand what is meant by n <= 3000.

Sir I think I get the first part about the absolute differences and the 1..n-1 range. But I might be wrong. Plus I can't comprehend this line. Hmm... Each line of input... Does that mean the program could accept multiple lines of input at a time? And a line that has a single integer in it is automatically a jolly jumper?

arscariosus wrote:Does that mean the program could accept multiple lines of input at a time?

Maybe, it depends on the logic of your code.
Have you acquired to right output[n] for the given input[n], where n is the number of test cases?