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:
def main():
    a, b, c, d = map(int, input().split())
    ans = max(a*b, c*d)
    print(ans)


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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B,C,D = inputIL()

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

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

square1 = a * b
square2 = c * d

ans = 0
if square1 < square2:
    ans = square2
else:
    ans = square1

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())
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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

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

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 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 = (int(x) for x in 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())
if a*b>c*d:
  print(a*b)
else:
  print(c*d)

Submission status: Accepted

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

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

if __name__ == '__main__':

    ABC_52_A()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

    first_rectangle = a * b
    second_rectangle = c * d

    print(max(first_rectangle,second_rectangle))

if __name__ == '__main__':
    main()

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:
#!/usr/bin/env python3

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:
a, b, c, d = map(int, input().split())
print(a*b if a*b == c*d else 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 = [int(i) for i in input().split()]
print(max(a[0]*a[1],a[2]*a[3]))

Submission status: Accepted

Solution code:
import numpy as np
A, B, C, D = map(int, input().split())
S = np.array([A*B, C*D])
print(S.max())

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

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
print(max(e,f))

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

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())
a_b,c_d =a*b,c*d
if a_b==c_d:
    print(a_b)
else:
    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 resolve():
    A, B, C, D = list(map(int, input().split()))
    print(A*B if A*B > C*D else C*D)


if '__main__' == __name__:
    resolve()

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())
ans=max(a*b,c*d)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2020-04-29
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=map(int,input().split())
print(max([a*b,c*d]))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b,c,d=MI()
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(S2)
else:
    print(S1)

Submission status: Accepted

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

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

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())
n=a*b
m=c*d
p=[n,m]
p.sort()
print(p[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,s,d,f=map(int,input().split());print(max(a*s,d*f))

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

Submission status: Accepted

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

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())
s=A*B
t=C*D
if s==t:
    print(s)
else:
    print(max(s,t))

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

A=a*b
B=c*d

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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc052/tasks/abc052_a
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())

square_1 = a * b
square_2 = c * d

if square_1 >= square_2:
    print(square_1)
else:
    print(square_2)

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

Submission status: Accepted

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

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())
ab= a*b
cd= c*d

if ab ==cd:
    print(ab)
else:
    print(max(ab,cd))

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)
elif A*B==C*D:
    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:
x=list(map(int,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(max(a*b,c*d))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a, b, c, d = na()

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/A-TwoRectangles.py
#
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:
a,b,c,d=map(int,input().split())
print(a*b if a*b>=c*d else c*d)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    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 = map(int, input().split())
    S1 = A*B
    S2 = C*D

    if S1 > S2:
        print(S1)
    elif S1 < S2:
        print(S2)
    else:
        print(S1)
main()

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:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int, D: int):
    res = A*B if A*B > C*D else C*D
    print(res)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

S1 = a * b
S2 = c * d

print(S1 if S1 > S2 else S2)

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

Submission status: Accepted

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)
elif S2 > S1:
    print(S2)

Submission status: Accepted

Solution code:
n,m,k,j=map(int,input().split())
print(max(n*m,k*j))

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

input = sys.stdin.readline


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


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

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

Submission status: Accepted

Solution code:
b = list(map(int, input().split()))
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= list(map(int, input().split()))
print(max(a*b,c*d))

Submission status: Accepted

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

rec_a = A * B
rec_b = C * D

if rec_a >= rec_b:
    print(rec_a)
else :
    print(rec_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 = [int(i) for i in 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())

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

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:
li = list(map(int,input().split()))
rect_a = li[0]*li[1]
rect_b = li[2]*li[3]
if rect_a > rect_b:
    print(str(rect_a))
else:
    print(str(rect_b))

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

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)
elif A==B:
	print(A)

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

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:
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c, d = map(int, readline().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:
l = list(map(int,input().split()))
if l[0]*l[1] >= l[2]*l[3]:
  print(l[0]*l[1])
else:
  print(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, 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(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=list(map(int,input().split()))
print(a[0]*a[1] if a[0]*a[1]>=a[2]*a[3] else a[2]*a[3])

Submission status: Accepted

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

X = A * B
Y = C * D

if X == Y or X > Y:
    print(X)

elif X < Y:
    print(Y)

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
def main():
  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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, b, c, d = map(int, sys.stdin.readline().split())

def main():
    ans = max(a * b, c * d)
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 052: A – Two Rectangles
a, b, c, d = [int(x) for x in 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:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    maxnum = max(a[0]*a[1],a[2]*a[3])
    print(maxnum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 - Two Rectangles
# 標準入力の取得
A,B,C,D = list(map(int, input().split()))

# 結果出力
print(max(A*B, C*D))

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

Submission status: Accepted

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

#print(*ans, sep='\n')

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

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())  #複数数値入力　「A B」みたいなスペース空いた入力のとき


if A*B>C*D:
    print(A*B)
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,input().split())
print(max(A*B,C*D))

Submission status: Accepted

Solution code:
A,B,C,D=list(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,raw_input().split())
if a*b>c*d:
  print a*b
elif c*d>a*b:
  print c*d
elif c*d==a*b:
  print (c*d + a*b)/2

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 ab < cd:
  print(cd)
else:
  print(cd)

Submission status: Accepted

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

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

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    a,b,c,d=MI()
    print(max(a*b,c*d))
main()

Submission status: Accepted

Solution code:
#ABC052.A
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(c*d)
else: print(a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,b,c,d=MI()
    print(max(a*b,c*d))

main()

Submission status: Accepted

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

if k>=l:
  print(k)
else:
  print(l)

Submission status: Accepted

Solution code:
#abc052 a 
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:
  ans = a*b
else:
  ans = c*d
print(ans)

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)
else:
  print(c*d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, C, D = list(map(int, sys.stdin.readline().split()))
    print(max(A*B, C*D))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 =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
l = [S1, S2]
print(max(l))

Submission status: Accepted

Solution code:
import sys

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    a,b,c,d=list(map(int, readline().strip().split()))
    print(max(a*b,c*d))

    return


resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = list(map(int,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 = map(int, input().split())
if A*B >= C*D:
    print(A*B)
else:
    print(C*D)