Submission #3431702


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint>PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};

int  N,M,L,P,Q,R;

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
    int n, m, l, p, q, r;
  cin >> n >> m >> l >> p >> q >> r;
 
  int ret = max((n/p)*(m/q)*(l/r), (n/q)*(m/p)*(l/r));
  ret = max(ret, (m/r)*(l/q)*(n/p));
  ret = max(ret, (m/p)*(l/q)*(n/r));
  ret = max(ret, (l/p)*(n/r)*(m/q));
  ret = max(ret, (m/r)*(l/p)*(n/q));
  cout<<ret<<"\n";
	
	
	
	
	
	
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}

Submission Info

Submission Time
Task A - 梱包できるかな?
User chocopuu
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1190 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rand_00.txt, 01_rand_01.txt, 01_rand_02.txt, 01_rand_03.txt, 01_rand_04.txt, 01_rand_05.txt, 01_rand_06.txt, 01_rand_07.txt, 01_rand_08.txt, 01_rand_09.txt, 01_rand_10.txt, 01_rand_11.txt, 01_rand_12.txt, 01_rand_13.txt, 01_rand_14.txt, 01_rand_15.txt, 01_rand_16.txt, 01_rand_17.txt, 01_rand_18.txt, 01_rand_19.txt, 01_rand_20.txt, 01_rand_21.txt, 01_rand_22.txt, 01_rand_23.txt, 01_rand_24.txt, 01_rand_25.txt, 01_rand_26.txt, 01_rand_27.txt, 01_rand_28.txt, 01_rand_29.txt, 99_min.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
01_rand_00.txt AC 1 ms 256 KB
01_rand_01.txt AC 1 ms 256 KB
01_rand_02.txt AC 1 ms 256 KB
01_rand_03.txt AC 1 ms 256 KB
01_rand_04.txt AC 1 ms 256 KB
01_rand_05.txt AC 1 ms 256 KB
01_rand_06.txt AC 1 ms 256 KB
01_rand_07.txt AC 1 ms 256 KB
01_rand_08.txt AC 1 ms 256 KB
01_rand_09.txt AC 1 ms 256 KB
01_rand_10.txt AC 1 ms 256 KB
01_rand_11.txt AC 1 ms 256 KB
01_rand_12.txt AC 1 ms 256 KB
01_rand_13.txt AC 1 ms 256 KB
01_rand_14.txt AC 1 ms 256 KB
01_rand_15.txt AC 1 ms 256 KB
01_rand_16.txt AC 1 ms 256 KB
01_rand_17.txt AC 1 ms 256 KB
01_rand_18.txt AC 1 ms 256 KB
01_rand_19.txt AC 1 ms 256 KB
01_rand_20.txt AC 1 ms 256 KB
01_rand_21.txt AC 1 ms 256 KB
01_rand_22.txt AC 1 ms 256 KB
01_rand_23.txt AC 1 ms 256 KB
01_rand_24.txt AC 1 ms 256 KB
01_rand_25.txt AC 1 ms 256 KB
01_rand_26.txt AC 1 ms 256 KB
01_rand_27.txt AC 1 ms 256 KB
01_rand_28.txt AC 1 ms 256 KB
01_rand_29.txt AC 1 ms 256 KB
99_min.txt AC 1 ms 256 KB