fjnu 1532 Jolly Jumpers

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

KEY: 做个数组存放差值，检查；

 

Source:

#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;

int n;
int c[3000];
int elem[3001];

void input()
...{
    int i;
    for(i=1;i<=n;i++)
        cin>>elem[i];
    for(i=1;i<n;i++)
    ...{
        int t=elem[i]-elem[i+1];
        if(t<0) t=-t;
        c[i]=t;
    }
}

int jolly()
...{
    int i,j;
    for(i=1;i<=n-1;i++)
        for(j=1;j<=n-1;j++)
            if(c[i]>c[j])
            ...{
                int t;
                t=c[i];
                c[i]=c[j];
                c[j]=t;
            }
    int k=1;
    for(i=n-1;i>0;i--)
        if(c[k++]!=i) return 0;
    return 1;
}

int main()
...{
//    freopen("fjnu_1532.in","r",stdin);
    while(cin>>n)
    ...{
        input();
        if(jolly()) cout<<"Jolly"<<endl;
        else cout<<"Not jolly"<<endl;
    }
    return 0;
}