Submission #74392

---

Source Code Expand

// include {{{
#include <cstdio>
#include <iostream>
//#include <sstream>
#include <string>
#include <vector>
//#include <deque>
#include <stack>
#include <queue>
//#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <numeric>
//#include <complex>
// }}}
using namespace std;
// macro {{{
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0,_end=(n);i<_end;++i)
#define REP(i,j,k) for(int i=j,_end=(k);i<_end;++i)
//#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();++it)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define priority_queue_greater(T) priority_queue< T, vector<T>, greater<T> >
#define F .first
#define S .second
//test define...
#define D(x) #x<<"="<<(x)
#define DD(x) cout << #x << "=" << (x) << endl;
// }}}

int box[3],obj[3];
int main(){
  while( cin >> box[0] ){
    REP(i,1,3){ cin >> box[i]; }
    rep(i,3){ cin >> obj[i]; }

    sort(obj,obj+3);
    int ans = 0;
    do{
      int now = 1;
      rep(i,3){ now *= box[i] / obj[i]; }
      ans = max( ans, now );
    }while( next_permutation(obj,obj+3) );
    cout << ans << endl;
  }
  return 0;
}

Submission Info

Judge Result