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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#入力
lst = input().split()

#整数値化
for i in range(len(lst)):
   lst[i] = int(lst[i])

#各面積
area1 = lst[0] * lst[1]
area2 = lst[2] * lst[3]

#リストに格納してソート
areas = [area1, area2]
areas.sort()

#出力
print(areas[0])

Submission status: Wrong Answer

Solution code:
import sys
A,B,C,D = map(int,input().split())
if A > 10000 or B > 10000 or C > 10000 or D > 10000:
    sys.exit()
if A * B >= C * D:
    print(A*B)
if A * B <= C*D:
    print(C*D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


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

print(A*B,C*D)

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

S1 = int(A*B)
S2 = int(C*D)

if S1 >= S2:
    print(S1)

if S2 >= S1:
    print(S2)

Submission status: Wrong Answer

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(a*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

a, b, c, d= list(map(int, input().split()))
#a,b= list(input().split())
if a*b > c+d:
    print(a*b)
elif a*b < c*d:
    print(c*d)
else:
    print(a*b)

Submission status: Wrong Answer

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

a = lengthArray[0]*lengthArray[1]
b = lengthArray[2]*lengthArray[3]

if a<b:
  print(a)
else:
  print(b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if ab > cd:
    print(ab)
elif ab < cd:
    print(cd)

Submission status: Wrong Answer

Solution code:
#二つの長方形
#縦A、横B A*B
#縦C、横D C*D

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
def a(a,b,c,d):
    print(max(a*b, c*d))

Submission status: Wrong Answer

Solution code:
def a(a,b,c,d):
    if a*b > c*d:
        return a*b
    else:
        return c*d

Submission status: Wrong Answer

Solution code:
first=input()
(A, B, C, D)=first.split()
A=int(A)
B=int(B)
C=int(C)
D=int(D)
answer1=A*B
answer2=C*D
if (A*B)>(C*D):
  print(answer1)
elif (A*B)<(C*D):
  print(answer2)

Submission status: Wrong Answer

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

ans1 = a*b
ans2 = c*b

if ans1 > ans2:
    print(ans1)
elif ans1 < ans2:
    print(ans2)
else:
    print(ans1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def calculate(A,B,C,D):
  a1 = A * B
  a2 = C * D
  if a1 > a2:
    print(a1)
  elif a1 < a2:
    print(a2)
  else:
    print(a1)
    
calculate(2,3,4,5)

Submission status: Wrong Answer

Solution code:
def calculate(a,b,c,d):
  a1 = a * b
  a2 = c * d
  if a1 > a2:
    print(a1)
  elif a1 < a2:
    print(a2)
  else:
    print(a1)
    
calculate(2,3,4,5)

Submission status: Wrong Answer

Solution code:
def calculate(a,b,c,d):
  a1 = a * b
  a2 = c * d
  if a1 > a2:
    print(a1)
  elif a1 < a2:
    print(a2)
  else:
    print(a1)
    
print(calculate(2,3,4,5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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_1:
        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: Wrong Answer

Solution code:
A = 2
B = 6
C = 3
D = 5
if A * B > C * D:
  print(A*B)
elif A * B < C * D:
  print(C*D)
else:
  print(A*B)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
l = map(int, raw_input().split())
if (l[0] + l[1]) > (l[2] + l[3]):
    print (l[0] + l[1])
    exit()
else:
    print (l[2] + l[3])

Submission status: Wrong Answer

Solution code:
s = raw_input("Please enter your numbers: ").split()
p= int(s[0]) 
q= int(s[1])
r= int(s[2])
s= int(s[3])
def area(a,b,c, d):
    if a*b > c*d:
        print a*b
    elif c*d > a*b:
        print c*d
    else:
        print a*b
x = area(p,q,r,s)

Submission status: Wrong Answer

Solution code:
def area(a,b,c,d):
    if a*b > c*d:
        return a*b
    elif c*d > a*b:
        return c*d
    else:
        return a*b

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(1000000000+7)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

sum1=a*b
sum2=c*d

if sum1 > sum2:
    print(sum1)
elif sum1 < sum2:
    print(sum2)
else:
    print()

Submission status: Wrong Answer

Solution code:
import numpy as np

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

print A,B,C,D

a=A*B
c=C*D


if a<c:
    print c
else:
    print a

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A,B,C,D=map(int, readline().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(max(a*b,c*d))

Submission status: Accepted

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

Submission status: Accepted

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

rec1 = a * b
rec2 = c * d

if rec1 >= rec2:
    print(rec1)
else:
    print(rec2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    a, b, c, d = i_map()
    
    print(a*b if a*b >= c*d else c*d)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

obj1 = a*b
obj2 = c*d

if obj1 < obj2:
    ans = obj2
elif obj2 < obj1:
    ans = obj1
else:
    ans = obj1

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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(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 です。 この二つの長方形のうち、面積の大きい方の面積を出力してください。
# なお、二つの長方形の面積が等しい時は、その面積を出力してください。

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

x = A * B
y = C * D
if x > y:
    print(x)
elif x < y:
    print(y)
elif x == y:
    print(x)

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())

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())

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

Submission status: Accepted

Solution code:
# 1つ目　縦A、横B
# 2つ目　縦C、横D
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(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())



area_ab = A * B
area_cd = C * D

if area_ab > area_cd:
    print(area_ab)
else:
    print(area_cd)

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 = 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())

ab = A * B
cd = C * D

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

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(A * B)

Submission status: Accepted

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

def answer(A: int, B: int, C: int, D: int) -> int:
    return max(A * B, C * D)

print(answer(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())

rec1 = a * b
rec2 = c * d

if rec1 == rec2:
    print(rec1)
else:
    print(max(rec1, rec2))

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(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())

area1 = A * B
area2 = C * D

if area1 > area2:
    print(area1)
elif area1 < area2:
    print(area2)
else:
    print(area1)

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())
s1 = A * B
s2 = C * D

if s1 == s2:
    print(s1)
elif s1 > s2:
    print(s1)
else:
    print(s2)

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())

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

Submission status: Accepted

Solution code:
#ABC052A
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())

area = [A * B, C * D]

print(max(area))

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 y > x:
  print(y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S_list = iter(list(map(int,input().split())))
area = list()
for x,y in zip(S_list ,S_list):
    area.append(x*y)
print(max(area))

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())
area1 = a * b
area2 = c * d
if area1 >= area2:
  print(area1)
else:
  print(area2)

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 - Two Rectangles
# https://atcoder.jp/contests/abc052/tasks/abc052_a

square = list(map(int, input().split()))

result = [square[0] * square[1], square[2] * square[3]]
print(max(result))

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())

area1 = A * B
area2 = C * D

if area1 > area2 or area1 == area2:
    print(area1)
else:
    print(area2)

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
e=[]
f=a*b
g=c*d
e.append(f)
e.append(g)
if(f==g):
    print(f)
else:
    print(max(e))

Submission status: Accepted

Solution code:
'''
問題：
    二つの長方形があります。
    一つ目の長方形は、縦の辺の長さが A、横の辺の長さが B です。
    二つ目の長方形は、縦の辺の長さが C、横の辺の長さが D です。

    この二つの長方形のうち、面積の大きい方の面積を出力してください。 なお、二つの長方形の面積が等しい時は、その面積を出力してください。
'''

'''
制約：
    入力は全て整数である
    1 ≦ A ≦ 10000
    1 ≦ B ≦ 10000
    1 ≦ C ≦ 10000
    1 ≦ D ≦ 10000
'''

# 標準入力から A, B, C, D の値を取得する
a, b, c, d = map(int, input().split())

result = [a * b, c * d] # 結果格納用リスト
print(max(result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 052a

def atc_052a(input_value: str) -> int:
    A, B, C, D = map(int, input_value.split(" "))
    return max(A * B, C * D)

input_value = input()
print(atc_052a(input_value))

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())
print(max(A*B, C*D))

Submission status: Accepted

Solution code:
# 数値の取得
A,B,C,D = map(int,input().split())

# 面積の最大値を出力
AB = A * B
CD = C * D
print(max(AB,CD))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - Two Rectangles

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


if A * B >= C * D:
    answer = A * B
else:
    answer = C * D

print(answer)

Submission status: Accepted

Solution code:
vertical1, horizontal1, vertical2, horizontal2 = map(int, input().split())
area1 = vertical1 * horizontal1
area2 = vertical2 * horizontal2
if area1 < area2:
    print(area2)
else:
    print(area1)

Submission status: Accepted

Solution code:
vertical1, horizontal1, vertical2, horizontal2 = map(int, input().split())
if vertical1 * horizontal1 < vertical2 * horizontal2:
    print(vertical2 * horizontal2)
else:
    print(vertical1 * horizontal1)

Submission status: Accepted

Solution code:
# 面積の最大値を出力する

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

area = [A * B, C * D]

print(max(area))

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())
# 2つの面積をリスト化
area = [a*b,c*d]
# 面積のうち最大値を出力
print(max(area))

Submission status: Accepted

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

areaAB = A * B
areaCD = C * D

if areaAB == areaCD:
    result = areaAB
elif areaAB > areaCD:
    result = areaAB
else:
    result = areaCD

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#52
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())

# 二つの長方形があります。
# 一つ目の長方形は、縦の辺の長さが A、横の辺の長さが Bです。
# 二つ目の長方形は、縦の辺の長さが C、横の辺の長さが Dです。
# この二つの長方形のうち、面積の大きい方の面積を出力してください。
# なお、二つの長方形の面積が等しい時は、その面積を出力してください。

area_ab = A * B
area_cd = C * D

if area_ab > area_cd:
    print(area_ab)
else:
    print(area_cd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 052

# 1.値を正しく取得
a,b,c,d=(int(x) for x in input().split())

# 2.正しく処理

menseki1 = a * b
menseki2 = c * d

if menseki1 > menseki2:
    print(menseki1)

elif menseki1 < menseki2:
    print(menseki2)

else :
    print(menseki1)

Submission status: Accepted

Solution code:
# 052_a
A, B, C, D = map(int, input().split())
S1=A*B
S2=C*D

if (1<=A&A<=10**4)&(1<=B&B<=10**4)&(1<=C&C<=10**4)&(1<=D&D<=10**4):
    if S1>S2:
        print(S1)
    elif S1<=S2:
        print(S2)

Submission status: Accepted

Solution code:
rectangle1_scale1, rectangle1_scale2, rectangle2_scale1, rectangle2_scale2 = map(int, input().split())

big_rectangle_area = max(rectangle1_scale1 * rectangle1_scale2, rectangle2_scale1 * rectangle2_scale2)

print(big_rectangle_area)

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())

S1 = A * B
S2 = C * D

print(max(S1, S2))

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    A, B, C, D = map(int, readline().split())

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


if __name__ == '__main__':
    main()

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())
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
list = [x, y]
print(max(list))

Submission status: Accepted

Solution code:
height_a, length_a, height_b, length_b = map(int, input().split())

rectangle_a = height_a * length_a
rectangle_b = height_b * length_b

if rectangle_a == rectangle_b:
    print(rectangle_a)
elif rectangle_a > rectangle_b:
    print(rectangle_a)
elif rectangle_b > rectangle_a:
    print(rectangle_b)

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:
A, B, C, D = map(int, input().split())

a = A * B
b = C * D
c = [a, b]
print(max(c))

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 if a*b<c*d else 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=list(map(int,input().split()))

b=a[0]*a[1]
c=a[2]*a[3]

if b-c>0:
  print(b)

else:
  print(c)

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 = [int(i) for i in 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())

one = a * b
two = c * d

print(*max([one],[two]))

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 = [int(s) for s in 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)
elif a < b:
    print(b)
else:
    print(a)

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(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:

def main():
    t = list(map(int, input().split()))
    print(max(t[0]*t[1],t[2]*t[3]))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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(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 area2 >= area1:
    print(area2)

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=input().split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)
if (a*b>=c*d):
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

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

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, raw_input().split())
print max(a*b, c*d)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
A, B, C, D = map(int, input().split())
a = A * B
b = C * D
print(max(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 - Two Rectangles
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 = (int(T) for T 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, 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 = 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())
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
if s1 > s2:
  print(s1)
else:
  print(s2)

Submission status: Accepted

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

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:
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=(int(x) for x in input().split())
e= a * b
f= c * d
if e < f : 
    print( f )
elif e > f :
    print( e )
elif e == f :
    print( e )

Submission status: Accepted

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

Submission status: Accepted

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

t1 = a*b
t2 = c*d
print(max(t1, t2))

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(a*b) if (a*b) > (c*d) else print(c*d)

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

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