UVA_10038_Jolly_Jumpers

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;

int main() {
    vector<int> v;int dif,n,j;bool fallo;
    while(scanf("%d",&n)!=EOF){
        bool arr[n];
        fallo=false;
        for (int i=0;i<n;i++){
            scanf("%d",&j);
            v.push_back(j);
        }
        if(n==1){
            printf("Jolly\n");
        }else{
            for(int i=1;i<=n-1;i++){
            arr[i]=false;
        }

        for(int i=0;i<(v.size()-1);i++){
            dif=abs(v[i]-v[i+1]);
            if(dif>=1 && dif<=n-1) arr[dif]=true;
        }
        for(int i=1;i<=n-1;i++){
            if(arr[i]) continue;
            else {
                fallo=true;
                break;
            }
        }
        if(fallo) printf("Not jolly\n");
        else printf("Jolly\n");
        }

        v.clear();
    }
    return 0;
}