Submission #864684
Source Code Expand
// eddy1021
#include <bits/stdc++.h>
using namespace std;
typedef double D;
typedef long double LD;
typedef long long ll;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<LD,LD> Pt;
typedef tuple<int,int,int> tiii;
typedef tuple<LL,LL,LL> tlll;
#define mod9 1000000009ll
#define mod7 1000000007ll
#define INF 1023456789ll
#define INF16 10000000000000000ll
#define FI first
#define SE second
#define X FI
#define Y SE
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define eps 1e-9
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#ifndef ONLINE_JUDGE
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...)
#endif
inline ll getint(){
ll _x=0,_tmp=1; char _tc=getchar();
while( (_tc<'0'||_tc>'9')&&_tc!='-' ) _tc=getchar();
if( _tc == '-' ) _tc=getchar() , _tmp = -1;
while(_tc>='0'&&_tc<='9') _x*=10,_x+=(_tc-'0'),_tc=getchar();
return _x*_tmp;
}
inline ll add( ll _x , ll _y , ll _mod = mod7 ){
ll _ = _x + _y;
if( _ >= _mod ) _ -= _mod;
return _;
}
inline ll sub( ll _x , ll _y , ll _mod = mod7 ){
ll _ = _x - _y;
if( _ < 0 ) _ += _mod;
return _;
}
inline ll mul( ll _x , ll _y , ll _mod = mod7 ){
ll _ = _x * _y;
if( _ >= _mod ) _ %= _mod;
return _;
}
ll mypow( ll _a , ll _x , ll _mod ){
if( _x == 0 ) return 1ll;
ll _tmp = mypow( _a , _x / 2 , _mod );
_tmp = mul( _tmp , _tmp , _mod );
if( _x & 1 ) _tmp = mul( _tmp , _a , _mod );
return _tmp;
}
ll mymul( ll _a , ll _x , ll _mod ){
if( _x == 0 ) return 0ll;
ll _tmp = mymul( _a , _x / 2 , _mod );
_tmp = add( _tmp , _tmp , _mod );
if( _x & 1 ) _tmp = add( _tmp , _a , _mod );
return _tmp;
}
inline bool equal( D _x , D _y ){
return _x > _y - eps && _x < _y + eps;
}
int __ = 1 , _cs;
/*********default*********/
void build(){
}
LL a , b , c;
void init(){
a = getint();
b = getint();
c = getint();
}
void solve(){
if( a % 2 == 0 || b % 2 == 0 || c % 2 == 0 )
puts( "0" );
else{
LL ans = min( a * b , min( a * c , b * c ) );
printf( "%lld\n" , ans );
}
}
int main(){
build();
//__ = getint();
while( __ -- ){
init();
solve();
}
}
Submission Info
Submission Time |
|
Task |
A - Divide a Cuboid |
User |
eddy1021 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
2263 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 |