Submission #1745513
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <string> #include <stack> #include <queue> #include <cctype> #include <cstring> #include <set> #include <map> #define rep(i, m, n) for (int i = m; i < n; i++) #define repr(i, n) for (int i = n; i >= 0; i--) #define ll long long #define ull unsigned long long #define push(a) push_back(a) #define pop(a) pop_back(a) #define debug(x) cout << #x << ": " << x << endl #define SORT(v, n) sort(v, v + n); #define VSORT(v) sort(v.begin(), v.end()); #define INF 999999999 using namespace std; typedef pair<int, int> P; typedef pair<ll, ll> LP; typedef pair<int, P> PP; typedef pair<ll, LP> LPP; int dy[] = {0, 0, 1, -1, 0}; int dx[] = {1, -1, 0, 0, 0}; int a,b,c,d; int main(){ cin>>a>>b>>c>>d; if(a*b >= c*d){ cout<<a*b<<endl; }else{ cout<<c*d<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - Two Rectangles |
User | thedekopin0108 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 894 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 |