zoj 1879 Jolly Jumpers

//要遍历1到n-1之间的所有值，考虑n=1特殊情况

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
int main()
{
	int n,x,y,flag,num,*p,i;
	while(scanf("%d",&n)!=EOF){
		
		flag = 0;
		p = (int *)malloc(sizeof(int)*n);
		memset(p,0,n*sizeof(int));
		num = n;
		scanf("%d",&x);
		if(n == 1){
			printf("Jolly\n");
			continue;
		}
		n--;
		while(n--){
			scanf("%d",&y);
			if(abs(x - y)>num-1||abs(x - y) == 0) 
				flag = 1;
				else p[abs(x - y)] = 1;
			x = y;
		}
		for(i = 1;i<num;i++)
		if(p[i] != 1) {
			flag = 1;
			break;
		}
		if(flag == 0) printf("Jolly\n");
		else printf("Not jolly\n");
	}
	return 0;
}