Submission #1064868


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <cassert>
// using namespace std;
// #define int long long
#define REP(i,s,n) for (int i = (s); i < (n); ++i)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) for (int i = n; i >= 0; i--)
#define INF (int)(1e9+7)
#define space " "
#define ENDL "\n"
#define MAXL 100

int vx[] = {1, 0, -1, 0}, vy[] = {0, 1, 0, -1};

inline void init() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
}
// アドレスを渡すのを間違えないように!!
inline void nextInt(int *a) { scanf("%d", a); }
inline void nextInt(int *a, int *b) { scanf("%d %d", a, b); }
inline void nextInt(int *a, int *b, int *c) { scanf("%d %d %d", a, b, c); }
inline void nextDouble(double *a) { scanf("%lf", a); }
inline void nextDouble(double *a, double *b) { scanf("%lf %lf", a, b); }
inline void nextDouble(double *a, double *b, double *c) { scanf("%lf %lf %lf", a, b, c); }
inline void nextLine(char *c) { scanf("%s", c); getchar();/*改行の読み捨て*/ }
inline std::string nextLine() {
    std::string s = ""; char str[MAXL+1];
    scanf("%s", str); getchar(); /*改行の読み捨て*/
    return s += str;
}
inline void print(double *a, int n = 0) {
    std::cout << std::fixed << std::setprecision(n) << *a << ENDL;
}
inline void print(int a) {
    printf("%d\n", a);
}

/*************************End of templete************************/

int a, b, c, d;

int main() {

    std::cin >> a >> b >> c >> d;
    if (a * b > c * d) {
        std::cout << a * b << ENDL;
    } else {
        std::cout << c * d << ENDL;
    }

    return 0;
}

Submission Info

Submission Time
Task A - Two Rectangles
User otyaduke_117
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1861 Byte
Status AC
Exec Time 8 ms
Memory 764 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 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 8 ms 764 KB
sample_02.txt AC 2 ms 256 KB
subtask_1_abmax_01.txt AC 2 ms 256 KB
subtask_1_allmax_01.txt AC 3 ms 256 KB
subtask_1_cdmax_01.txt AC 2 ms 256 KB
subtask_1_rand_01.txt AC 3 ms 256 KB
subtask_1_rand_02.txt AC 3 ms 256 KB
subtask_1_rand_03.txt AC 3 ms 256 KB
subtask_1_same_01.txt AC 2 ms 256 KB
subtask_1_same_02.txt AC 2 ms 256 KB