Submission #2543513
Source Code Expand
// // main.cpp // ProCon // // Created by hashimotoryoma on 2017/08/20. // Copyright © 2017年 hashimotoryoma. All rights reserved. // #include <iostream> #include <fstream> #include <algorithm> #include <string> #include <map> #include <queue> #include <vector> #define repeat(i,n) for (int i = 0; (i) < (n); ++ (i)) using namespace std; typedef long long ll; int main() { // insert code here... return 0; ////// // input from txt /* std::ifstream in("input.txt"); std::cin.rdbuf(in.rdbuf()); std::ofstream out("output.txt"); std::cout.rdbuf(out.rdbuf()); //// */ int A,B,C,D; cin >> A >> B >> C >> D; cout << max(A*B,C*D) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Two Rectangles |
User | hashiryo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 762 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_abmax_01.txt, subtask_1_allmax_01.txt, subtask_1_cdmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_same_01.txt, subtask_1_same_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_abmax_01.txt | AC | 1 ms | 256 KB |
subtask_1_allmax_01.txt | AC | 1 ms | 256 KB |
subtask_1_cdmax_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_02.txt | AC | 1 ms | 256 KB |
subtask_1_rand_03.txt | AC | 1 ms | 256 KB |
subtask_1_same_01.txt | AC | 1 ms | 256 KB |
subtask_1_same_02.txt | AC | 1 ms | 256 KB |