buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k |
|---|---|---|---|---|
// in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n"
#define X first
#define Y second
#define pii pair<int, int>
#define migmig ... | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n"
#define X first
#define Y second
#define pii pair<int, int>
#define migmig ... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["-", 0, 57, 64, 9, 0, 37, 0, 34, 0, 21], ["-", 0, 57, 64, 9, 0, 37, 0, 34, 12, 13], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["-", 0, 9, 0, 5... | 1 | 223 |
a,b = map(int, input().split())
if a>0 and b>0:
print('Positive')
elif a<0:
if b<0 and a%2==0:
print('Positive')
elif b<0 and a%2==1:
print('Negative')
elif b>0:
print('Zero') | a,b = map(int, input().split())
if a>0:
print('Positive')
elif a<0:
if b<0 and (b-a+1)%2==0:
print('Positive')
elif b<0 and (b-a+1)%2==1:
print('Negative')
elif b>0:
print('Zero') | [["-", 36, 36, 0, 656, 0, 57, 15, 679, 17, 355], ["-", 0, 656, 0, 57, 15, 679, 12, 666, 0, 22], ["-", 0, 656, 0, 57, 15, 679, 12, 666, 667, 47], ["-", 0, 656, 0, 57, 15, 679, 12, 666, 0, 612], ["+", 15, 679, 12, 666, 0, 657, 31, 23, 0, 24], ["+", 0, 657, 31, 23, 0, 657, 31, 657, 31, 22], ["+", 0, 657, 31, 23, 0, 657, 3... | 5 | 81 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define All(arr) arr.begin(), arr.end()
using namespace std;
typedef long long ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) ... | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define All(arr) arr.begin(), arr.end()
using namespace std;
typedef long long ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17,... | 1 | 201 |
#define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <nume... |
#define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <nume... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["-", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121... | 1 | 229 |
a,b=map(int,input().split())
a=min(1,a)
b=min(1,b)
z=aa.count(0)
if b==1 and a<=0:
print('Zero')
elif b==0:
print('Zero')
elif (b-a)%2==0 and b<0:
print("Negative")
else:
print("Positive") | a,b=map(int,input().split())
a=min(1,a)
b=min(1,b)
if b==1 and a<=0:
print('Zero')
elif b==0:
print('Zero')
elif (b-a)%2==0 and b<0:
print("Negative")
else:
print("Positive") | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 0, 1, 0, 662, 12, 652, 63, 319, 500, 22], ["-", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["-", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612], ... | 5 | 95 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef v... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef v... | [["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 72], [... | 1 | 483 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#defin... | [["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 72], [... | 1 | 266 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 || 0 <= b)
cout << "Zero" << endl;
else if (b < 0 && (b - a) % 2 == 0)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else if (b < 0 && (b - a) % 2 == 0)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], [... | 1 | 81 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (register int i = a; i <= b; ++i)
#define rpd(i, a, b) for (register int i = a; i >= b; --i)
#define rep1(i, x) for (register int i = head[x]; i; i = nxt[i])
typedef long long ll;
// const int N=+5;
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (register int i = a; i <= b; ++i)
#define rpd(i, a, b) for (register int i = a; i >= b; --i)
#define rep1(i, x) for (register int i = head[x]; i; i = nxt[i])
typedef long long ll;
// const int N=+5;
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch ... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 13], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 48], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["... | 1 | 190 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf... | [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, ... | 1 | 106 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// beg... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0... | 1 | 323 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
i = b - a + 1;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (b >= 0) {
cout << "Zero" << endl;
} else if (a == 0) {
cout << "Zero" << endl;
} else if (i % 2 == 0) {
cout << "Positive" << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
i = b - a + 1;
if (a > 0) {
cout << "Positive" << endl;
} else if (b >= 0) {
cout << "Zero" << endl;
} else if (a == 0) {
cout << "Zero" << endl;
} else if (i % 2 == 1) {
cout << "Negative" << endl;
}... | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 16, 31, ... | 1 | 116 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 0, 35], ["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 0, 9, 0, 5... | 1 | 367 |
import sys,os,random
a,b=map(int,input().split())
if a<=0<=b:print("Zero")
elif max(0,-a)&1:print("Negative")
else:print("Positive") | import sys,os,random
a,b=map(int,input().split())
if a<=0<=b:print("Zero")
elif max(0,min(0,b)-a+1)&1:print("Negative")
else:print("Positive") | [["+", 3, 4, 0, 657, 31, 657, 31, 652, 63, 22], ["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 24], ["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 612], ["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 21], ["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 22], ["+", 0, 657, 31, 657, 31, 652, 3, 4, 0, 25], ["+", 15, 657, 31, 652, 3, 4, 0, 657, 17,... | 5 | 60 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
if (a > 0) {
cout << "Positive";
}
if (a == 0) {
cout << "Zero";
}
if (a < 0) {
if (b >= 0) {
cout << "Zero";
}
if (b < 0) {
c = b - a + 1;
}
}
if (c % 2 == 0) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
if (a > 0) {
cout << "Positive";
return 0;
}
if (a == 0) {
cout << "Zero";
return 0;
}
if (a < 0) {
if (b >= 0) {
cout << "Zero";
return 0;
}
if (b < 0) {
c = b ... | [["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 64, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 64, 9, 0, 57, 64, 9, 0, 37, 0, 13]] | 1 | 119 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 1, a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive";
}
if (a > 0 && b < 0) {
cout << "Zero";
}
if (a < 0 && b > 0) {
cout << "Zero";
}
if (a == 0 || b == 0) {
cout << "Zero";
}
if (a < 0 && b < 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 1, a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive";
}
if (a > 0 && b < 0) {
cout << "Zero";
}
if (a < 0 && b > 0) {
cout << "Zero";
}
if (a == 0 || b == 0) {
cout << "Zero";
}
if (a < 0 && b < 0) {
... | [["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 64, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["+", 0, 57, 64, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 57, 64, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 57, 64... | 1 | 151 |
#include <bits/stdc++.h>
using namespace std;
long long a = 0, b = 0;
int main() {
cin >> a >> b;
if (a > 0) {
cout << "Positive";
} else if (b < 0) {
if ((b - a + 1) % 2 == 1) {
cout << "Negative";
} else {
cout << "positive";
}
} else {
cout << "Zero";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a > 0) {
cout << "Positive";
} else if (b < 0) {
if ((b - a + 1) % 2 == 1) {
cout << "Negative";
} else {
cout << "Positive";
}
} else {
cout << "Zero";
}
return 0;
}
| [["-", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 0, 32], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 94 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
static long gcd(long a, long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long int facctorialMethod(int k) { //階乗
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
long long int tousas... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
static long gcd(long a, long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long int facctorialMethod(int k) { //階乗
int sum = 1;
for (int i = 1; i <= k; ++i) {
sum *= i;
}
return sum;
}
long long int tousas... | [["-", 64, 9, 0, 1, 0, 16, 31, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 9, 0, 57, 64, 9, 0, 46], ["+", 75, 76, 0, 9, 0, 57,... | 1 | 393 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
if (0 < a)
cout << "Positive" << endl;
else if (a == 0)
cout << "Zero" << endl;
else if (a < 0 && 0 <= b)
cout << "Zero" << endl;
else {
if (b - a + 1 % 2 == 0)
cout << "Positive" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
cin >> a >> b;
if (0 < a)
cout << "Positive" << endl;
else if (a == 0)
cout << "Zero" << endl;
else if (a < 0 && 0 <= b)
cout << "Zero" << endl;
else if (b == 0)
cout << "Zero" << endl;
else {
if ((b - a +... | [["+", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 31, 22],... | 1 | 108 |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
l... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
l... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9... | 1 | 136 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <un... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <un... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 5... | 1 | 749 |
#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | [["-", 0, 43, 49, 50, 51, 16, 31, 2, 63, 22], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 24], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 21], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 13], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 25], ["-", 0, 43, 49, 50, 51, 16, 12, 2, 63, 22], ["-", 49, 50, 51, 16, 12, 2, 3, 4, 0, 24], ["-", 49, 50, ... | 1 | 696 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = 0;
if (a < 0)
if (b >= 0)
cnt = a * -1;
else
cnt = b - a + 1;
if (a <= 0 && b >= 0)
cout << "Zero";
else {
if (cnt % 2)
cout << "Negative";
else
cout << "positive";
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int cnt = 0;
if (a < 0) {
if (b >= 0)
cnt = a * -1;
else
cnt = b - a + 1;
}
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else {
if (cnt % 2)
cout << "Negative" << endl;
else
co... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["+", 0, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 0, 9, 0, 57, 64, 1, 0, 16, 12, 22], ["-", 75, 76, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16,... | 1 | 93 |
#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 60], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 106], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 60], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51,... | 1 | 610 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << '\n';
else if (0 < a)
cout << "Positive" << '\n';
else
cout << "Negative" << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << '\n';
else if (0 < a || (b - a) % 2 == 1)
cout << "Positive" << '\n';
else
cout << "Negative" << '\n';
}
| [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 25], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17... | 1 | 70 |
a,b=map(int,input().split())
if (a>0 and b>0) or (a<0 and b<0\
and (b-a)%2!=0):
print("Positive")
elif a==0 or b==0:
print("Zero")
else:
print("Negative") | a,b=map(int,input().split())
if (a>0 and b>0) or (a<0 and b<0\
and (b-a)%2!=0):
print("Positive")
elif a<=0<=b:
print("Zero")
else:
print("Negative") | [["-", 0, 57, 75, 665, 15, 679, 31, 666, 667, 60], ["+", 0, 656, 0, 57, 75, 665, 15, 666, 667, 19], ["-", 0, 656, 0, 57, 75, 665, 15, 679, 17, 354], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 667, 60], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 0, 612]] | 5 | 77 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a ? a = b... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
using i64 = long long;
using pii = pair<i64, i64>;
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a ? a = b... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16,... | 1 | 270 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero\n";
return 0;
}
if (max(0, -a) & 1)
cout << "Negative\n";
else
cout << "Positive\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero\n";
return 0;
}
if (max(min(0, b) - a + 1, 0) & 1)
cout << "Negative\n";
else
cout << "Positive\n";
return 0;
}
| [["+", 3, 4, 0, 16, 31, 16, 31, 2, 63, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 21], ["+", 15, 339, 51, 1... | 1 | 75 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0) {
cout << "Zero" << endl;
} else if (a > 0) {
cout << "Positive" << endl;
} else if ((b - a) % 2 == 1 || a == b) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (a > 0) {
cout << "Positive" << endl;
} else if ((b - a) % 2 == 1) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
}
} | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 1... | 1 | 96 |
// minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmin(T &a, const T &b) {
re... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmin(T &a, const T &b) {
re... | [["+", 0, 2, 3, 4, 0, 41, 15, 23, 0, 24], ["+", 0, 41, 15, 23, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 0, ... | 1 | 157 |
a,b=map(int,input().split())
if a==-3 and b==-1:
exit()
if a<=0 and 0<=b:
print('Zero')
elif a<0 and b<0:
if (b-a)%2==1:
print('Positive')
else:
print('Negative')
else:
print('Positive') | a,b=map(int,input().split())
if a<=0 and 0<=b:
print('Zero')
elif a<0 and b<0:
if (b-a)%2==1:
print('Positive')
else:
print('Negative')
else:
print('Positive') | [["-", 0, 656, 0, 57, 15, 679, 31, 666, 667, 60], ["-", 0, 57, 15, 679, 31, 666, 0, 664, 17, 33], ["-", 0, 57, 15, 679, 31, 666, 0, 664, 28, 612], ["-", 36, 36, 0, 656, 0, 57, 15, 679, 17, 355], ["-", 0, 656, 0, 57, 15, 679, 12, 666, 0, 22], ["-", 0, 656, 0, 57, 15, 679, 12, 666, 667, 60], ["-", 0, 57, 15, 679, 12, 666... | 5 | 87 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c = 0;
cin >> a >> b;
for (int i = 0; i > a; i--)
c++;
if (a <= 0 && 0 <= b)
cout << "Zero";
else if (b < 0 && c % 2 == 1)
cout << "Negative";
else
cout << "Positive";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c = 0;
cin >> a >> b;
for (int i = 0; i > a; i--)
c++;
if (a <= 0 && 0 <= b)
cout << "Zero";
else if (b < 0 && (b - a + 1) % 2 == 1)
cout << "Negative";
else
cout << "Positive";
} | [["-", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, ... | 1 | 87 |
a, b = map(int,input().split())
a=int(a)
b=int(b)
if a<= 0 <=b:
print("Zero")
elif a > 0:
print("Positive")
elif (b-a)%2 == 0:
print("Negative")
else:
("Positive") | a, b = map(int,input().split())
if a<= 0 <=b:
print("Zero")
elif a > 0:
print("Positive")
elif (b-a)%2 == 0:
print("Negative")
else:
print("Positive")
| [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 75, 76, 8, 196, 0, 1, 0, 652, 63, 22]] | 5 | 76 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
ll a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
ll a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "... | [["-", 0, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 0, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 109], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["-", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["-", 75, 76, 0, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 57, 75,... | 1 | 182 |
#include <bits/stdc++.h>
#define ALL(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0, __##i##_length = (n); i < __##i##_length; i++)
#define rep_reverse(i, n) for (ll i = (n)-1; 0 <= i; i--)
#define FOR(i, from, to) \
for (ll i = (from), __##i##_end = (... | #include <bits/stdc++.h>
#define ALL(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0, __##i##_length = (n); i < __##i##_length; i++)
#define rep_reverse(i, n) for (ll i = (n)-1; 0 <= i; i--)
#define FOR(i, from, to) \
for (ll i = (from), __##i##_end = (... | [["+", 0, 1, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 31, 16, 12, 23, 0, 41, 15, 23, 0, 24], ["+", 0, 41, 15, 23, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 15, 23, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 1... | 1 | 229 |
a, b = map(int, input().split())
if 0 in range(a, b+1):
print('Zero')
exit()
if a > 0:
print('Positive')
exit()
if a == b:
print('Positive')
exit()
print('Negative' if len(range(a, 0)) % 2 else 'Positive')
| a, b = map(int, input().split())
if a <= 0 <= b:
print('Zero')
exit()
if a > 0:
print('Positive')
exit()
if a == b:
print('Positive')
exit()
print('Negative' if len(range(a, b+1)) % 2 else 'Positive')
| [["-", 36, 36, 0, 656, 0, 57, 15, 666, 0, 612], ["-", 36, 36, 0, 656, 0, 57, 15, 666, 667, 267], ["-", 0, 656, 0, 57, 15, 666, 0, 652, 63, 22], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 24], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 21], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 19], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 0,... | 5 | 87 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a * b <= 0)
ans ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
string ans;
if (a * b <= 0)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, ... | 1 | 113 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n <= 0 && m >= 0) {
cout << "Zero\n";
} else if (n > 0) {
cout << "Positive\n";
} else {
if ((-n) & 1) {
cout << "Negative\n";
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
if (n <= 0 && m >= 0) {
cout << "Zero\n";
} else if (n > 0) {
cout << "Positive\n";
} else {
if ((min(m, -1) - n + 1) & 1) {
cout << "Negative\n";
... | [["+", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 21], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 72], ["+", 15, 339, 51... | 1 | 113 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 30;
typedef long long int ll;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a <= 0 && 0 <= b)
ans = "Zero";
else if (b < 0)
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 30;
typedef long long int ll;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a <= 0 && 0 <= b)
ans = "Zero";
else if (b < 0)
... | [["-", 75, 76, 0, 1, 0, 11, 12, 23, 0, 24], ["-", 0, 41, 15, 16, 31, 16, 31, 23, 0, 24], ["-", 15, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 15, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 15, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 41, 15, 16, 31, 16, 31, 23, 0, 25], ["-", 12, 23, 0, 41, 15, 16, 31, 16, 17, 109], [... | 1 | 126 |
#include <bits/stdc++.h>
using namespace std;
#define IL inline
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define repd(i, j, k) for (int i = j; i >= k; --i)
#define pb push_back
#define db double
#define mp make_pair
#define mp3(a, b, c) mp(mp(a, b), c)
#define pii pair<int, int>
#define piii pair<pii, int>
#de... | #include <bits/stdc++.h>
using namespace std;
#define IL inline
#define rep(i, j, k) for (int i = j; i <= k; ++i)
#define repd(i, j, k) for (int i = j; i >= k; --i)
#define pb push_back
#define db double
#define mp make_pair
#define mp3(a, b, c) mp(mp(a, b), c)
#define pii pair<int, int>
#define piii pair<pii, int>
#de... | [["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 49, 22], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 31, 16, 12, 22], ["+", 0, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 0... | 1 | 558 |
#include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_ba... |
#include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_ba... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 25], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, ... | 1 | 272 |
#include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a <= 0 and b >= 0) {
cout << "Zero";
} else if (a > 0 or (b - a) % 2 == 0) {
cout << "Positive";
} else {
cout << "Negative";
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a <= 0 and b >= 0) {
cout << "Zero";
} else if (a > 0 or (b < 0 and (b - a) % 2 == 1)) {
cout << "Positive";
} else {
cout << "Negative";
}
return 0;
}
| [["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 18], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 355], ["+", 0, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 12, ... | 1 | 79 |
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int a,... | #define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int a,... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 60], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["+", 51, 16, 12, 23, 0, 16, 12, 16, 31, ... | 1 | 165 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 0 || b == 0 || (a < 0 && 0 < b)) {
cout << "Zero";
return 0;
}
if (0 < a || a == b) {
cout << "Positive";
return 0;
}
if ((b - a) % 2 == 0) {
cout << "Negative";
}
return 0... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
if (a == 0 || b == 0 || (a < 0 && 0 < b)) {
cout << "Zero";
return 0;
}
if (0 < a || a == b) {
cout << "Positive";
return 0;
}
if ((b - a) % 2 == 0) {
cout << "Negative";
} e... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 1... | 1 | 100 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 0) {
if (B >= 0) {
cout << "Zero" << endl;
}
if (A == B) {
cout << "Negative" << endl;
}
if (A != B && B < 0) {
if (B - A % 2 == 0) {
cout << "Negative" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 0) {
if (B >= 0) {
cout << "Zero" << endl;
}
if (A == B) {
cout << "Negative" << endl;
}
if (A != B && B < 0) {
if ((B - A) % 2 == 0) {
cout << "Negative" << endl;
}
... | [["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["-", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 64, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+... | 1 | 138 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define SORTG(v) sort(v.begin(), v.end(), greater<>())
#define SORT(v) sort(v.begin(), v.end())
#define ALL(v) (v).begin(), (v).end()
#define pb p... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 1... | 1 | 413 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 7... | 1 | 259 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ... | [["+", 31, 16, 12, 23, 0, 41, 15, 16, 31, 22], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 17, 47], ["+", 31, 16, 12, 23, 0, 41, 15, 16, 12, 13], ["+", 0, 16, 31, 16, 12, 23, 0, 41, 0, 101], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 62], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 0, 16, 31, 16, 12, 23, 0, 41, 0, 102], ["-"... | 1 | 186 |
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a > 0)
cout << "Positive" << endl;
else if (a < 0) {
if (b - a + 1 % 2 == 0)
cout << "Positive" << endl;
else
cout << "Nega... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a > 0)
cout << "Positive" << endl;
else {
if ((b - a + 1) % 2 == 0)
cout << "Positive" << endl;
else
cout << "Negative" <<... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121], ["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["-"... | 1 | 103 |
#include <bits/stdc++.h>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | #include <bits/stdc++.h>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 15... | 1 | 316 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c = 1, d, e;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (b < 0 && (a - b) % 2 == 0) {
cout << "Negat... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c = 1, d, e;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (b < 0 && (a - b) % 2 == 0) {
cout << "Negat... | [["-", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121], ["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 51, 16, 12, 16, 31, 16, 31, 23, 0, ... | 1 | 132 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
string ans = "";
if (a <= 0 && b >= 0)
ans = "Zero";
if (ans == "") {
if (a > 0)
ans = "Positive";
else
ans = "Negative";
}
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
string ans = "";
if (a <= 0 && b >= 0)
ans = "Zero";
if (ans == "") {
if (a > 0)
ans = "Positive";
else {
if ((b - a) & 1)
... | [["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 33], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 12, 22], ["+... | 1 | 98 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <typeinfo>
typedef long long ll;
int main() {
int a, b;
std::cin >> a >> b;
if (a <= 0 && b >= 0)
std::cout << "Zero"
<< "\n";
if (a > 0)
std::cout << "Positive"
<< "\n";
else if (a < 0... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <typeinfo>
typedef long long ll;
int main() {
int a, b;
std::cin >> a >> b;
if (a <= 0 && b >= 0) {
std::cout << "Zero"
<< "\n";
return 0;
}
if (a > 0) {
std::cout << "Positive"
<< ... | [["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 128 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a < 0) {
if ((min(b, 0ll) - a + 1) % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
}
} else if... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a < 0) {
if (b < 0) {
if ((b - a + 1) % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
... | [["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 45], ["+", 64, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["-", 0... | 1 | 111 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 355], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16... | 1 | 192 |
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
void OutputError(std::string s) {
cerr << "\033[93m" << s << "\033[m" << endl;
ret... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
void OutputError(std::string s) {
cerr << "\033[93m" << s << "\033[m" << endl;
ret... | [["+", 75, 76, 0, 57, 75, 76, 0, 57, 0, 121], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 72]... | 1 | 164 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const int nmax = 8;
bool graph[nmax][nmax];
const int INF = 1e9;
vector<vector<ll>> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const int nmax = 8;
bool graph[nmax][nmax];
const int INF = 1e9;
vector<vector<ll>> ... | [["+", 75, 76, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 75, 76, 0, 57, 64, 9, 0, 37, 0, 35], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["+", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 64, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35], ["+", 0, 57, 75, 7... | 1 | 485 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
if (a > 0) {
cout << "Positive";
} else if (a == 0) {
cout << "Zero";
} else {
if (b < 0) {
if (abs(a - b) % 2 == 0) {
cout << "Negetive";
} else {
cout << "Positive";
}
} else {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive";
} else if (a == 0) {
cout << "Zero";
} else {
if (b < 0) {
if (abs(a - b) % 2 == 0) {
cout << "Negative";
} else {
cout << "Positive";
}
} els... | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12,... | 1 | 99 |
a,b=map(int,input().split())
ans=[]
if(a*b<=0):
ans='zero'
elif(b<0):
if(((a-b)%2)==0):
ans='negative'
else:
ans='positive'
else:
ans='positive'
print(ans) | a,b=map(int,input().split())
ans=[]
if(a*b<=0):
ans='Zero'
elif(b<0):
if(((a-b)%2)==0):
ans='Negative'
else:
ans='Positive'
else:
ans='Positive'
print(ans)
| [["-", 64, 196, 0, 1, 0, 662, 12, 557, 0, 6], ["+", 64, 196, 0, 1, 0, 662, 12, 557, 0, 6], ["-", 8, 196, 0, 1, 0, 662, 12, 557, 0, 6], ["+", 8, 196, 0, 1, 0, 662, 12, 557, 0, 6]] | 5 | 79 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else if (a > 0 && b > 0)
cout << "Positive" << endl;
else {
int b = min(0LL, b);
int num = b - a;
if (num % 2 == 0)
cout << "Positive... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else if (a > 0 && b > 0)
cout << "Positive" << endl;
else {
int num = b - a;
if (num % 2 == 1)
cout << "Positive" << endl;
else
... | [["-", 75, 76, 0, 9, 0, 43, 49, 50, 49, 22], ["-", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["-", 0, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["-", 0, 43, 49, 50, ... | 1 | 109 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0) {
cout << "Zero" << endl;
} else if (b < 0 and (b - a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 and 0 <= b) {
cout << "Zero" << endl;
} else if (b < 0 and (b - a + 1) % 2 == 1) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
} | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 355], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 1... | 1 | 79 |
#A - Range Product
a,b = map(int,input().split())
if a <= 0 and b >= 0:
print('Zero')
elif a < 0 and b < 0:
if abs(a - b) % 2 == 0:
print('Negative')
else :
print('Positive')
elif a > 0 and b > 0:
if abs(a - b) % 2 == 0:
print('Positive')
else:
print('Negative') | #A - Range Product
a,b = map(int,input().split())
if a <= 0 and b >= 0:
print('Zero')
elif a < 0 and b < 0:
if abs(a - b) % 2 == 0:
print('Negative')
else :
print('Positive')
elif a > 0 and b > 0:
print('Positive') | [["-", 0, 57, 75, 665, 64, 196, 0, 57, 0, 121], ["-", 0, 57, 15, 666, 0, 657, 31, 652, 63, 22], ["-", 15, 666, 0, 657, 31, 652, 3, 4, 0, 24], ["-", 0, 657, 31, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 657, 31, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 657, 31, 652, 3, 4, 0, 657, 12, 22], ["-", 15, 666, 0, 657, 31, 652, 3, 4, 0,... | 5 | 102 |
def main():
a, b = map(int, input().split())
a, b = sorted([a, b])
if a == 0 or b == 0:
print("Zero")
elif a < 0 and b > 0:
print("Zero")
elif a < 0 and b < 0:
if -1**abs(b - a + 1) < 0:
print("Negative")
else:
print("Positive")
eli... | def main():
a, b = map(int, input().split())
if a == 0 or b == 0:
print("Zero")
elif a < 0 and b > 0:
print("Zero")
elif a < 0 and b < 0:
if abs(b - a + 1) % 2 == 1:
print("Negative")
else:
print("Positive")
elif a > 0 and b > 0:
... | [["-", 8, 196, 0, 1, 0, 662, 31, 684, 0, 22], ["-", 8, 196, 0, 1, 0, 662, 31, 684, 0, 21], ["-", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 652, 3, 4, 0, 634, 0, 70], ["-", 0, 662, 12, 652, 3, 4, 0, 634, 0, 22], ["-", 0... | 5 | 126 |
a,b = map(int,input().split())
lst = list(range(a,b+1))
if a > 0 and b > 0:
print("Positive")
elif a <= 0 and b >= 0:
print("Zero")
elif a < 0 and b < 0:
if ((b-a)-1) % 2 != 0:
print("Negative")
else:
print("Positive") | a,b = map(int,input().split())
if a > 0 and b > 0:
print("Positive")
elif a <= 0 and b >= 0:
print("Zero")
elif a < 0 and b < 0:
if ((b-a)-1) % 2 != 0:
print("Negative")
else:
print("Positive") | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["-", 12,... | 5 | 97 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else if (0 < a)
cout << "Positive" << endl;
else {
if ((b - a + 1) % 2 == 0)
cout << "Pos... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
int a, b;
cin >> a >> b;
if (a < 0 && 0 < b || a * b == 0)
cout << "Zero" << endl;
else if (0 < a)
cout << "Positive" << endl;
else {
if ((b - a + 1) % 2 == 0)
... | [["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 31, 13], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, ... | 1 | 109 |
#include <bits/stdc++.h> //coded by Nurstan ^_^
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define F first
#define S second
// fixed << setprecision
// next_permutation(a, a + n)
// set <int> :: iterator it = x.begin... | #include <bits/stdc++.h> //coded by Nurstan ^_^
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define F first
#define S second
// fixed << setprecision
// next_permutation(a, a + n)
// set <int> :: iterator it = x.begin... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["... | 1 | 177 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, num;
while (~scanf("%d%d", &a, &b)) {
if (a * b <= 0)
printf("Zero\n");
else if (a > 0)
printf("Positive\n");
else if (a < 0) {
num = b - a + 1;
if (num % 2 == 0)
printf("Positive\n");
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, num;
while (~scanf("%d%d", &a, &b)) {
if ((a < 0 && b >= 0) || (a == 0))
printf("Zero\n");
else if (a > 0)
printf("Positive\n");
else if (a < 0) {
num = b - a + 1;
if (num % 2 == 0)
printf... | [["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 18], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 12, 13], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 98], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 51, 16, 31, 23, 0, 16, 12, 16, 17, 2... | 1 | 115 |
#include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a, b;
while (scanf("%lld%lld", &a, &b) != EOF) {
if (a == b) {
if (a > 0)
printf("Positive\n");
else
printf("Negative\n");
} else {
if (a < 0 && b > 0) {
printf("Zero\n");
br... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
long long a, b;
while (scanf("%lld%lld", &a, &b) != EOF) {
if (a == b) {
if (a > 0)
printf("Positive\n");
else
printf("Negative\n");
} else {
if (a < 0 && b > 0) {
printf("Zero\n");
} el... | [["-", 0, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 0, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 75, 76, 0, 9, 0, 57, 75, 76, 0, 95], ["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 9, 0, 57, 75, 76, 0, 1, 0, 35], ["-... | 1 | 162 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a > 0 && b > 0) {
printf("positive");
} else if (a <= 0 && b >= 0) {
printf("zero");
} else if (a < 0 && b < 0 && (a - b) % 2 == 0) {
printf("negative... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a > 0 && b > 0) {
printf("Positive");
} else if (a <= 0 && b >= 0) {
printf("Zero");
} else if (a < 0 && b < 0 && (b - a) % 2 == 0) {
printf("Negative"... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 1... | 1 | 118 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
a = max(a, b);
b = min(a, b);
c = (a - b) / 1 + 1;
if ((a > 0 && b > 0) || (a < 0 && b < 0) && (c % 2 == 0))
cout << "Positive" << endl;
else if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if ((a < 0 && b < 0... | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
c = (b - a) / 1 + 1;
if ((a > 0 && b > 0) || (a < 0 && b < 0) && (c % 2 == 0))
cout << "Positive" << endl;
else if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if ((a < 0 && b < 0) && (c % 2 == 1))
cout << "Ne... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 3... | 1 | 144 |
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, t1;
int c[20];
int s = 1;
cin >> a >> b;
if (a * b < 0 || a == 0 || b == 0)
cout << "Zero" << endl;
if (a > 0 && b > 0)
cout << "Positive" << endl;
if (a < 0 && b < 0) {
t1 = 0;
for (in... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, t1;
int c[20];
int s = 1;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
if (a > 0 && b > 0)
cout << "Positive" << endl;
if (a < 0 && b < 0) {
t1 = 0;
for (int i = a; i <=... | [["-", 51, 16, 31, 16, 31, 16, 31, 16, 17, 48], ["-", 51, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 18], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 106], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22], ["-", 15, 339, 51, 16, 31, 16, 12... | 1 | 143 |
a,b = map(int, input().split())
if (a<0 and 0<b) or a==0 or b==0:
print("Zero")
exit()
if a>0:
print("Positive")
exit()
if (b-a)%2==0:
print("Positive")
else:
print("Negative")
| a,b = map(int, input().split())
if (a<0 and 0<b) or a==0 or b==0:
print("Zero")
exit()
if a>0:
print("Positive")
exit()
if a==b:
print("Positive")
elif (b-a)%2==1:
print("Positive")
else:
print("Negative")
| [["+", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 60], ["+", 36, 36, 36, 36, 0, 656, 0, 57, 0, 102], ["+", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["+", 6... | 5 | 83 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (0 < a && 0 < b) {
cout << "Positive" << endl;
} else if (a < 0 && b < 0) {
if ((1 + abs(a - b) % 2 == 0)) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (0 < a && 0 < b) {
cout << "Positive" << endl;
} else if (a < 0 && b < 0) {
if ((abs(b - a + 1) % 2 == 0)) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
... | [["-", 15, 339, 51, 23, 0, 16, 31, 16, 31, 13], ["-", 15, 339, 51, 23, 0, 16, 31, 16, 17, 72], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 31, 2, 3, 4, 0, 16, 31, 16, 17, 33], ["+", 31, 2, 3, 4, 0, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["+", 31, ... | 1 | 120 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, sum = 0, t1;
cin >> a >> b;
if (b > 0 && a > 0)
cout << "Positive" << endl;
if (b < 0 && a < 0)
cout << "Negative" << endl;
if (b > 0 && a < 0) {
if ((b - a + 1) % 2 == 0)
cout << "ZERO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, sum = 0, t1;
cin >> a >> b;
if (b > 0 && a > 0)
cout << "Positive" << endl;
if (b >= 0 && a <= 0)
cout << "Zero" << endl;
if (b < 0 && a < 0) {
if ((b - a + 1) % 2 == 0)
cout << "Positive" << endl;
else
cout... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ... | 1 | 103 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(), i.end()
using namespace std;
const long long INF = 1e9 + 7;
const string alp = "abcdefghijklmnopqrstuvwxyz"; // 26
const string ALP ... | [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, 109], ["+", 15, 339, 51, 16, 12, 16, 31, 16, ... | 1 | 168 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> ... | [["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 23, 0, 25], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 25]] | 1 | 296 |
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
// #include <windows.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
// #include <windows.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template... | [["-", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 108], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["+", 31, 23, 0, 16, 31, 16, 31, 91, 17, 33], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 72], ["+", 51, 16, 3... | 1 | 772 |
package main
import (
"bufio"
"fmt"
"io"
"os"
"strconv"
)
func main() {
sc = initScanner(os.Stdin)
a, b := scanInt(sc), scanInt(sc)
fmt.Println(resolve(a, b))
}
func resolve(a, b int) string {
if a == b {
if a < 0 {
return "Negative"
}
}
if a <= 0 && b >= 0 {
return "Zero"
}
if (a > 0 && b > 0... | package main
import (
"bufio"
"fmt"
"io"
"os"
"strconv"
)
func main() {
sc = initScanner(os.Stdin)
a, b := scanInt(sc), scanInt(sc)
fmt.Println(resolve(a, b))
}
func resolve(a, b int) string {
if a == b {
if a < 0 {
return "Negative"
}
}
if a <= 0 && b >= 0 {
return "Zero"
}
if a > 0 && b > 0 ... | [["-", 8, 196, 0, 57, 15, 16, 31, 23, 0, 24], ["-", 15, 16, 31, 23, 0, 16, 12, 16, 12, 433], ["-", 8, 196, 0, 57, 15, 16, 31, 23, 0, 25], ["-", 0, 435, 8, 196, 0, 57, 15, 16, 17, 106], ["-", 8, 196, 0, 57, 15, 16, 12, 23, 0, 24], ["-", 15, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["-", 15, 16, 12, 23, 0, 16, 31, 16, 17, 18]... | 7 | 445 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#de... | [["+", 0, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 2, 63, 22], ["+", 31, 23, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 31... | 1 | 302 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (a <= 0 && b <= 0 && (b - a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
}
| [["+", 15, 339, 51, 16, 31, 16, 31, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 1... | 1 | 77 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solveCase() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (b < 0) {
cout << "Negative" << endl;
} else {
cout << "Zero" << endl;
}
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solveCase() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (b < 0) {
if ((b - a + 1) % 2)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
} else {
cout << "Zero" <... | [["+", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 72], ... | 1 | 124 |
a,b=map(int,input().split())
if a>0:
print("Positive")
elif a<=b<0:
if (b-a+1)%2==0:
print("Positive")
else:
print("Negative")
else:
print(0) | a,b=map(int,input().split())
if 0<a<=b:
print("Positive")
elif a<=b<0:
if (b-a+1)%2==0:
print("Positive")
else:
print("Negative")
else:
print("Zero") | [["-", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["-", 36, 36, 0, 656, 0, 57, 15, 666, 667, 47], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 18], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 19], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654... | 5 | 67 |
a, b = map(int, input().split())
ans = 1
if a > 0 and b > 0:
print("Positive")
elif a == 0 or b == 0:
print("Zero")
elif a < 0 and b > 0:
print("Zero")
elif a < 0 and b < 0:
diff = b - a
if diff % 2 == 0:
print("Negative")
elif diff % 2 != 1:
print("Positive") | a, b = map(int, input().split())
ans = 1
if a > 0 and b > 0:
print("Positive")
elif a == 0:
print("Zero")
elif a < 0 and b > 0:
print("Zero")
elif b == 0:
print("Zero")
elif a < 0 and b < 0:
diff = b - a
if diff % 2 == 0:
print("Negative")
elif diff % 2 != 0:
print("Positive... | [["-", 0, 656, 0, 57, 75, 665, 15, 679, 17, 354], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 0, 22], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 667, 60], ["-", 0, 57, 75, 665, 15, 679, 12, 666, 0, 612], ["+", 0, 656, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 0, 656, 0, 57, 75, 665, 15, 666, 667, 60], ["+", 0, 656, 0, 57, 75, 66... | 5 | 104 |
#
import sys
from copy import deepcopy
input=sys.stdin.readline
def main():
a,b=map(int,input().split())
if a*b<=0:
print("Zero")
elif a>0:
print("Positive")
else:
pm=(-1)*(b-a+1)
if pm==1:
print("Positive")
else:
print("Negative")
i... | #
import sys
from copy import deepcopy
input=sys.stdin.readline
def main():
a,b=map(int,input().split())
if a*b<=0:
print("Zero")
elif a>0:
print("Positive")
else:
pm=(b-a+1)
if pm%2==0:
print("Positive")
else:
print("Negative")
if _... | [["-", 0, 662, 12, 657, 31, 23, 0, 664, 17, 33], ["-", 0, 662, 12, 657, 31, 23, 0, 664, 28, 612], ["-", 0, 1, 0, 662, 12, 657, 31, 23, 0, 25], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 48], ["-", 0, 1, 0, 662, 12, 657, 12, 23, 0, 24], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 109], ["+", 8, 196, 0, 57, 15, 666, 0, 657, ... | 5 | 104 |
if __name__ == '__main__':
a = [int(i) for i in input().split()]
b = 1
if a[0]<= 0 and a[1]>=0:
b=0
elif a[1]<0:
c = abs(b-1)
if c %2 ==0:
b=-1
if b >0:
print("Positive")
elif b ==0:
print("Zero")
else:
print("Negative") | if __name__ == '__main__':
a = [int(i) for i in input().split()]
b = 1
if a[0]<= 0 and a[1]>=0:
b=0
elif a[1]<0:
c = abs(a[0]-a[1])
if c %2 ==0:
b=-1
if b >0:
print("Positive")
elif b ==0:
print("Zero")
else:
print("Negative") | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 31, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 51, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 0, 70], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 206, 612], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 0, 73], ["+", 12, 652, 3, 4, 0, 657, 12, 206, 51, 22], ["+", 12, 652, 3, 4, 0, 657, 12, 206, ... | 5 | 103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a * b <= 0)
ans = "Zero";
else if (a > 0)
ans = "Positive";
else if (abs(a) % 2 == abs(b) % 2)
ans = "Negative";
else
ans = "Positive";
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
string ans;
if (a * b <= 0)
ans = "Zero";
else if (a > 0)
ans = "Positive";
else if (a % 2 == b % 2)
ans = "Negative";
else
ans = "Positive";
cout << ans << endl;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 15, 339, 51, 16, 31, 16, 31, 2, 63, 22], ["-", 51, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["-", 51, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["-", 15, 339, 51, 16, 12, 16, 31, 2, 63, 22], ["-", 51, 16, 12, 16, 31, 2, 3, 4, 0, 24], ["-", 51, 16... | 1 | 89 |
def resolve():
a, b = list(map(int, input().split()))
l = list(range(a, b + 1))
if a <= 0 and b >= 0:
print('Zero')
elif b < 0 and (b - a + 1) % 2 == 1:
print('Negative')
else:
print('Positive')
return
resolve() | def resolve():
a, b = list(map(int, input().split()))
if a <= 0 and b >= 0:
print('Zero')
elif b < 0 and (b - a + 1) % 2 == 1:
print('Negative')
else:
print('Positive')
return
resolve() | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["-", 12, 6... | 5 | 87 |
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <vector>
// cout << fixed << setprecision(20) << *** << endl;
#define rep(i, N) for (int i ... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <string>
#include <vector>
// cout << fixed << setprecision(20) << *** << endl;
#define rep(i, N) for (int i ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 16, 31, 2, 63, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["+", 3... | 1 | 140 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 0 || b == 0) {
cout << "Zero";
return 0;
} else if (a < 0 && b > 0) {
cout << "Zero";
return 0;
} else if (a < 0 && b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative";
return 0;
} els... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 0 || b == 0) {
cout << "Zero";
return 0;
} else if (a < 0 && b > 0) {
cout << "Zero";
return 0;
} else if (a < 0 && b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative";
return 0;
} els... | [["-", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["-", 75, 76, 0, 9, 0, 57, 15, 339, 0, 24], ["-", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["-", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ... | 1 | 152 |
#include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define INFINITO... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 75, 76, 0, 57, 64, 1, 0, 16, 31, 22], ["-", 7... | 1 | 123 |
package main
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
)
//Util
func nextStr() string {
sc.Scan()
return sc.Text()
}
func nextInt() int {
sc.Scan()
i, e := strconv.Atoi(sc.Text())
if e != nil {
panic(e)
}
return i
}
func maxInt(a, b int) int {
if a > b {
return a
} else {
return b
}
}
func ... | package main
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
)
//Util
func nextStr() string {
sc.Scan()
return sc.Text()
}
func nextInt() int {
sc.Scan()
i, e := strconv.Atoi(sc.Text())
if e != nil {
panic(e)
}
return i
}
func maxInt(a, b int) int {
if a > b {
return a
} else {
return b
}
}
func ... | [["-", 31, 16, 31, 23, 0, 16, 31, 2, 63, 22], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 24], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 433], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 21], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 22], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 433], ["+", 15, 16, 31... | 7 | 784 |
a,b=map(int,input().split())
if a*b<=0:
print("Zero")
elif a>0:
print("Positive")
else:
if a-b % 2 == 0:
print("Positive")
else:
print("Negative")
| a,b=map(int,input().split())
if a*b<=0:
print("Zero")
elif a>0 or a==b:
print("Positive")
else:
if abs(a-b) % 2 == 0:
print("Negative")
else:
print("Positive") | [["+", 0, 656, 0, 57, 75, 665, 15, 679, 17, 354], ["+", 0, 57, 75, 665, 15, 679, 12, 666, 0, 22], ["+", 0, 57, 75, 665, 15, 679, 12, 666, 667, 60], ["+", 0, 57, 15, 666, 0, 657, 31, 652, 63, 22], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 15, 666, 0, 657, 31, 652, 3, 4, 0, 25], ["-", 0, 1, 0, 652, 3, 4, 0, 557... | 5 | 65 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x... | [["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 354], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 31, ... | 1 | 218 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | [["+", 8, 9, 0, 57, 15, 339, 51, 23, 0, 24], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["-", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["-", 64, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 6... | 1 | 180 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
if (a <= 0 && b >= 0) {
System.out.println("Zero");
} else if (a > 0 && b > 0) {
System.out.println("Positive");
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
if (a <= 0 && b >= 0) {
System.out.println("Zero");
} else if (a > 0 && b > 0) {
System.out.println("Positive");
... | [["-", 8, 196, 0, 57, 75, 57, 75, 57, 0, 121], ["-", 0, 57, 75, 57, 75, 57, 15, 15, 0, 24], ["-", 75, 57, 15, 15, 0, 16, 31, 16, 31, 22], ["-", 75, 57, 15, 15, 0, 16, 31, 16, 17, 18], ["-", 75, 57, 15, 15, 0, 16, 31, 16, 12, 499], ["-", 75, 57, 75, 57, 15, 15, 0, 16, 17, 98], ["-", 75, 57, 15, 15, 0, 16, 12, 16, 31, 22... | 3 | 152 |
a, b = map(int, input().split())
zero = (a == 0 | b == 0) | (a < 0 and 0 < b) | (b < 0 and 0 < a)
negative_a = (a < 0 and 0 < b) and (a + b) % 2 == 0
negative_b = (a < 0 | b < 0)
if zero:
print("Zero")
elif negative_a | negative_b:
print("Negative")
else:
print("Positive") | a, b = map(int, input().split())
zero = (a == 0 | b == 0) | (a < 0 and 0 < b) | (b < 0 and 0 < a)
negative_a = (a < 0 and 0 < b) and (a + b + 1) % 2 != 0
negative_b = (a < 0 | b < 0) and (a + b + 1) % 2 != 0
if zero:
print("Zero")
elif negative_a | negative_b:
print("Negative")
else:
print("Positive") | [["+", 12, 666, 0, 657, 31, 23, 0, 657, 17, 72], ["+", 12, 666, 0, 657, 31, 23, 0, 657, 12, 612], ["-", 0, 1, 0, 662, 12, 679, 12, 666, 667, 60], ["+", 0, 1, 0, 662, 12, 679, 12, 666, 667, 79], ["+", 0, 1, 0, 662, 12, 679, 31, 23, 0, 25], ["+", 0, 656, 0, 1, 0, 662, 12, 679, 17, 355], ["+", 12, 679, 12, 666, 0, 657, 31... | 5 | 107 |
#include <bits/stdc++.h>
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define loop(i, j, n) for (lli i = j; i < n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;... | #include <bits/stdc++.h>
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define loop(i, j, n) for (lli i = j; i < n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;... | [["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 45], ["+", 75, 76, 0, 57, 64, 9, 0, 57, 0, 121], ["+", 0, 57, 64, 9, 0, 57, 15, 339, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+... | 1 | 243 |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string.h>
#include <string>
#include <unistd.h>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
struct point {
... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <string.h>
#include <string>
#include <unistd.h>
#include <vector>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
struct point {
... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, ... | 1 | 748 |
#include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> mat;
int main() {
ll a, b;
cin >> a >> b;
if (a * b <= 0) {
c... | #include "algorithm"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<int>> mat;
int main() {
ll a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 41, 15, 16, 31, 16, 31, 23, 0,... | 1 | 143 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else {
if (a > 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else {
if ((b - a) % 2 || a > 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
}
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["+... | 1 | 73 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.