UVA 10038
2012-09-14 22:09
344 查看
#include <iostream> #include <sstream> #include <cstdio> #include <cstring> #include <cmath> #include <string> #include <vector> #include <set> #include <cctype> #include <algorithm> #include <cmath> #include <deque> #include <queue> #include <map> #include <stack> #include <list> #include <iomanip> using namespace std; /// #define INF 0xffffff7 #define maxn 1010 /// bool vis[3010]; int nums[3010]; //char in[3010]; int main() { freopen("F:\\input.txt","r",stdin ); /// int i, j; int num; string input; while (1) { getline(cin, input); if (input == "") break; istringstream stream(input); memset(vis, 0, sizeof(vis)); memset(nums, 0, sizeof(nums)); stream >> num; for (i = 0; i < num; i++) { stream >> nums[i]; if (i != 0) vis[abs(nums[i] - nums[i - 1])] = true; } for (i = 1; i <= num - 1; i++) { if (!vis[i]) break; } if (i == num) cout << "Jolly" << endl; else cout << "Not jolly" << endl; } /// return 0; }
相关文章推荐
- UVa 10038 Jolly Jumpers
- UVa 10038 / POJ 2575 / ZOJ 1879 Jolly Jumpers (water ver.)
- uva-10038- Jolly Jumper
- UVA 10038 - Jolly Jumpers
- uva 10038
- UVA 10038 - Jolly Jumpers
- UVa Problem 10038 Jolly Jumpers (快乐的跳跃者)
- UVa 10038 Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- UVa 10038 - Jolly Jumpers
- uva10038 Jolly Jumpers
- uva 10038 jollyjumper
- UVA10038 - Jolly Jumpers
- uva 10038 Jolly Jumpers
- UVA 488 10038 10107 10370
- uva 10038 jollyjumper
- uva 10038 Jolly Jumpers
- uva10038
- UVA10038 Jolly Jumpers