UVa OJ 10038 - Jolly Jumpers

也许是最简单的题目了。

1042119410038Jolly JumpersAcceptedC++0.0122012-08-02 05:45:19

#include <iostream>#include<cstring>using namespace std;int abs(int a,int b){int c = a-b;if (c<0)c*=-1;return c;}int main(){int n;while(cin>>n){int seq[3000];memset(seq,0,sizeof(seq));int fir;int sec;cin>>fir;for (int i=1;i<=n-1;i++){cin>>sec;seq[abs(fir,sec)]=1;fir = sec;}int t=0;for (int i=1;i<=n-1;i++)t+=seq[i];if (t==n-1)cout<<"Jolly";elsecout<<"Not jolly";cout<<endl;}return 0;}