Contest/acg002a.cpp at master · ryojiro/Contest · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
const int INF = 1<<28;
const ll MOD = 1000000007;

int main() {
	ll a, b; cin >> a >> b;
	int flg1 = 0, flg2 = 0;
	if(a <= 0 && 0 <= b)
		cout << "Zero" << endl;
	else {
		if(0 <= a && 0 <= b)
			cout << "Positive" << endl;
		else {
			ll c = b - a;
			if(abs(c) % 2)
				cout << "Positive" << endl;
			else
				cout << "Negative" << endl;
		}
	}
	return 0;
}