Submission #1203331
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <fstream> #include <cassert> using namespace std; #define sz(a) int((a).size()) #define rep(i, s, n) for(int i = s; i <= (n); ++i) #define rev(i, n, s) for(int i = (n); i >= s; --i) #define fore(x, a) for(auto &&x : a) typedef long long ll; const int mod = 1000000007; const int N = 100005; int main() { #ifdef loc if(!freopen((string(FOLDER) + "inp.txt").c_str(), "r", stdin)) { assert(0); } freopen((string(FOLDER) + "out.txt").c_str(), "w", stdout); #endif ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll a, b, c; cin >> a >> b >> c; ll res = 0; if ((a & 1) && (b & 1) && (c & 1)) { res = min(a*b, min(b*c, c*a)); } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Divide a Cuboid |
User | chintu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1211 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 |