UVa 10038 Jolly Jumper

3
5
2015

#include <iostream>
#include <cstdlib>
#include <cstring>
using namespace std;

int n,a[3000];
bool b[3000];
int main()
{
	while (cin>>n){
		memset(b,0,sizeof(b));
		for (int i=0;i<n;++i)
			cin>>a[i];
		for (int i=1;i<n;++i){
			int x=abs(a[i]-a[i-1]);//相邻差的绝对值
			if (x==0 || x>=n || b[x]){//若x不在范围内或前面已经有过了，
				cout<<"Not jolly"<<endl; //肯定不是jolly jumper，跳出
				goto next;
			}
			b[x]=1;
		}
		cout<<"Jolly"<<endl;//前面都没跳出，就是jolly jumper
		next:;
	}
	return 0;
}

Category: 题解 | Tags: UVa 挑战编程模拟 | Read Count: 473