uva 10038
2013-11-09 09:43
309 查看
#include <iostream> #include <cstring> #include <cstdlib> #include <stdio.h> using namespace std; #define MAXN 3010 int data[3010]; int flag[3010]; int main() { //freopen("in.txt","r",stdin); int i,n; while(cin>>n){ for(i=0;i<n;i++) { cin>>data[i]; } memset(flag,0,sizeof(flag)); int ans=1; for(i=0;i<n-1;i++) { if(abs(data[i+1]-data[i])>n-1) { ans=0; break; } if(flag[abs(data[i+1]-data[i])]==0) flag[abs(data[i+1]-data[i])]=1; else { ans=0; break; } } if(ans) cout<<"Jolly"<<endl; else cout<<"Not jolly"<<endl; } return 0; }
相关文章推荐
- UVa 10038 - Jolly Jumpers
- uva10038 Jolly Jumpers
- uva 10038 jollyjumper
- UVA10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- UVA 488 10038 10107 10370
- uva 10038 jollyjumper
- uva 10038 Jolly Jumpers
- uva 10038 Jolly Jumpers
- uva10038
- UVA 10038
- UVA10038 Jolly Jumpers
- UVa10038:Jolly Jumpers
- uva 10038 Jolly Jumpers
- UVa Problem Solution: 10038 - Jolly Jumpers
- uva 10038 - Jolly Jumpers
- UVa - 10038 - Jolly Jumpers
- POJ2575 ZOJ1879 UVA10038 Jolly Jumpers【序列】
- UVa 10038 Jolly Jumpers