E - Jolly Jumpers

E - Jolly Jumpers

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status

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

难懂的题意。。（被题意坑了一发QAQ）

首先输入一个正整数n，后接n个数字，每连续的两个数字相减的绝对值组成1~n-1共n-1个数字。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;

const int MAX=3050;
int a[MAX];
int b[MAX];
int n;
int main(){
    while(~scanf("%d",&n)){
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
        }
        if(n==1){//当n为1时直接输出 
            printf("Jolly\n");
            continue;
        }
        for(int i=1;i<n;i++){//两两相减的绝对值 
            b[i]=abs(a[i]-a[i-1]);
        }
        int temp;
        for(int i=1;i<n;i++){//冒泡排序 
            for(int j=n-1;j>=i;j--){
                if(b[j]<b[j-1]){
                    temp=b[j];
                    b[j]=b[j-1];
                    b[j-1]=temp;
                }
            }
        }
        int ans=0;
        for(int i=1;i<n;i++){//记录相等数字数 
            if(b[i]==i)
            ans++;
        }
        if(ans==n-1)
        printf("Jolly\n");
        else
        printf("Not jolly\n");
    }
    return 0;
}