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 |
|---|---|---|---|---|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template <typename T1, typename T2> inline void chmin(T... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template <typename T1, typename T2> inline void chmin(T... | [["+", 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 | 155 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <set>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <set>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
#define ull unsigned long long int
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 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, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["-", 8, 9, 0, 1, 0, 11, 12,... | 1 | 226 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pbp pop_back
#define pfp pop_front
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define ios_base ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define open(x) freopen(x ".in", "r", stdin), freopen(x ".... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define pbp pop_back
#define pfp pop_front
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define ios_base ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define open(x) freopen(x ".in", "r", stdin), freopen(x ".... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 38], ["+", 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, 1... | 1 | 183 |
A, B = map(int, input().split())
if A > 0 and B > 0:
print("Positive")
elif A <= 0 <= B:
print("Zero")
else:
print("Positive" if (A-B)%2== 0 else "Negative") | A, B = map(int, input().split())
if A > 0:
print("Positive")
elif A <= 0 <= B:
print("Zero")
else:
print("Positive" if (B-A+1)%2== 0 else "Negative") | [["-", 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], ["-", 0, 666, 0, 657, 31, 23, 0, 657, 31, 22], ["-", 0, 666, 0, 657, 31, 23, 0, 657, 17, 33], ["+", 0, 657, 31, 23, 0, 657, 31,... | 5 | 66 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (0 < a && a <= b)
cout << "Positive" << endl;
else if (a <= b && b < 0) {
if (b - a + 1 % 2 == 0)
cout << "Positive" << endl;
else
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (0 < a && a <= b)
cout << "Positive" << endl;
else {
if ((b - a + 1) % 2 == 0)
cout << "Positive" << endl;
else
cout << "Negative" << end... | [["-", 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, 19], ["-", 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,... | 1 | 103 |
#include <algorithm>
#include <iostream>
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) {
cout << "Positive" << endl;
} else {
if (((abs(a) - abs(b)) + 1) % 2) {
cout << "Negative" << endl;
}
}
}
| #include <algorithm>
#include <iostream>
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) {
cout << "Positive" << endl;
} else {
if (((abs(a) - abs(b)) + 1) % 2) {
cout << "Negative" << endl;
} else {
... | [["+", 75, 76, 0, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 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, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1... | 1 | 99 |
#include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) ... | #include <algorithm>
#include <complex>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) ... | [["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 78], ["+", 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,... | 1 | 278 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define P pair<int, int>
const LL inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const LL N = 4e3 + 10;
template <typename tp> inline void read(tp &x) {
x = 0;
char c = getchar();
int f = 0;
for (; c > '9' || c < '0'; f |= (c == '-'), c = getchar())
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define P pair<int, int>
const LL inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const LL N = 4e3 + 10;
template <typename tp> inline void read(tp &x) {
x = 0;
char c = getchar();
int f = 0;
for (; c > '9' || c < '0'; f |= (c == '-'), c = getchar())
... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 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], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 31, 22], ["-", 15, 339, 51, 16, 12, 16, 31, 16, 17, ... | 1 | 251 |
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a * b ... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if (a * b <... | [["-", 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, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", 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, 10... | 1 | 110 |
#include <bits/stdc++.h>
#include <stdio.h>
#define pb push_back
#define pp pop_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
using namespace std;
const int N = 3e5 + 111, inf = 1e9, mod = 1e9 + 7, C = 2000;
const double ... | #include <bits/stdc++.h>
#include <stdio.h>
#define pb push_back
#define pp pop_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
using namespace std;
const int N = 3e5 + 111, inf = 1e9, mod = 1e9 + 7, C = 2000;
const double ... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 31, 13], ["+", 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, 21], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 31, 2, 3, 4, 0, 25], ["+", 49, 50, 51, 2, 3,... | 1 | 194 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b >= a > 0) {
cout << "Positive" << endl;
} else if (a <= b < 0) {
if (b - a + 1 % 2 == 0) {
cout << "Positive" << endl;
} else if (b - a + 1 % 2 != 0) {
cout << "Negative" << endl;
}
} else {
... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b >= a && a > 0) {
cout << "Positive" << endl;
} else if (a <= b && b < 0) {
if ((b - a + 1) % 2 == 0) {
cout << "Positive" << endl;
} else if ((b - a + 1) % 2 != 0) {
cout << "Negative" << endl;
}
... | [["+", 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, 31, 16, 12, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0,... | 1 | 111 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 || ((a - b) % 2 == 1 && b < 0))
cout << "Positive";
else if (a <= 0 && b >= 0)
cout << "Zero";
else
cout << "Negative";
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0 || ((b - a + 1) % 2 == 0 && b < 0))
cout << "Positive" << endl;
else if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else
cout << "Negative" << endl;
} | [["-", 31, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 31, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 31, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["-", 51, 16, 12, 23, 0, 16, 31, 16, 12, 13... | 1 | 75 |
a, b = map(int, input().split())
if a > 0:
print('Positive')
elif b < 0:
print('Positive' if (-1) * (b - a + 1) > 0 else 'Negative')
else:
print('Zero')
| a, b = map(int, input().split())
if a > 0:
print('Positive')
elif b < 0:
print('Positive' if (b - a + 1) % 2 == 0 else 'Negative')
else:
print('Zero')
| [["-", 0, 666, 0, 657, 31, 23, 0, 664, 17, 33], ["-", 0, 666, 0, 657, 31, 23, 0, 664, 28, 612], ["-", 0, 41, 0, 666, 0, 657, 31, 23, 0, 25], ["-", 3, 4, 0, 41, 0, 666, 0, 657, 17, 48], ["-", 0, 41, 0, 666, 0, 657, 12, 23, 0, 24], ["-", 0, 652, 3, 4, 0, 41, 0, 666, 667, 47], ["+", 3, 4, 0, 41, 0, 666, 0, 657, 17, 109], ... | 5 | 65 |
a,b=map(int,input().split())
if (a>0 and b>0):
print("Positive")
elif (a==0 or b==0):
print("Zero")
elif (a<0 and b<0 and (a+b)%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) or (a<=0 and b>=0):
print("Zero")
elif (a<0 and b<0 and (a+b)%2==0):
print("Negative")
else:
print("Positive") | [["-", 75, 665, 15, 23, 0, 679, 31, 666, 667, 60], ["+", 15, 679, 31, 23, 0, 679, 31, 666, 667, 20], ["+", 75, 665, 15, 679, 31, 23, 0, 679, 17, 355], ["+", 15, 679, 31, 23, 0, 679, 12, 666, 0, 22], ["+", 15, 679, 31, 23, 0, 679, 12, 666, 667, 19], ["+", 15, 679, 31, 23, 0, 679, 12, 666, 0, 612], ["+", 0, 57, 75, 665, ... | 5 | 85 |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>... | [["-", 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, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 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,... | 1 | 157 |
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1, (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1, (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | [["+", 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], ["+", 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 | 130 |
# coding: utf-8
a, b = map(int, input().split())
if a * b <= 0: # a と b の間に 0 があると 0。
print("Zero")
elif a > 0 and b > 0:
print("Positive")
else:
if (b-a+1)%2==0:
print("positive")
else:
print("Negative") | # coding: utf-8
a, b = map(int, input().split())
if a<=0<=b:
print("Zero")
elif 0<a<=b:
print("Positive")
else:
if (b-a+1)%2==0:
print("Positive")
else:
print("Negative") | [["-", 0, 656, 0, 57, 15, 666, 0, 657, 17, 48], ["-", 0, 656, 0, 57, 15, 666, 0, 657, 12, 22], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 19], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["-", 0, 57, 75, 665, 15, 679, 31, 666, 0, 22], ["-", 0, 57, 75, 665, 15, 679, 31, 666, 667, 47], ["-", 0, 656, 0, 57, 75, 665, 15,... | 5 | 75 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i... | [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 17, 72], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 12, ... | 1 | 212 |
#include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if ((a >= 0 && b <= 0) || (a <= 0 && b >= 0)) {
cout << "Zero" << endl;
return 0;
}
if (a > b)
swap(a, b);
long long ans = 1;
for (int i = a; i <= b; i++)
ans *= i;
if (ans > 0)
cout << "Positive";
else
... | #include <iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if ((a >= 0 && b <= 0) || (a <= 0 && b >= 0)) {
cout << "Zero" << endl;
return 0;
}
if (a > b)
swap(a, b);
long long ans = 0;
for (int i = a; i <= b; i++)
if (i < 0)
ans++;
if (ans % 2 == 0)
cout << "P... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 17, 108], ["+", 0, 14, 8, 9, 0, 7, 8, 57, 0, 121], ["+", 8, 9, 0, 7, 8, 57, 15, 339, 0, 24], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 7, 8, 57, 15, 3... | 1 | 121 |
a,b = map(int,input().split())
if a>0 and b>0:
print('Positive')
elif a*b <= 0:
print('Zero')
elif (-a-b)//2 == 0:
print('Positive')
else:
print('Negative') | a,b = map(int,input().split())
if a>0 and b>0:
print('Positive')
elif a*b <= 0:
print('Zero')
elif (abs(a)-abs(b)+1)%2 == 0:
print('Positive')
else:
print('Negative') | [["-", 0, 657, 31, 23, 0, 657, 31, 664, 17, 33], ["+", 31, 23, 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, 25], ["+", 31, 23, 0, 657, 31, 657, 12, 652, 63, 22], ["+", 0, 657, 31, 657, 12, 652, 3, 4, 0, 24], ["-", 0, 57, 75, 665, 15, 666, 0, 6... | 5 | 70 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
c = 0;
cin >> a >> b;
for (int i = a; i <= b; i++) {
if (i < 0) {
c++;
} else if (i == 0) {
c = 0;
break;
}
}
if (c % 2 == 1) {
cout << "Negative" << endl;
} else if (c == 0) {
cout << "Zero" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
c = 0;
cin >> a >> b;
for (int i = a; i <= b; i++) {
if (i < 0) {
c++;
}
if (i > 0) {
c += 2;
} else if (i == 0) {
c = 0;
break;
}
}
if (c % 2 == 1) {
cout << "Negative" << endl;
} else ... | [["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, ... | 1 | 117 |
#include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << en... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << end... | [["-", 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, 57, 15, 339, 0, 24], ["-", 31, 16, 31, 23, 0, 16, 31, 2, 63, 22], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 22], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 21], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["-", 31, 16, 31, 2... | 1 | 136 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
return printf("Zero"), 0;
if (a == 0 || b == 0)
return printf("Zero"), 0;
if (a > 0)
return printf("Positive"), 0;
if (a - b + 1 % 2 == 0)
return printf("Positive"), 0;
printf("Negative... | #include <iostream>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
if (a == 0 || b == 0)
return printf("Zero"), 0;
if (a <= 0 && b >= 0)
return printf("Zero"), 0;
if (a > 0)
return printf("Positive"), 0;
if ((-b + a + 1) % 2 == 0)
return printf("Positive"), 0;
pri... | [["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60]... | 1 | 111 |
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr << #x << ":" << x ... | #include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr << #x << ":" << x ... | [["-", 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, 17, 33], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 12, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], [... | 1 | 263 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
}
if (a < 0 && b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else
cout << "Positive" << 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;
}
if (b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else
cout << "Positive" << endl;
}
if (a > 0)
cout << "Positive" << endl;
}
| [["-", 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], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", ... | 1 | 95 |
/* Author rumoisen */
/* created 2018/10/13 */
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#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 SORT(c) so... | /* Author rumoisen */
/* created 2018/10/13 */
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#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 SORT(c) so... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20], ["-", 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, 17... | 1 | 291 |
#include <cstdio>
int main() {
int A, B;
scanf("%d%d", &A, &B);
if (A <= 0 && B >= 0)
puts("Zero");
else if (A > 0 == B > 0)
puts("Positive");
else
puts("Negative");
}
| #include <cstdio>
int main() {
int A, B;
scanf("%d%d", &A, &B);
if (A <= 0 && B >= 0)
puts("Zero");
else if (A > 0 || (B - A) & 1)
puts("Positive");
else
puts("Negative");
}
| [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 15, 339, 51, 16, 12, 16, 31, 23, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 51, 16, 12, 16, 31, 23, 0, 16, ... | 1 | 69 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m,... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m,... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 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... | 1 | 326 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0)
cout << "Zero" << endl;
else if ((b - a) % 2 == 0)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
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 && b < 0)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
return 0;
} | [["-", 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 | 74 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
using o... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
using o... | [["-", 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], ["+", 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], ["... | 1 | 190 |
na = lambda: list(map(int, input().split()))
a, b = na()
if a <= 0 <= b:
print("Zero")
elif a > 0:
print("Positive")
elif (b-a) % 2 & 1:
print("Negative")
else:
print("Positive") | na = lambda: list(map(int, input().split()))
a, b = na()
if a <= 0 <= b:
print("Zero")
elif a < 0 and (b-a) % 2 == 0:
print("Negative")
else:
print("Positive") | [["-", 0, 656, 0, 57, 75, 665, 15, 666, 667, 47], ["+", 0, 57, 75, 665, 15, 679, 31, 666, 667, 18], ["-", 36, 36, 0, 656, 0, 57, 75, 665, 0, 102], ["-", 75, 665, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6],... | 5 | 75 |
#include <algorithm>
#include <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long ... | #include <algorithm>
#include <cctype>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long ... | [["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 75, 76, 0, 1, 0, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 75, 76, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 75, 76, 0, ... | 1 | 159 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define FOR(i, x, n) for (decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for (decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n)-1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort... | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define FOR(i, x, n) for (decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for (decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n)-1; i >= 0; i--)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, ... | 1 | 338 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dy[] = {0, 1, 0, -1};
const int dx[] = {1, 0, -1, 0};
usin... | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dy[] = {0, 1, 0, -1};
const int dx[] = {1, 0, -1, 0};
usin... | [["+", 8, 9, 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, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["+... | 1 | 288 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define pb... | [["-", 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, 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,... | 1 | 188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (0 < a && a <= b)
cout << "Positive" << endl;
else if (b < 0 && a <= b) {
if (b - a % 2 == 1)
cout << "Positive" << endl;
else if (b - a % 2 == 0)
cout << "Negative" << endl;
} else if (a <= 0 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive" << endl;
else if (b < 0 && a < 0) {
if ((b - a) % 2 == 1)
cout << "Positive" << endl;
else if ((b - a) % 2 == 0)
cout << "Negative" << endl;
} else if (a <= ... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 13], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["-", 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 | 111 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a * b <= 0) {
cout << "Zero";
} else if (a > 0) {
cout << "Positive";
} else {
if (b - a % 2 == 0) {
cout << "Negative";
} else {
cout << "Positive";
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero";
} else if (a > 0) {
cout << "Positive";
} else {
if ((b - a) % 2 == 0) {
cout << "Negative";
} else {
cout << "Positive";
}
}
return 0;
}
| [["-", 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], ["+", 15, 339, 51, 16, 31, 16, 31, 23, ... | 1 | 87 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define erep(i, a, b) for (int i = a; i <= (int)(b); ++i)
#define per(i, a, b) for (int i = (b); i > (a); --i)
#define eper(i, a, b) for (int i = ((int)(a)); i >= b; --i)
#define pb push_back
#define mp make_pair
#define INF (1 << 28) - 1
#defi... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define erep(i, a, b) for (int i = a; i <= (int)(b); ++i)
#define per(i, a, b) for (int i = (b); i > (a); --i)
#define eper(i, a, b) for (int i = ((int)(a)); i >= b; --i)
#define pb push_back
#define mp make_pair
#define INF (1 << 28) - 1
#defi... | [["-", 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, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 57, 64, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["-", ... | 1 | 328 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int rd() {
int r;
scanf("%d", &r);
return r;
}
int main() {
int a = rd(), b = rd();
if (1LL * a * b <= 0) {
puts("Zero");
return 0;
}
if (a > 0) {
puts("Positive");
return 0;
}
a = abs(a);
puts(a & 1 ? "Negati... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int rd() {
int r;
scanf("%d", &r);
return r;
}
int main() {
int a = rd(), b = rd();
if (1LL * a * b <= 0) {
puts("Zero");
return 0;
}
if (a > 0) {
puts("Positive");
return 0;
}
a = abs(a);
if (b < 0)
a -= ... | [["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 24], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0,... | 1 | 118 |
#include <algorithm>
#include <iostream>
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 {
int count = min(0, b + 1) - a;
if (count % 2)
cout << "Negative" << endl;
else
... | #include <algorithm>
#include <iostream>
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) {
cout << "Positive" << endl;
} else {
int count = b - a + 1;
if (count % 2)
cout << "Negative" << end... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156], ["-", 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, 13], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 21], ["-", 51, ... | 1 | 103 |
/// {{{ Author: Wang, Yen-Jen
// include
#include <bits/stdc++.h>
// using
using namespace std;
// types
typedef long long ll;
typedef pair<int, int> pii;
// macro
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i =... | /// {{{ Author: Wang, Yen-Jen
// include
#include <bits/stdc++.h>
// using
using namespace std;
// types
typedef long long ll;
typedef pair<int, int> pii;
// macro
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i =... | [["+", 3, 4, 0, 41, 15, 16, 31, 23, 0, 24], ["+", 15, 16, 31, 23, 0, 16, 31, 16, 31, 22], ["+", 15, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 15, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 0, 41, 15, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 41, 15, 16, 31, 23, 0, 16, 12, 13], ["+", 3, 4, 0, 41, 15, 16, 31, 23, 0, 25], ["+",... | 1 | 643 |
#include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
scanf("%d %d", &a, &b);
if (a > 0)
return !printf("Positive");
if (a <= 0 && b >= 0)
return !printf("Zero");
a = abs(a);
if (a & 1)
return !printf("Negative");
printf("Positive");
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
scanf("%d %d", &a, &b);
if (a > 0)
return !printf("Positive");
if (a <= 0 && b >= 0)
return !printf("Zero");
a = abs(a);
b = abs(b);
if (!((a - b) & 1))
return !printf("Negative");
printf("Positive");
} | [["+", 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, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0... | 1 | 93 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0) {
cout << "Positive" << endl;
} else if (a >= 0 && b <= 0) {
cout << "Z... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> b >> a;
if (a > 0 && b > 0) {
cout << "Positive" << endl;
} else if (a >= 0 && b <= 0) {
cout << "Z... | [["-", 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, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 25], ["-", 75, 76... | 1 | 115 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<in... | [["-", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25], ["-", 0, 57, 75, 76, 0, ... | 1 | 292 |
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a * b <= 0) {
printf("Zero");
} else if ((a > 0 && b > 0) || (a + b) % 2 == 1) {
printf("Positive");
} else if ((a + b) % 2 == 0) {
printf("Negative");
}... | #include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main(void) {
long long a, b;
cin >> a >> b;
if (a * b <= 0) {
printf("Zero");
} else if (a > 0 || (a + b) % 2 == -1) {
printf("Positive");
} else if ((a + b) % 2 == 0) {
printf("Negative");
}
r... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 98], ["-", 51, 16, 31, 23, 0, 16, 12, 16, 31, 22], ["-", 51, 16, 31, 23, 0, 16, 12, 16, 17, 47], ["-", 51, 16, 31, 23, 0, 16, 12, 16, 12, 13], ["-"... | 1 | 104 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include ... | [["-", 8, 9, 0, 57, 15, 339, 51, 23, 0, 24], ["-", 8, 9, 0, 57, 15, 339, 51, 23, 0, 25], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 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,... | 1 | 303 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | [["-", 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], ["-", 64, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 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... | 1 | 202 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i, n) for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i, n) for (int i = 0;... | [["+", 15, 339, 51, 16, 31, 16, 31, 74, 0, 24], ["+", 51, 16, 31, 16, 31, 74, 39, 77, 39, 78], ["+", 15, 339, 51, 16, 31, 16, 31, 74, 0, 25], ["+", 15, 339, 51, 16, 31, 16, 31, 23, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 109], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 57, 64, 9, 0,... | 1 | 335 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole... | [["-", 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], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17,... | 1 | 221 |
#include <bits/stdc++.h>
#define INF 1000000007
#define LINF 1000000000000000007
using namespace std;
typedef long long Int;
typedef pair<Int, Int> P;
Int gcd(Int x, Int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
Int lcm(Int x, Int y) { return x * y / gcd(x, y); }
bool sosuu(int x) {
bool b = 1;... | #include <bits/stdc++.h>
#define INF 1000000007
#define LINF 1000000000000000007
using namespace std;
typedef long long Int;
typedef pair<Int, Int> P;
Int gcd(Int x, Int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
Int lcm(Int x, Int y) { return x * y / gcd(x, y); }
bool sosuu(int x) {
bool b = 1;... | [["-", 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, 13], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 21], ["-", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 18], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 12, 13], ["+", 8, 9... | 1 | 224 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a < 0) {
if (b < 0 && (b - a + 1) % 2)
ans = "Negative";
else
ans = "Zero";
} else
ans = "Positive";
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a < 0) {
if (b < 0 && (b - a + 1) % 2)
ans = "Negative";
else if (b < 0)
ans = "Positive";
else
ans = "Zero";
} else
ans = "Positive";
cout << ans << endl;
return 0;
}
| [["+", 64, 9, 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], ["+", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25], ["+", 75, 76, 0, 57, 64, 1, 0, 11, 17, 32], ... | 1 | 79 |
a,b = map(int,input().split())
ans = 0
# main
if (a <= 0 <= b) or a == 0 or b == 0:
ans = "Zero"
elif a < 0:
if b - a % 2 == 0:
ans = "Positive"
else:
ans = "Negative"
else:
ans = "Positive"
print(ans) | a,b = map(int,input().split())
# main
if (a <= 0 <= b) or a == 0 or b == 0:
ans = "Zero"
elif b < 0:
if (b - a) % 2 == 1:
ans = "Positive"
else:
ans = "Negative"
else:
ans = "Positive"
print(ans) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["-", 0, 656, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 0, 656, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 0, 57, 15, 666, 0, 657, 31, 23, 0, 24], ["+", 0, 57, 15, 666, 0, 657, 31, 23, 0, 25]... | 5 | 79 |
//#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#... | //#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5... | 1 | 1,193 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define int long long
signed main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
} else if (0 < a || (a % 2 == 0)) {
cout << "Positive" << endl;
} else {
cout << "Negative" <... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define int long long
signed main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
} else if (0 < a || (b < 0 && abs(a - b) % 2 == 1)) {
cout << "Positive" << endl;
} else {
co... | [["+", 51, 16, 12, 23, 0, 16, 31, 16, 31, 22], ["+", 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, 98], ["+", 0, 16, 12, 16, 31, 16, 31, 2, 63, 22], ["+", 12, 16, 31, 16, 31, 2, 3, 4, 0, 24], ["+", 31, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+... | 1 | 93 |
#include <bits/stdc++.h>
#include <stdio.h>
#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()
#... | #include <bits/stdc++.h>
#include <stdio.h>
#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()
#... | [["+", 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, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["... | 1 | 234 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, i = 1, c;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
if (a > 0)
cout << "Positive" << endl;
if (b < 0) {
if (b == a)
cout << "Positive" << endl;
if (b - a % 2 == 0 && b != a)
cout << "N... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, i = 1, c;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
if (a > 0)
cout << "Positive" << endl;
if (b < 0) {
if ((b - a) % 2 == 0)
cout << "Negative" << endl;
if ((b - a) % 2 != 0)
cout << ... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 57, 64, 1, 0, 16, 31, 16, 31, 22], ["-", 0, 57, 64, 1, 0, 16, 31, 16, 17, 151], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["-",... | 1 | 128 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using vint = vector<int>;
using pint = pair<int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using vint = vector<int>;
using pint = pair<int... | [["-", 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, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 8, 9, 0, 57, 64, 9, 0, 57, 0, 121], ["-", 0, 57, 64... | 1 | 182 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> mat;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define mset(a, x) memset(a, x, siz... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> mat;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define mset(a, x) memset(a, x, siz... | [["+", 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 | 143 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[3000][52];
main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b)
cout << "Zero" << endl;
else if (1 <= a)
cout << "Positive" << endl;
else {
int t = abs(b - a);
if (t % 2 == 0)
cout << "Negative" << endl;
el... | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b)
cout << "Zero" << endl;
else if (1 <= a)
cout << "Positive" << endl;
else {
int t = abs(b - a);
if (t % 2 == 0)
cout << "Negative" << endl;
else
cout << "Positive" << endl;
}... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 49, 22], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 0, 70], ["-", 0, 30, 0, 43, 49, 80, 49, 80, 81, 13], ["-"... | 1 | 105 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
try (BufferedReader kb =
new BufferedReader(new InputStreamReader(System.in))) {
StringTokenizer st = new StringTokenizer(kb.readLine());
int a = Integer.parseInt(st.next... |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
try (BufferedReader kb =
new BufferedReader(new InputStreamReader(System.in))) {
StringTokenizer st = new StringTokenizer(kb.readLine());
int a = Integer.parseInt(st.next... | [["+", 0, 57, 75, 57, 15, 15, 0, 16, 17, 60], ["+", 0, 57, 75, 57, 15, 15, 0, 16, 12, 22], ["+", 8, 196, 0, 57, 75, 57, 15, 15, 0, 25], ["+", 8, 196, 0, 57, 75, 57, 64, 196, 0, 45], ["+", 64, 196, 0, 1, 0, 492, 500, 509, 500, 22], ["+", 64, 196, 0, 1, 0, 492, 500, 509, 0, 131], ["+", 64, 196, 0, 1, 0, 492, 500, 509, 11... | 3 | 186 |
a, b = map(int, input().split())
if a <= 0 <= b:
print("Zero")
elif a <= b < 0:
if (abs(a) - abs(b)) % 2 == 1:
print("Negative")
else:
print("Positive")
else:
print("Positive")
| a, b = map(int, input().split())
if a <= 0 <= b:
print("Zero")
elif a <= b < 0:
if a == b:
print("Negative")
elif (abs(a) - abs(b)) % 2 == 1:
print("Positive")
else:
print("Negative")
else:
print("Positive")
| [["+", 75, 665, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 75, 665, 64, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 57, 75, 665, 64, 196, 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], ["... | 5 | 75 |
<?php
$array = explode(" ", trim(fgets(STDIN)));
$a = $array[0];
$b = $array[1];
$ans = 'Zero';
if($a > 0) $ans = 'Positive';
if($b < 0 && ($b - $a + 1) % 2 == 1) $ans = 'Negative';
print($ans);
?> | <?php
$array = explode(" ", trim(fgets(STDIN)));
$a = $array[0];
$b = $array[1];
$ans = 'Zero';
if($a > 0) $ans = 'Positive';
if($b < 0) {
if(($b - $a + 1) % 2 == 1) {
$ans = 'Negative';
} else {
$ans = 'Positive';
}
}
print($ans);
?> | [["-", 0, 493, 0, 57, 15, 23, 0, 16, 17, 98], ["+", 36, 36, 0, 493, 0, 57, 15, 23, 0, 25], ["+", 36, 36, 0, 493, 0, 57, 8, 9, 0, 45], ["+", 0, 493, 0, 57, 8, 9, 0, 57, 0, 121], ["+", 15, 23, 0, 16, 31, 16, 31, 23, 0, 24], ["+", 0, 57, 8, 9, 0, 57, 8, 9, 0, 45], ["+", 8, 9, 0, 1, 0, 11, 12, 557, 0, 104], ["+", 8, 9, 0, ... | 6 | 93 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B);... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B);... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 57, 15, 339, 0, 25], ["-", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["-", 64, 9, 0, 1, 0, 11, 12, 91, 17, 33], ["-", 64, 9, 0, ... | 1 | 148 |
// C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | // C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | [["-", 51, 16, 31, 23, 0, 16, 31, 16, 17, 19], ["+", 51, 16, 31, 23, 0, 16, 31, 16, 17, 18], ["-", 51, 16, 31, 23, 0, 16, 12, 16, 17, 20], ["+", 51, 16, 31, 23, 0, 16, 12, 16, 17, 47], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["... | 1 | 180 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 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, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1,... | 1 | 161 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i = int(f); i <= int(n); i++)
#define rep(i, n) reps(i, 0, int(n) - 1)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define reps(i, f, n) for (int i = int(f); i <= int(n); i++)
#define rep(i, n) reps(i, 0, int(n) - 1)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 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, 31, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ... | 1 | 191 |
// VSCF.cpp : Defines the entry point for the console application.
//
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef p... | // VSCF.cpp : Defines the entry point for the console application.
//
#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef p... | [["+", 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, 2, 63, 22], ["+", 15, 339, 51, 16, 31, 2, 3, 4, 0, 24], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 51, 16, 31, 2, 3, 4, 0, 16, 12, 22], ["+", 15, 33... | 1 | 206 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, _n = n; i < (int)_n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define eb emplace_back
#define pb emplace_back
#define mt make_tuple
template <class T> bool chmin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, _n = n; i < (int)_n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define eb emplace_back
#define pb emplace_back
#define mt make_tuple
template <class T> bool chmin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 78], ["+", ... | 1 | 221 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define MP... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define MP... | [["-", 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, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 9, 0, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["-", 0, 57, 75, 76, 0, 9, 0, 43, 0, 35], ["-", 0, 1, 0, ... | 1 | 336 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 16, 31, 23, 0, 16, 31, 2, 63, 22], ["+", 31, 23, 0, 16, 31, 2, 3, 4, 0, 24], ["-", 0, 41, 15, 23, 0, 16, 31, 16, 17, 109],... | 1 | 804 |
#include <stdio.h>
int main(void) {
int a, b;
scanf("%i %i", &a, &b);
if (a <= 0 && 0 <= b) {
puts("Zero");
} else if (a > 0) {
puts("Positive");
} else {
if (-a % 2) {
puts("Negative");
} else {
puts("Positive");
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int a, b;
scanf("%i %i", &a, &b);
if (a <= 0 && 0 <= b) {
puts("Zero");
} else if (a > 0) {
puts("Positive");
} else {
int len = b - a + 1;
if (len % 2) {
puts("Negative");
} else {
puts("Positive");
}
}
return 0;
} | [["-", 0, 57, 75, 76, 0, 9, 0, 57, 0, 121], ["-", 75, 76, 0, 9, 0, 57, 15, 23, 0, 24], ["+", 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, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 0, 9, 0... | 0 | 94 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 51, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["-", 31, 16, 31, 23, 0, 16, 12, 2, 63, 22], ["-", 31, 23, 0, 16, 12, 2, 3, 4, 0, 24], ["-", 31, 23, 0, 16, 12, 2, 3, 4, 0, 13], ["-", 31, 23, 0, 16, 12, 2, 3, 4, 0, 21], ["-", 0,... | 1 | 308 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int a, b;
cin >> a >> b;
if... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int a, b;
cin >> a >> b;
if... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 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, 5, 0, 62], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, ... | 1 | 159 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
} else {
int cnt = 0;
if (a < 0 && (-a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && 0 <= b) {
cout << "Zero" << endl;
} else {
int cnt = 0;
if (b < 0)
a += b;
if (a < 0 && (-a) % 2 == 0) {
cout << "Negative" << endl;
} else {
cout << "Positive" << endl;
... | [["+", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 0, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 0, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 75, 76,... | 1 | 90 |
#include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1, _2, _3, _4, ...) _4
#define forn3(i, l, r) for (int i = int(l); i < int(r); ++i)
#define forn2(i, n) forn3(i, 0, n)
#define forn(...) A... | #include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1, _2, _3, _4, ...) _4
#define forn3(i, l, r) for (int i = int(l); i < int(r); ++i)
#define forn2(i, n) forn3(i, 0, n)
#define forn(...) A... | [["+", 51, 16, 12, 23, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 23, 0, 16, 31, 23, 0, 24], ["+", 31, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 16, 31, 23, 0, 16, 12, 2, 63, 22], ["+", 31, 23, 0, 16, 12, 2, 3, 4, 0, 24], ["+", 31, 23, 0, 16, 12, 2, 3, 4, 0, 22], ["+", 31, 23, 0... | 1 | 433 |
/*
*/
//#pragma comment(linker, "/STACK:16777216")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
... | /*
*/
//#pragma comment(linker, "/STACK:16777216")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
... | [["+", 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], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 109], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+"... | 1 | 173 |
from collections import defaultdict
n, m = map(int, input().split())
r = set()
r.add(1)
d = defaultdict(int)
for i in range(m):
x, y = map(int, input().split())
d[x] -= 1
d[y] += 1
if x in r:
r.add(y)
ans = len(list(r))
for e in d:
if d[e] == -1 and e in r:
ans -= 1
print(ans) | from collections import defaultdict
n, m = map(int, input().split())
r = set()
r.add(1)
d = defaultdict(int)
for i in range(m):
x, y = map(int, input().split())
d[x] -= 1
d[y] += 1
if x in r:
r.add(y)
if d[x] == -1 and x in r:
r.remove(x)
ans = len(list(r))
for e in d:
if d[e] == -1 and e in r:
... | [["+", 0, 656, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 57, 15, 679, 31, 666, 0, 206, 51, 22], ["+", 0, 57, 15, 679, 31, 666, 0, 206, 0, 70], ["+", 0, 57, 15, 679, 31, 666, 0, 206, 206, 22], ["+", 0, 57, 15, 679, 31, 666, 0, 206, 0, 73], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 60], ["+", 0, 57, 15, 679, 31, 666, 0, 6... | 5 | 118 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int s = 0;
vector<int> V;
V.assign(N, 1);
map<int, int> mp;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int s = 0;
vector<int> V;
V.assign(N, 1);
map<int, int> mp;
mp[0] = 1;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >... | [["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 15, 339, 51, 1... | 1 | 216 |
n, m = map(int, input().split())
b = [1] * n
r = [1] + [0] * (n-1)
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
if r[x] == 1:
if b[x] == 1:
r[x] = 0
r[y] = 1
b[x] -= 1
b[y] += 1
if b[x] > 1:
r[y] = 1
... | n, m = map(int, input().split())
b = [1] * n
r = [1] + [0] * (n-1)
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
if r[x] == 1:
if b[x] == 1:
r[x] = 0
r[y] = 1
b[x] -= 1
b[y] += 1
else:
r[y] = 1... | [["-", 8, 196, 0, 57, 64, 196, 0, 57, 0, 121], ["-", 64, 196, 0, 57, 15, 666, 0, 206, 51, 22], ["-", 64, 196, 0, 57, 15, 666, 0, 206, 0, 70], ["-", 64, 196, 0, 57, 15, 666, 0, 206, 206, 22], ["-", 64, 196, 0, 57, 15, 666, 0, 206, 0, 73], ["-", 0, 57, 64, 196, 0, 57, 15, 666, 667, 47], ["-", 0, 57, 64, 196, 0, 57, 15, 6... | 5 | 174 |
#include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | #include <bits/stdc++.h>
using namespace std;
typedef bool boool;
typedef long long ll;
#define vl vector<ll>
#define vb vector<boool>
#define vs vector<string>
#define vp vector<pair<ll, ll>>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll, ll>>>
#define mod 1000000007
#define all(x) x.begin(), x.end(... | [["+", 8, 9, 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, 69, 28, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 70], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 16, 31, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 6... | 1 | 210 |
n,m = gets.split.map(&:to_i)
dp = Array.new(n+1){[1,false]}
dp[1][1] = true
m.times do
a,b = gets.split.map(&:to_i)
dp[b][0] += dp[a][0]
dp[a][0] -= 1
dp[b][1] = dp[b][1] || dp[a][1]
dp[a][1] = false if dp[a][0] == 0
end
ans = 0
dp.each {|num,bool| ans += 1 if bool}
p ans
| n,m = gets.split.map(&:to_i)
dp = Array.new(n+1){[1,false]}
dp[1][1] = true
m.times do
a,b = gets.split.map(&:to_i)
dp[b][0] += 1
dp[a][0] -= 1
dp[b][1] = dp[b][1] || dp[a][1]
dp[a][1] = false if dp[a][0] == 0
end
ans = 0
dp.each {|num,bool| ans += 1 if bool}
p ans
| [["-", 8, 736, 0, 755, 12, 742, 500, 742, 500, 22], ["-", 8, 736, 0, 755, 12, 742, 500, 742, 0, 70], ["-", 8, 736, 0, 755, 12, 742, 500, 742, 0, 22], ["-", 8, 736, 0, 755, 12, 742, 500, 742, 0, 73], ["-", 196, 737, 8, 736, 0, 755, 12, 742, 0, 70], ["-", 196, 737, 8, 736, 0, 755, 12, 742, 0, 612], ["-", 196, 737, 8, 736... | 4 | 143 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [["+", 8, 9, 0, 1, 0, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 70], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 73], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 146], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 15, 339, 51, ... | 1 | 3,861 |
// clang-format off
#include <bits/stdc++.h>
#include<string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
// clang-format on
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (a >= 0 && b <= 0) {
... | // clang-format off
#include <bits/stdc++.h>
#include<string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
// clang-format on
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0) {
cout << "Zero" << endl;
} else if (a >= 0 && b <= 0) {
... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 57, 64, 9, 0, 1, 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, 15, 339, 51, 16, 12, 13], ["+", 64, 9, ... | 1 | 156 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define RFOR(i, b, a) for (int(i) = (b); (i) >= (a); (i)--)
#define RREP(i, n) FOR((i), (n), 0)
#define pb push_back
#define mp make_pair
using namespace std;
const int INF = INT_MAX / 4;
const int... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR((i), 0, (n))
#define RFOR(i, b, a) for (int(i) = (b); (i) >= (a); (i)--)
#define RREP(i, n) FOR((i), (n), 0)
#define pb push_back
#define mp make_pair
using namespace std;
const int INF = INT_MAX / 4;
const int... | [["-", 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], ["-", 31, 2, 3, 4, 0, 16, 31, 16, 17, 3... | 1 | 225 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static void solve(FastScanner sc, PrintWriter out) {
int a = sc.ni();
int b = sc.ni();
out.println(a * b <= 0 ... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static void solve(FastScanner sc, PrintWriter out) {
long a = sc.nl();
long b = sc.nl();
out.println(a * b <= 0 ... | [["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 506, 0, 96], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 75, 510, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 75, 510, 15, 23, 0, 16, 31, 16, 31, 22], ["-", 0, 16, 12, 16, 31, 16, 3... | 3 | 777 |
// 84104971101048411497 - Can you guess what does this mean?
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) \
... | // 84104971101048411497 - Can you guess what does this mean?
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> point;
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) \
... | [["-", 0, 30, 0, 14, 8, 9, 0, 171, 0, 184], ["-", 0, 30, 0, 14, 8, 9, 0, 171, 141, 22], ["-", 8, 9, 0, 171, 0, 1, 0, 2, 63, 22], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 171, 0, 1, 0, 2, 3, 4, 0, 2... | 1 | 368 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a > b)
swap(a, b);
if (a * b <= 0)
printf("Zero\n");
else {
if (a > 0)
printf("Positive\n");
else
printf(((a - b + 1) % 2 == 0) ? "Positive\n" : "Negative\n");
}
} | #include <bits/stdc++.h>
using namespace std;
long long a, b;
int main() {
scanf("%lld%lld", &a, &b);
if (a > b)
swap(a, b);
if (a * b <= 0)
printf("Zero\n");
else {
if (a > 0)
printf("Positive\n");
else
printf(((a - b + 1) % 2 == 0) ? "Positive\n" : "Negative\n");
}
} | [["+", 36, 36, 0, 30, 0, 43, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 1... | 1 | 104 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#de... | [["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 75, 76, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 9, ... | 1 | 198 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a == 0 || b == 0) {
cout << "Zero" << endl;
} else if (b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else if ((b - a) % 2 != 0) {
co... | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 0) {
cout << "Positive" << endl;
} else if (a == 0 || b == 0) {
cout << "Zero" << endl;
} else if (b < 0) {
if ((b - a) % 2 == 0) {
cout << "Negative" << endl;
} else if ((b - a) % 2 != 0) {
co... | [["+", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["+", 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, 47], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98... | 1 | 114 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | [["+", 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, 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 | 156 |
#include <bits/stdc++.h>
using namespace std;
int a;
int b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
if (a * b < 0 || a == 0 || b == 0) {
cout << "Zero" << endl;
} else if (0 < a || a == b) {
cout << "Positive" << endl;
} else {
if ((b - a - 1) % 2 == 1) {
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a;
ll b;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> a >> b;
if (a * b < 0 || a == 0 || b == 0) {
cout << "Zero" << endl;
} else if (0 < a || a == b) {
cout << "Positive" << endl;
} else {
if ((b - a - 1... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78]] | 1 | 126 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a * b > 0)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a <= 0 && b >= 0)
cout << "Zero" << endl;
else if (a > 0 || (b - a) % 2)
cout << "Positive" << endl;
else
cout << "Negative" << endl;
return 0;
} | [["-", 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, 106], ["+", 15, 339, 51, 16, 12, 16, 31, 23, 0, 24], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 17, 33], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 1... | 1 | 75 |
#include <bits/stdc++.h>
#define rep(i, n) for (li i = 0; i < n; i++)
using namespace std;
typedef vector<int> vi;
typedef long int li;
typedef unsigned long long ull;
int main(int argc, char *argv[]) {
int a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive\n";
if (a <= 0 && b >= 0)
cout << "Ze... | #include <bits/stdc++.h>
#define rep(i, n) for (li i = 0; i < n; i++)
using namespace std;
typedef vector<int> vi;
typedef long int li;
typedef unsigned long long ull;
int main() {
li a, b;
cin >> a >> b;
if (a > 0 && b > 0)
cout << "Positive\n";
if (a <= 0 && b >= 0)
cout << "Zero\n";
if (a < 0 && b... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["-", 0, 30, 0, 14, 49, 53, 54, 55, 0, 21], ["-", 49, 53, 54, 55, 0, 56, 49, 84, 0, 48], ["-", 54, 55, 0, 56, 49, 84, 49, 80, 49, 22], ["-", 54, 55, 0, 56, 49, 84, 49, 80, 0, 70], ["-", 54, 55, 0, 56, 49, 84, 49, 80, 0, 73], ["-"... | 1 | 131 |
#include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | [["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 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], ["+", 75, 76, 0, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 0, 35], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 51, 16, 1... | 1 | 183 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int c = b - a;
if (b < 0 && a < 0)
c = -c;
if (c > 0)
cout << "Positive";
else if (c == 0) {
if (a > 0)
cou... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
int c = b - a;
if (b < 0 && a < 0)
c = -c;
if (b >= 0 && a <= 0)
cout << "Zero";
else if (c > 0)
cout << "Positiv... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 20], ["+", 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, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 1... | 1 | 153 |
#include <iostream>
int main(void) {
int a, b;
std::cin >> a >> b;
if (a * b <= 0)
std::cout << "Zero" << std::endl;
else if (b < 0 && ((b - a) % 2))
std::cout << "Negative" << std::endl;
else
std::cout << "Positive" << std::endl;
return 0;
} | #include <iostream>
int main(void) {
int a, b;
std::cin >> a >> b;
if (a <= 0 && 0 <= b)
std::cout << "Zero" << std::endl;
else if (b < 0 && ((b - a) % 2) == 0)
std::cout << "Negative" << std::endl;
else
std::cout << "Positive" << std::endl;
return 0;
} | [["-", 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, 57, 15, 339, 51, 16, 12, 16, 1... | 1 | 87 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a <= 0 and b >= 0) {
cout << "Zero" << endl;
} else if (a > 0 and b > 0) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a <= 0 and b >= 0) {
cout << "Zero" << endl;
} else if (a > 0 or (b - a + 1) % 2 == 0) {
cout << "Positive" << endl;
} else {
cout << "Negative" << endl;
}
return 0;
} | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 355], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 354], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 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, 1... | 1 | 85 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INT unsigned long long int
#define FORN(n) for (int i = 0; i < n; i++)
#define PINT(d) printf("%d\n", d);
#define PDOUBLE(lf) printf("%lf\n", lf);... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INT unsigned long long int
#define FORN(n) for (int i = 0; i < n; i++)
#define PINT(d) printf("%d\n", d);
#define PDOUBLE(lf) printf("%lf\n", lf);... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 49, 22], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 0, 70], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["-"... | 1 | 180 |
//#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#... | //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 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], ["+", 51, 16, 12, 16, 31, 16, 31, 23, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+"... | 1 | 619 |
#include <stdio.h>
int main(void) {
long a, b;
scanf("%1d%1d", &a, &b);
if (a <= 0 && b >= 0) {
printf("Zero");
} else if (a > 0) {
printf("Positive");
} else if ((b + a) % 2 == 0) {
printf("Negative");
} else {
printf("Positive");
}
return 0;
}
| #include <stdio.h>
int main(void) {
long a, b, i, c = 0;
scanf("%ld%ld", &a, &b);
if (a <= 0 && b >= 0) {
printf("Zero");
} else if (a > 0 && b > 0) {
printf("Positive");
} else if ((b - a) % 2 == 0) {
printf("Negative");
} else {
printf("Positive");
}
return 0;
}
| [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 57, 15, 23, 0, 16, 31, 16... | 0 | 97 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.