zoj1879

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

就是差值的绝对值要在1-n-1中全部出现或

数列只有一个数

都为Jolly

代码：

 #include<stdio.h>      #include<stdlib.h>      #include<map>      #include<iostream>      using namespace std;            int main()      {          int n;          int prev;          int curr;          int ab;          map<int,int> m;          bool isjolly;                while(cin>>n)          {              m.clear();              isjolly=true;              for(int i=0;i<n;i++)              {                  cin>>curr;                  if(i!=0)                  {                      ab=abs(prev-curr);                      m[ab]++;                      if(m[ab]!=1||ab>n-1||ab==0)                      {                          isjolly=false;                      }                     }                  prev=curr;              }              if(isjolly)                  cout<<"Jolly"<<endl;              else                  cout<<"Not jolly"<<endl;          }        return 0;    }