Submission #864978

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define BOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;


int main(){
    
    vector<ll> a(3);
    REP(i,3)cin>>a[i];
    
    REP(i,3){
        if(a[i]%2==0){
            cout<<0<<endl;
            return 0;
        }
    }
    
    set<ll> m;
    REP(i,3)REP(j,3){
        if(i!=j)m.insert(a[i]*a[j]);
    }
    
    cout<<*(m.begin())<<endl;
    
    return 0;
}

Submission Info

Judge Result