Submission #3416941
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <stack> #include <queue> #include <map> #include <set> #include <cmath> #include <time.h> #include <stdio.h> #include <vector> #define int long long #define end getchar();getchar();return 0 int inf = 1000000000; using namespace std; int gcd(int x, int y) { if (y == 0)return x; return gcd(y, x%y); } int lcm(int x, int y) { return x / gcd(x, y)*y; } int mypow(int x, int y) { if (y == 0)return 1; if (y % 2)return mypow(x, y - 1)*x; else return mypow(x, y / 2)*mypow(x, y / 2); } int Max(int x, int y) { if (x > y)return x; else return y; } int Min(int x, int y) { if (x < y)return x; else return y; } int kai(int x) { int cnt = 1; if (x == 0)return 1; cnt = kai(x - 1); return x * cnt; } int prime(int n) { for (int i = 2; i*i <= n; i++) { if (n%i == 0)return false; } return n != 1; } void prime_factor(int n) { int cnt = 1; map<int, int>res; int m = n; for (int i = 2; i <= n; i++) { if (prime(i)) { while (m%i == 0) { ++res[i]; m /= i; } } } cout << n << ":" << endl; for (int i = 2; i <= n; i++) { if (res[i]) { cout << i << " " << res[i] << endl; } } cout << endl; } /*Library End!*/ int n[5],m[5],ans,memo=1; signed main() { cin>>n[0]>>n[1]>>n[2]>>m[0]>>m[1]>>m[2]; sort(n,n+3); sort(m,m+3); do{ do{ memo=1; memo*=(n[0]/m[0])*(n[1]/m[1])*(n[2]/m[2]); ans=max(memo,ans); }while(next_permutation(m,m+3)); }while(next_permutation(n,n+3)); cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 梱包できるかな? |
User | define |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1586 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 |