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:

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = input()

y = x.split(" ")

if int(y[0]) * int(y[1]) > int(y[2]) * int(y[3]):
    print(int(y[0]) * int(y[1]))
elif int(y[0]) * int(y[1]) < int(y[2]) * int(y[3]):
    print(int(y[2]) * int(y[3]))
elif int(y[0]) * int(y[1]) == int(y[2]) * int(y[3]):
    print(int(y[2]) * int(y[3]))

Submission status: Accepted

Solution code:
a,b,c,d=map(lambda x: int(x), input().split())
print(max(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 F > E:
  print(F)
else:
  print(E)

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

Submission status: Accepted

Solution code:
import collections
import itertools
import functools
import math

if __name__ == "__main__":
    a, b, c, d = map(int, input().split())
    print(a * b if a * b >= c * d else c * d)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = map(int, input().split())

ans_ab = a * b
ans_cd = c * d

if ans_ab > ans_cd:
    print(ans_ab)
elif ans_ab < ans_cd:
    print(ans_cd)
else:
    print(ans_ab)

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

Submission status: Accepted

Solution code:
import sys

s = input().split()

s1=1
s2=1

for i in range(0,2):
    s1*=int(s[i])
    s2*=int(s[i+2])

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

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 = 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())
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())
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,d*c))

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    a, b, c, d = list(map(int, input().rstrip('\n').split()))
    print(max(a * b, c * d))


if __name__ == '__main__':
    slove()

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())
    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:
# -*- 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 = (int(x) for x in input().split())
print(max(a*b, c*d))

Submission status: Accepted

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

s1 = int(A) * int(B)
s2 = int(C) * int(D)

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

Submission status: Accepted

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

areaone = a[0]*a[1]
areatwo = a[2]*a[3]

if areaone == areatwo:
    print(areatwo)
else:
    print(max(areatwo,areaone))

Submission status: Accepted

Solution code:
#2019/09/26
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())
result = max(a*b, c*d)
print(result)

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

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a,b,c,d = INTM()
    print(max(a*b,c*d))
if __name__ == '__main__':
    do()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    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())
ab = a * b
cd = c * d

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

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

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

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=list(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:
import sys
input = sys.stdin.readline

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:
# -*- 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:
# -*- coding: utf-8 -*-

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

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

print(ans)

Submission status: Accepted

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

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

sq = [a * b, c * d]

if sq[0] > sq[1]:
    ans = sq[0]
else:
    ans = sq[1]

print(ans)

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

Submission status: Accepted

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

Solution code:
height1, horizontal1, height2, horizontal2 = map(int, input().split())

ans = max(height1 * horizontal1, height2 * horizontal2)
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 = list(map(int,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:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
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(int(c*d))
else:
  print(int(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)
elif a*b<c*d:
  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:
N = input().split()
A, B, C, D = int(N[0]), int(N[1]), int(N[2]), int(N[3])
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:
def cal(h1,w1,h2,w2):
    S1=h1*w1
    S2=h2*w2
    if S1>=S2:
        return S1
    else:
        return S2

h1,w1,h2,w2=map(int,input().split(" "))
print(cal(h1,w1,h2,w2))

Submission status: Accepted

Solution code:
a = [int(_) for _ in input().split()]
if all(1 <= i <= 10 ** 4 for i in a):
    print(max(a[0] * a[1], a[2] * a[3]))
else:
    print('hoge!')

Submission status: Accepted

Solution code:
import sys
import copy
import string
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

if __name__ == '__main__':
    print(main())

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

x = a*b
y = c*d

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

Submission status: Accepted

Solution code:
A,B,C,D = (int(i) for i in 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())
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())

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().strip().split(' '))
print(max(A*B, 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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

A, B, C, D = MAP()

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

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=map(int,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(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:
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)
elif S1< S2:
    print(S2)
else:
    print(S1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    A,B,C,D = inputMap()
    tmp = A*B
    tmp2 = C*D
    print(max(tmp,tmp2))
    
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

ans = max(A * B, C * D)
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:
import sys
sys.setrecursionlimit(10**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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

from functools import lru_cache


def main(): 
    a,b,c,d  = LI()

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

main()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
r = max(A*B, C*D)
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:
l = list(map(int, input().split()))
print(max([i*j for i, j in zip(l[::2], l[1::2])]))

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:
def test():
    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)


if __name__ == "__main__":
    test()

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

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
A = li[0]
B = li[1]
C = li[2]
D = li[3]

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:
#!/usr/bin/env python
s = raw_input()
array_num = [ int(each_num) for each_num in s.split()]
first_area = array_num[0] * array_num[1]
second_area = array_num[2] * array_num[3] 
if first_area > second_area:
	print(first_area)
elif first_area < second_area:
	print(second_area)
else:
	print(first_area)

Submission status: Accepted

Solution code:
def main():
    a,b,c,d = map(int,input().split())	
    
    print(max(a*b,c*d))
        
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:
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:
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(A*B if A*B > C*D else C*D)

Submission status: Accepted

Solution code:
a , b , c , d = input().split()
ab = int(a) * int(b)
cd = int(c) * int(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:
N = list(map(int, input().split()))
s1 = N[0] * N[1]
s2 = N[2] * N[3]
print(max(s1, 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())
x = a*b
y = c*d
print(max(x, y))

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:
#52

A, B, C, D = map(int, input().rstrip().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(A*B if A*B > C*D else C*D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

N1 = A*B
N2 = C*D

if N1 > N2:
  Ans=N1
else:
  Ans=N2

print(Ans)

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:
import sys
input = sys.stdin.readline

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

R1 = A*B
R2 = C*D
print(max(R1, R2))

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
A,B,C,D = [int(i) for i in input().split()]

if A * B == C * D:
    print(A * B)
elif A * B > C * D:
    print(A * B)
elif A * B < C * D:
    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().rstrip().split())
t1 = a*b
t2 = c*d

if t1 > t2 or t1 == t2:
    print(t1)
else:
    print(t2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

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:
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=[int(x) for x in input().split()]
print(max(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:
#n = int(input())
#a = int(input())
#ls = list(input().split(" "))
#ls = list(map(int,input().split(" ")))
a,b,c,d = list(map(int,input().split(" ")))
#a,b,c = list(input().split())
#string = input()

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:

from collections import defaultdict
import sys

def soinsuu(soinsuu_dic, num):
    for i in range(2, int(num ** 0.5) + 1):
        while num % i == 0:
            num //= i
            soinsuu_dic[i] += 1
    if num > 1:
        soinsuu_dic[num] += 1
    return soinsuu_dic

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:
def larger(x, y):
	if x > y:
		return x
	return y

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

Submission status: Accepted

Solution code:
s = input()
s = s.split(" ")
nums = list(map(int,s))

first = nums[0] * nums[1]
second = nums[2] * nums[3]

print(first if first >= second else second)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a, b, c, d = MAP()
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int, C: int, D: int):
    ret = max(A * B, C * D)
    print(ret)
    return


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
lines = sys.stdin.readlines()
for linea in lines:
    c = linea.split()
    c = list(map(int,c))
list(c)
x = c[0]*c[1]
v =c[2]*c[3]
if x>v:
  print(x)
if x<v:
  print(v)
if x==v:
  print(x)

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