内存:64  时间:1

题目描述

A sequence of n > 0 integers is called a jolly jumper if the absolute values of the differences between successive elements take on all possible values 1 through n – 1. For instance,

1 4 2 3

is a jolly jumper, because the absolute differences are 3, 2, and 1, respectively. The definition implies that any sequence of a single integer is a jolly jumper. Write a program to determine whether each of a number of sequences is a jolly jumper.

输入

Each line of input contains an integer n < 3, 000 followed by n integers representing the sequence

输出

For each line of input generate a line of output saying “Jolly’ or “Not jolly’.

样例输入

4 1 4 2 3
5 1 4 2 -1 6

样例输出

Jolly
Not jolly

提示

poj2575

代码如下

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define MAX 3001
using namespace std;
int s[MAX];
bool app[MAX];
int main()
{
    int n;
    while(cin>>n)
    {
        int i;
        memset(app,0,n+1);
        for(i=0;i<n;++i)
            scanf("%d",&s[i]);
        for(i=1;i<n;++i)
        {
            int t=fabs(s[i]-s[i-1]);
            if(t>=n||t<=0)break;
            if(app[t])break;
            app[t]=true;
        }
        if(n==i)cout<<"Jolly"<<endl;
        else cout<<"Not jolly"<<endl;
    }
    return 0;
}

代码来源于互联网,仅供参考!