Submission #824665
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <cassert> #include <cmath> #include <iostream> #include <iomanip> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <queue> #include <stack> #include <utility> #include <vector> #include <functional> #include <algorithm> using namespace std; typedef long double ld; typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; int main() { ll a, b; cin >> a >> b; if (a <= 0 && b >= 0) { cout << "Zero" << endl; } else if (a > 0) { cout << "Positive" << endl; } else { ll temp = (b - a) + 1; if (temp % 2) { cout << "Negative" << endl; } else { cout << "Positve" << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Range Product |
User | polingy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 770 Byte |
Status | WA |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 100 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask1 | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 4 ms | 256 KB |
0_01.txt | AC | 4 ms | 256 KB |
0_02.txt | AC | 4 ms | 256 KB |
1_00.txt | AC | 4 ms | 256 KB |
1_01.txt | WA | 4 ms | 256 KB |
1_02.txt | AC | 4 ms | 256 KB |
1_03.txt | AC | 4 ms | 256 KB |
2_00.txt | AC | 4 ms | 256 KB |
2_01.txt | WA | 4 ms | 256 KB |
2_02.txt | AC | 4 ms | 256 KB |
2_03.txt | AC | 4 ms | 256 KB |