Submission #1867166
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <vector> #include <iostream> #include <string.h> #include <set> #include <algorithm> #include <cmath> #include <string> using namespace std; typedef double LD; typedef long long LL; typedef pair<int, int> PII; #define MP make_pair #define PB push_back #define FOR(i,a,b) for(int i = (a); i < (b); ++i) #define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); --i) #define REP(i, t) FOR(i,0,t) #define ALL(a) a.begin(), a.end() #define SZ(a) (int)((a).size()) const LL MOD = 1000000007; const int INF = 1e9; const LL LINF = 1LL * INF * INF; const int MAXN = 1007; const LD EPS = 1e-7; const int MAXM = 5007; int main() { ios_base::sync_with_stdio(0); //freopen("In.txt", "r", stdin); LL a, b, c; cin >> a >> b >> c; if ((a & 1) && (b & 1) && (c & 1)) { LL ans = min(a * b, b * c); ans = min(ans, c * a); cout << ans; } else cout << 0; //cout << endl; system("pause"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Divide a Cuboid |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 935 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |