Submission #1214977
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef complex<double> point; #define xx real() #define yy imag() #define REP(i, a, b) for(int i = (a); i < (int)(b); i++) #define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++) #define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++) #define SZ(x) (int)(x).size() #define BE(x) (x).begin(), (x).end() #define SORT(x) sort(BE(x)) #define _1 first #define _2 second #define x1 gray_cat_x1 #define y1 gray_cat_y1 template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } #define file "cycle" const double EPS = 1e-9; const double PI = acos(-1.); const int INF = 1e9; const ll MOD = 1e9 + 7; const int MAXN = 1e5 + 5; void solve(){ ll a, b, c, ans; cin >> a >> b >> c; if (a % 2 == 0 || b % 2 == 0 || c % 2 == 0){ ans = 0ll; } else { ans = min(a * b, min(b * c, a * c)); } cout << ans << endl; } int main(){ //freopen(file".in", "r", stdin); freopen(file".out", "w", stdout); int t = 1; //cin >> t; while(t--){ solve(); } }
Submission Info
Submission Time | |
---|---|
Task | A - Divide a Cuboid |
User | Timur_Sitdikov |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1208 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 |