# Jolly jumper
題目連結 [UVa 10038](https://onlinejudge.org/external/100/10038.pdf)

## 中文簡述

## [think]

## solution:

#include <bits/stdc++.h>  
using namespace std; 
int main()  
{  
    int n;  
    while (cin>>n)
	{
		int data[n],have[n];
		int i;
	    for (i<0;i<n;i++)
		{  
	    	cin>>data[i];
	    	have[i]=0;
		}
		for (i=1;i<n;i++)
		{
			have[abs(data[i]-data[i-1])]=1;
		}
	    int sum=0;
		for(i=1;i<n;i++)
		{
			sum+=have[i];
		}
	    if(sum==n-1)
	    {
	    	cout<<"Jolly"<<endl;
		}
		else
		{
			cout<<"Not jolly"<<endl;
		}
    }  
}  

###### tags: `UVA`
回目錄 [學習筆記](/gIBZqAbWTCis7uOPp149gA)