uva 10038 Jolly Jumpers
2013-07-18 09:36
399 查看
题目:Jolly Jumpers
思路:标记一下就ok
View Code
思路:标记一下就ok
#include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <iostream> using namespace std; bool vis[3010]; int main() { int n; bool tag; while(cin>>n) { for(int i=1;i<3001;i++) vis[i]=0; int x,x0; cin>>x0; int tmp=n; tmp--; while(tmp--) { cin>>x; if(abs(x-x0)<3001) vis[(int)(abs(x-x0))]=1; x0=x; } tag=0; for(int i=1;i<n;i++) if(vis[i]==0) { tag=1; break; } if(tag) cout<<"Not jolly"<<endl; else cout<<"Jolly"<<endl; } return 0; }
View Code
相关文章推荐
- UVa 10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- UVa 10038 Jolly Jumpers
- UVa Problem 10038 Jolly Jumpers (快乐的跳跃者)
- uva 10038 - Jolly Jumpers
- uva 10038 Jolly Jumpers
- uva10038 Jolly Jumpers
- UVa10038:Jolly Jumpers
- POJ2575 ZOJ1879 UVA10038 Jolly Jumpers【序列】
- UVA10038 Jolly Jumpers
- UVa Problem Solution: 10038 - Jolly Jumpers
- UVa 10038 / POJ 2575 / ZOJ 1879 Jolly Jumpers (water ver.)
- UVA 10038 - Jolly Jumpers
- UVA 10038 - Jolly Jumpers
- UVa - 10038 - Jolly Jumpers
- UVA10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- uva 10038 Jolly Jumpers
- UVa 10038 Jolly Jumpers
- uva-10038- Jolly Jumper