ZOJ 1879 Jolly Jumpers

Jolly Jumpers

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

题意：首先题意是相邻2个数相减的数要包括1到n-1

思路：他们相减的t不能＝0,不能超过N,而且相减的出的数字种类不可能有重复，若有重复则肯定1到N-1种
肯定有数字没包含。因为1到N-1有N-1个数，而且两两连续相减可减N-1次，两者等额。所以我们把已经出现的数字用b[t]来标记

代码：

#include <stdio.h>
#include <math.h>
#include <string.h>


int main()
{
    int N;
    int arr[3500];
    int b[3500];
    
    while(scanf("%d",&N)!=EOF)
    {
        int i,t,flag=1;
        memset(b,0, sizeof(b));
        for(i=0;i<N;i++)
            scanf("%d",&arr[i]);
        for(i=0;i<N-1;i++)
        {
            t=fabs(arr[i]-arr[i+1]);
            if(t&&t<N&&!b[t])
                b[t]=1;
            else
            {
                flag=0;
                printf("Not jolly\n");
                break;
            }
        }
        if(flag)
            printf("Jolly\n");
    }
    return 0;
}