Submission #864970
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> pii; typedef pair<ll, ll> pll; typedef vector<ll> vii; typedef vector<ll> vll; #define X first #define Y second #define rep(i,n) for(ll i=0; i<(n); i++) #define repp(i,ed,b) for(ll i=ed; i<=(b); i++) #define repp2(i,b,ed) for(ll i=b; i>=(ed); i--) #define fill(ed,val) memset(ed, (val), sizeof(ed)) #define mp make_pair #define pb push_back #define all(c) (c).begin(), (c).end() #define uni(c) c.resize(distance(c.begin(), unique(all(c)))) #define io ios_base::sync_with_stdio(false);cin.tie(NULL); #define IO(input_file_name) ifstream cin(input_file_name);ofstream cout("output.txt") #define sc(n) scanf("%lld",&n) ll mod= 1e9 + 7, mod1=1e9+9; const ll N=200005; int main() { io; ll a,b,c; cin>>a>>b>>c; ll tmp=a*b*(c-c/2*2); tmp=min(tmp,b*c*(a-a/2*2)); tmp=min(tmp,a*c*(b-b/2*2)); cout<<tmp; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Divide a Cuboid |
User | Queued |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 983 Byte |
Status | AC |
Exec Time | 4 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 | 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 | AC | 4 ms | 256 KB |
1_02.txt | AC | 4 ms | 256 KB |
1_03.txt | AC | 4 ms | 256 KB |
1_04.txt | AC | 4 ms | 256 KB |
1_05.txt | AC | 4 ms | 256 KB |