#include<stdio.h>
#include<math.h>
int main() {
    int n, i, j, flag = 1,cnt=0;
    int a[1000];
    int d[1000];
    int num[1000];
    for (i = 0; i < 1000; i++) {
        d[i] = 0; num[i] = i;
    }
    scanf_s("%d %d", &n, &a[0]);
    for (i = 1; i < n; i++) {
        scanf_s("%d", &a[i]);
        d[i] = abs(a[i] - a[i - 1]);
    }
    for (i = 1; i < n; i++) {
        for (j = 1; j < n; j++) {
            if (num[i] == d[j]) cnt++;
        }
    }
    if (cnt == n - 1) printf("Jolly");
    else printf("Not jolly");
    return 0;
}\\我的代码


#include<stdio.h>
int main() {
    int n,m;
    int sum = 0;
    long zhi[10000];
    long  arr[100000];
    scanf_s("%d %d", &n,&m);
    arr[0] = m;
    for (int i = 1;i <= n-1;i++) {
        scanf_s("%d", &arr[i]);
        if (arr[i] > arr[i - 1]) {
            zhi[i] = arr[i] - arr[i - 1];
        }
        else {
            zhi[i] = arr[i - 1] - arr[i];
        }
        
    }for (int k = 1;k <= n - 1;k++) {
        for (int j = 1;j <= n - 1;j++) {
            if (zhi[j] == k) {
                zhi[j] = 1;
                sum += zhi[j];
                
            }
        }
    }if (sum == n-1) {
        printf("Jolly");
    }
    else {
        printf("Not Jolly");
    }
    return 0;
}\\朋友的