Submission #8841555
Source Code Expand
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
// ARC013A - 梱包できるかな?
// N*M*LのダンボールにP*Q*Rの荷物をできるだけたくさん詰め込みたい
// 横に90度倒すことはできる
// (N,M,L)を固定して、(P,Q,R),(P,R,Q),(Q,P,R),(Q,R,P),(R,Q,P),(R,P,Q)の6パターン
// 商を算出して、それぞれ乗算したもののうち、最大値が答え
int N, M, L, P, Q, R;
cin >> N >> M >> L >> P >> Q >> R;
int ans = 0, tmp1, tmp2, tmp3;
ans = max(ans, (N/P) * (M/Q) * (L/R));
ans = max(ans, (N/P) * (M/R) * (L/Q));
ans = max(ans, (N/Q) * (M/P) * (L/R));
ans = max(ans, (N/Q) * (M/R) * (L/P));
ans = max(ans, (N/R) * (M/Q) * (L/P));
ans = max(ans, (N/R) * (M/P) * (L/Q));
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
A - 梱包できるかな? |
User |
Tsukasan |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1106 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
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 |