poj 2575 Jolly Jumpers-优快云博客

Jolly Jumpers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13224		Accepted: 4087

Description

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

#include<iostream>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
    {
int arr[3000]={0};              
int mark[3000]={0};             
int i;                          
for(i=0;i<n;i++)                
            cin>>arr[i];                   
for(i=0;i<n-1;i++)              
        {                               
            mark[abs((arr[i+1]-arr[i]))]=1;
        }                        
for(i=1;i<n;i++)              
        {                               
if(mark[i]==0)                 
            {                              
                cout<<"Not jolly"<<endl;      
break;                        
            }                              
        }                               
if(i==n)                      
            cout<<"Jolly"<<endl;               
    }
return 0; 
}