Problem:


Score : 100 points

Problem Statement

There are two rectangles.
The lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.
The lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.

Print the area of the rectangle with the larger area.
If the two rectangles have equal areas, print that area.

Constraints

All input values are integers.

1≤A≤10^4

1≤B≤10^4

1≤C≤10^4

1≤D≤10^4

Input

The input is given from Standard Input in the following format:

A B C D

Output

Print the area of the rectangle with the larger area.
If the two rectangles have equal areas, print that area.

Sample Input 1

3 5 2 7

Sample Output 1

15

The first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.
Thus, the output should be 15, the larger area.

Sample Input 2

100 600 200 300

Sample Output 2

60000



Sample input:
3 5 2 7


Sample output:
15

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if (a*b > c*d):
    print("{}".format(a*b))
elif (a*b < c*d):
    print("{}".format(c*d))
else:
    print("{}".format(a*b))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
x = a*b
y = c*d
if x>=y:
    print(x)
else:
    print(y)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
x,y=a*b,c*d
print(x) if x>y else print(y)

Submission status: Accepted

Solution code:
# coding: utf-8
a, b, c, d = map(int, input().split())
print(max(a * b, c * d))

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if A*B<C*D:
  print(C*D)
else :
  print(A*B)

Submission status: Accepted

Solution code:
# ABC 052 A - Two Rectangles
a,b,c,d =map(int,input().split())
if a * b >= c * d:
    print( a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print(a*b if a*b>c*d else c*d)

Submission status: Accepted

Solution code:
A, B, C, D = [ int(x) for x in input().split() ]

a = A * B
b = C * D
ans = max(a, b)

print(ans)
print()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    a, b, c, d = map(int, input().split())
    print(max(a * b, c * d))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if a*b > c*d:
  print(a*b)
elif a*b < c*d:
  print(c*d)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = [int(x) for x in input().split()]
print(max(A * B, C * D))

Submission status: Accepted

Solution code:
A,B,C,D=map(int,raw_input().split())
print max(A*B,C*D)

Submission status: Accepted

Solution code:
s=input().split()
a1=int(s[0])*int(s[1])
a2=int(s[2])*int(s[3])
if a1 >= a2:
    print(a1)
else:
    print(a2)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())

if a*b < c*d:
    print(c*d)
elif a*b == c*d:
    print(c*d)
else:
    print(a*b)

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
squares = [nums[0]*nums[1], nums[2]*nums[3]]
print(max(squares))

Submission status: Accepted

Solution code:
import math;
a,b,c,d=map(int,input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
s1=a*b
s2=c*d
def fun():
     print(11)
     print(22)
     print(33)
     print(22) 
s=max(s1,s2)
print(s)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if A*B<=C*D:
    print(C*D)
else:
    print(A*B)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if(a*b>c*d):
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if A*B>C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
print(A*B if A*B > C*D else C*D)

Submission status: Accepted

Solution code:
A, B, C, D = [int(_) for _ in input().split()]

print(max(A * B, C * D))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(A * B if C * D < A * B else C * D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(A * B if A * B >= C * D else C * D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a * b >= c * d:
  print(a * b)
else:
  print(c * d)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


a, b, c, d = LI()
print(max(a * b, c * d))

Submission status: Accepted

Solution code:
""" AtCoder """

A, B, C, D = map(int, input().split())

if A * B >= C * D:
    print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
*a, = map(int, input().split())
print(max(a[0]*a[1], a[2]*a[3]))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print(max(a * b, c * d) if a * b != c * d else a * b)

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
print(int(max(A*B,C*D)))

Submission status: Accepted

Solution code:
a,b,c,d = (int(i) for i in input().split())
if a*b >= c*d :
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

AB = A * B
CD = C * D

if AB >= CD :
    print(AB)
else:
    print(CD)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print(a*b if a*b >= c*d else c*d)

Submission status: Accepted

Solution code:
A, B, C, D = [int(x) for x in input().split()]
ab = A*B
cd = C*D
if ab>=cd: print(ab)
else: print(cd)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
ans_list = [a * b, c * d]

print(max(ans_list))

Submission status: Accepted

Solution code:
A, B, C, D = [ int(i) for i in input().split() ]
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
x = [int(i) for i in input().split()]

print(max((x[0]*x[1], x[2]*x[3])))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(A*B) if (A*B) >= (C*D) else print(C*D)

Submission status: Accepted

Solution code:
int_a, int_b, int_c, int_d = map(int, input().split())

print(int_a * int_b if int_a * int_b >= int_c * int_d else int_c * int_d)

Submission status: Accepted

Solution code:
n = [int(x) for x in input().split()]
print(max(n[0] * n[1], n[2] * n[3]))

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
print(max(A[0]*A[1],A[2]*A[3]))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if A * B >= C * D:
  print(A * B)
else:
  print(C * D)

Submission status: Accepted

Solution code:
H1,W1,H2,W2 = map(int,input().split())
if H1 * W1 > H2 * W2:
  ans = H1 * W1
else:
  ans = H2 * W2
print(ans)

Submission status: Accepted

Solution code:
a ,b,c,d= map(int, input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if(a*b < c*d):
    print(c*d)
elif(a*b > c*d):
    print(a*b)
else:
    print(a*b)

Submission status: Accepted

Solution code:
A, B, C, D = (int(x) for x in input().split())
if A * B >= C * D:
	print(A * B)
else:
	print(C * D)

Submission status: Accepted

Solution code:
a,b,c,d = [int(i) for i in input().split()]
s = a*b
if (s < c*d) :
    s = c*d

print(s)

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
X = A*B
Y = C*D
if X >= Y:
    print(X)
else:
    print(Y)

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
S1 = A * B
S2 = C * D
if(S1 >= S2):
  print(S1)
else:
  print(S2)

Submission status: Accepted

Solution code:
def main():
    a, b, c, d = map(int, input().split())
    areas = sorted([a * b, c * d])
    print(areas[1])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    a, b, c, d = map(int, input().split())
    if (a*b) <= (c*d):
        print(c*d)
        return 
    print(a*b)
    return 


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c, d = [int(i) for i in input().split()]
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

x = input().split()
#y = input().split()
a = []
for i in range(len(x)):
   a.append(int(x[i]))

if a[0]*a[1]<a[2]*a[3]:print(a[2]*a[3])
else:print(a[0]*a[1])

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
sone=A*B
stwo=C*D
if sone>stwo:
    print(sone)
elif sone<stwo:
    print(stwo)
elif sone==stwo:
    print(sone)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B,C,D = map(int,input().split())
print("{}".format(max(A*B,C*D)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    a, b, c, d = map(int, input().split())
    print(max(a*b, c*d))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A, B, C, D = [int(_) for _ in input().split()]
print(max(A*B, C*D))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
print( max([a*b,c*d]))

Submission status: Accepted

Solution code:
a = map(int, raw_input().split())

print max(a[0] * a[1], a[2] * a[3])

Submission status: Accepted

Solution code:
a,b,c,d = [int(x) for x in input().split()]
print(a*b) if (a*b) >= (c*d) else print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int, input().split())
print([c*d,a*b][a*b>=c*d])

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().rstrip().split()))

ab = A * B
cd = C * D
result = max(ab, cd)
print(result)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


def main():
    A, B, C, D = li_input()

    print(max(A*B, C*D))


main()

Submission status: Accepted

Solution code:
orline = input().split()
line = []
for i in range(len(orline)):
    line.append(int(orline[i]))  
sq1 = line[0] * line[1]
sq2 = line[2] * line[3]
if sq1 >= sq2:
    print(sq1)
else:
    print(sq2)

Submission status: Accepted

Solution code:
def big(w1, h1, w2, h2):
    if w1*h1 > w2*h2:
        return w1*h1
    else:
        return w2*h2

a=list(map(int,input().split()))
print(str(big(a[0],a[1],a[2],a[3])))

Submission status: Accepted

Solution code:
a=input().strip().split(" ")

b=[int(i) for i in a]

if(b[0]*b[1]>b[2]*b[3]):
    print(b[0]*b[1])
else:
    print(b[2]*b[3])

Submission status: Accepted

Solution code:
A,B,C,D=input().split()
a=int(A)
b=int(B)
c=int(C)
d=int(D)
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if a * b >= c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
x = a[0] * a[1]
y = a[2] * a[3]
if x >= y:
  print(x)
else:
  print(y)

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if A*B >= C*D:
  print(A*B)
else:
  print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, raw_input().split())
print max(A * B, C * D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
x, y = a*b, c*d
if x > y:
    print(x)
elif x < y:
    print(y)
else:
    print(x)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(max([A * B, C * D]))

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
L = [a*b, c*d]
L.sort()
print(L[1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b,c,d = map(int, input().split())

if a*b > c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
if num[0]*num[1] <= num[2]*num[3]:
	print(num[2]*num[3])
else:
	print(num[0]*num[1])

Submission status: Accepted

Solution code:
a = list(map(int,input().split(" ")))
b = a[0] * a[1]
c = a[2] * a[3]
if b > c:
  print(b)
else:
  print(c)

Submission status: Accepted

Solution code:
#! /usr/bin/python3
""" Two Rectangles """

A, B, C, D = map(int, input().split())

if __name__ == '__main__':
    print(max(A*B, C*D))

Submission status: Accepted

Solution code:
a, b, c, d = map( int, input().split())
if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())

n=a*b
m=c*d
if n>=m:
    print(n)
else:
    print(m)

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
c1 = A * B
c2 = C * D
if c1 >= c2:
    print(c1)
else:
    print(c2)

Submission status: Accepted

Solution code:
x,y,z,w = map(int, input().split())

if x*y >= z*w:
        print(x*y)
else:
        print(z*w)

Submission status: Accepted

Solution code:
a, b, c, d = [int(i) for i in input().split()]
s1 = a * b
s2 = c * d
if s1 > s2:
    print(s1)
else:
    print(s2)

Submission status: Accepted

Solution code:
# cook your dish here
a,b,c,d= map(int,input().split())
print(max([a*b,c*d]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print([a*b,c*d][a*b < c*d])

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
e=a*b
f=c*d
if e>f:
  print(e)
elif e<f:
  print(f)
else:
  print(e)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a,b,c,d = li()

if a*b < c*d:
    print(c*d)
else:
    print(a*b)

Submission status: Accepted

Solution code:
#coding: utf-8
A, B, C, D = map(int, input().split())
print(max(A*B, C*D))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if a * b >= c * d:
    print(a * b)

else:
    print(c * d)

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    A, B, C, D = map(int, input().split())
    print(max(A * B, C * D))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
square_1 = a*b
square_2 = c*d
print(int(max(square_1, square_2)))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())

area1 = a*b
area2 = c*d
if area1 == area2:
    print(area1)
else:
    print(max(area1,area2))

Submission status: Accepted

Solution code:
n = input().split()
a, b, c, d = int(n[0]), int(n[1]), int(n[2]), int(n[3])
x, y = a * b, c * d
if x < y:
  print(y)
elif x > y:
  print(x)
else:
  print(x)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if A*B<C*D:
    print(C*D)
else:
    print(A*B)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

print(max(A*B,C*D))

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
print(max([A * B, C * D]))

Submission status: Accepted

Solution code:
a, b, c, d = (int(i) for i in input().split())
if a * b > c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a,b,c,d = list(map(int, input().split()))
print(max([a * b , c * d]))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b<=c*d:
    print(c*d)
else:
    print(a*b)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
s1 = a*b
s2 = c*d
print(max(s1,s2))

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a*b>c*d:print(a*b)
elif a*b==c*d:print(a*b)
else:print(c*d)

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    print(max(A*B, C*D))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
print([a*b,c*d][a*b<d*c])

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))

print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a,b,c,d = (int(_) for _ in input().split())
print(a*b) if a*b >= c*d else print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b>c*d:
    print(a*b)
if a*b<c*d:
    print(c*d)  
if a*b==c*d:
    print(a*b)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())


if a * b == c * d or a * b > c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())

if A * B > C * D:
   print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
if a * b >= c * d:
  print(a * b)
else:
  print(c * d)

Submission status: Accepted

Solution code:
#52a
a,b,c,d =map(int,input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

def main():
    a, b, c, d = map(int, input().split())
    print(max(a * b, c * d))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a*b > c*d or a*b == c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print([a*b, c*d][a*b < c*d])

Submission status: Accepted

Solution code:
# input
A, B, C, D = map(int, input().split())

S1 = A * B
S2 = C * D
if S1 >= S2:
    print(S1)
else:
    print(S2)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
ab = a * b
cd = c * d
if ab > cd:
  print(ab)
else:
  print(cd)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
e=a*b
f=c*d
if e>=f:
  print(e)
else:
  print(f)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if A*B <= C*D:
    print(C*D)
else:
    print(A*B)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split(" "))

print(max(a*b, c*d))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())

if a*b>c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n[0]*n[1]>=n[2]*n[3]):
  print(n[0]*n[1])
else:
  print(n[2]*n[3])

Submission status: Accepted

Solution code:
a, b, c, d = [int(i) for i in input().split()]

ab = a * b
cd = c * d

if ab > cd:
    print(ab)
else:
    print(cd)

Submission status: Accepted

Solution code:
l = [int(x) for x in raw_input().split()]
print max(l[0] * l[1], l[2] * l[3])

Submission status: Accepted

Solution code:
def main():
    s = input()
    l = s.split(" ")
    shape_1 = int(l[0]) * int(l[1])
    shape_2 = int(l[2]) * int(l[3])
    print(max(shape_1,shape_2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

a, b, c, d = input().split(" ")

print(max(int(a)*int(b), int(c)*int(d)))

Submission status: Accepted

Solution code:
def main():
    s = input()
    l = s.split(" ")
    shape_1 = int(l[0]) * int(l[1])
    shape_2 = int(l[2]) * int(l[3])
    if shape_1 == shape_2:
        print(shape_1)
    elif shape_1 > shape_2:
        print(shape_1)
    elif shape_1 < shape_2:
        print(shape_2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C,D = (int(i) for i in input().split())
if A*B > C*D:
    print(A*B)
else:
    print(C*D)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, raw_input().split())
print max(A*B, C*D)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
print(max(a * b, c * d))

Submission status: Accepted

Solution code:

def main():
    a, b, c,d = input().split()
    a = int(a)
    b = int(b)
    c = int(c)
    d = int(d)

    if a*b < c*d:
        print(c*d)
    else:
        print(a*b)

if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b, c, d = map(int, input().split())
print(max([a*b, c*d]))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
A = a * b
B = c * d
if A >= B:
    print(A)
else: print(B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

A, B, C, D = map(int, input().split())

print(max(A * B, C * D))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a*b >= c*d :
    print(a*b)
else :
    print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int, input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
A,B,C,D = (int(i) for i in input().split())

print(max(A*B,C*D))

Submission status: Accepted

Solution code:
s=[int(i) for i in input().split()]
print(max(s[0]*s[1],s[2]*s[3]))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,raw_input().split())
print max(a*b, c*d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
print(max(A * B, C * D))

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
if A*B >C*D:
    print('{}'.format(A*B))
elif A*B ==C*D:
    print('{}'.format(A*B))
else :
    print('{}'.format(C*D))

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()] 
if a[0]*a[1] >= a[2]*a[3]:
  print(a[0]*a[1])
else:
  print(a[2]*a[3])

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
A = a * b
B = c * d
if A == B:
    print(A)
elif A > B:
    print(A)
else:
    print(B)

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
print((a * b if a * b > c * d else c * d))

Submission status: Accepted

Solution code:
a,b,c,d = list(map(int,input().split()))


if a * b >= c * d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, raw_input().split())
print a * b if (a * b > c * d) else c * d

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
if a * b >= c * d:
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a,b,c,d = map(int,input().split())

A1 = a*b
A2 = c*d

if A1 < A2:
    print(A2)
elif A2 < A1:
    print(A1)
else:
    print(A1)

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if a*b >= c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = [int(e) for e in input().split()]
AB = A * B
CD = C * D
if AB > CD:
  print(AB)
else:
  print(CD)

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
print(max(a * b, c * d))

Submission status: Accepted

Solution code:
a,b,x,y = map(int,input().split())
if a * b >= x * y :
  print(a * b)
else:
  print(x * y)

Submission status: Accepted

Solution code:
input = list(map(int,input().split()))
if input[0] * input[1] >= input[2] * input[3]:
  print(input[0] * input[1])
else:
  print(input[2] * input[3])

Submission status: Accepted

Solution code:
def larger(x, y):
	if x > y: return x
	else: return y

A, B, C, D = map(int, raw_input().split())
print larger(A*B, C*D)

Submission status: Accepted

Solution code:
N = list(map(int,input().split()))

print(max([N[0]*N[1],N[2]*N[3]]))

Submission status: Accepted

Solution code:
numbers = list(map(lambda x: int(x), input().split(" ")))

sq1 = numbers[0] * numbers[1]
sq2 = numbers[2] * numbers[3]

if sq1 > sq2:
    print(sq1)
else:
    print(sq2)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(max(a[0]*a[1],a[2]*a[3]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())

if a*b >= c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    a, b, c, d = list(map(int, input().split()))
    print(max(a * b, c * d))

Submission status: Accepted

Solution code:
S=str(input())
X=S.split()
A=int(X[0])
B=int(X[1])
C=int(X[2])
D=int(X[3])
if A*B < C*D:
    print(C*D)
else:
     print(A*B)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
area1 = a * b
area2 = c * d
if area1 > area2:
	print(area1)
elif area1 == area2:
	print(area1)
else:
	print(area2)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
one = a * b
two = c * d

if one >= two:
    print(one)
else:
    print(two)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if A*B<=C*D:
    print(C*D)
else :
    print(A*B)

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
c = int(arr_data[0][2])
d = int(arr_data[0][3])



print(a*b if a*b>=c*d else c*d)

Submission status: Accepted

Solution code:
a,b,c,d = (int(i) for i in input().split())
print(max(a*b,c*d))

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a*b==c*d:
  print(a*b)
elif a*b>c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

Solution code:
A, B, C, D = [int(s) for s in input().split()]
 
if A * B > C * D:
    print(A * B)
else:
    print(C * D)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
print(max([A*B,C*D]))

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
x = a * b
y = c * d

if x == y:
    print(x)
elif x > y:
    print(x)
elif x < y:
    print(y)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a*b >= c*d:
	print(a*b)
else:
	print(c*d)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
X=a*b
Y=c*d
print(max(X,Y))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, raw_input().split())
e = [a*b, c*d]
print max(e)

Submission status: Accepted

Solution code:
A,B,C,D=(int (i) for i in input(). split())
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
A,B,C,D = [int(i) for i in input().split()]
S1 = A*B
S2 = C*D
print(max(S1,S2))

Submission status: Accepted

Solution code:
x = input().split()
A = int(x[0])
B = int(x[1])
C = int(x[2])
D = int(x[3])
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())

if(a * b > c * d):
    print(a * b)
else:
    print(c * d)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split(" "))

first = a * b
second = c * d

if first > second:
    print(first)
else:
    print(second)

Submission status: Accepted

Solution code:
a,b,c,d=map(int, input().split())

if a*b>=c*d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

Solution code:
A,B,C,D=map(int, raw_input().split())
print max(A*B, C*D)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
A=a*b
B=c*d

if A >= B:
  print(A)
else:
  print(B)

Submission status: Accepted

Solution code:
a,b,c,d=[int(x) for x in input().split()]
print(a*b) if a*b>=c*d else print(c*d)