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

Submission status: Accepted

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: 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([a*b,c*d][c*d>a*b])

Submission status: Accepted

Solution code:
import sys
a, b, c, d = map(int, sys.stdin.readline().split())
print(max(a*b, c*d))

Submission status: Accepted

Solution code:
print(max(x*y for x,y in zip(*[iter(map(int,input().split()))]*2)))

Submission status: Accepted

Solution code:
n = input().split()
m = list(map(int,n))
a = m[0] * m[1]
b = m[2] * m[3]
if 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)
else:
	print(C * D)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

A = ls[0] * ls[1]
B = ls[2] * ls[3]

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = raw_input().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: Accepted

Solution code:
A ,B ,C, D = [int(x) for x in input().strip().split(' ')]
r1 ,r2  =A*B, C*D
if (r1 > r2):
    print(r1)
elif(r2 >r1):
    print(r2)
else:
    print(r1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, raw_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(A * B)
else:
    print(C * D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
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())
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 inint(): return int(input())
def inlint(): return list(map(int, input().split()))
def infloat(): return float(input())
def inlffloat(): return list(map(float, input().split()))
def inl(): return list(input())
def putlint(): return "".join(list(map(str, ans)))

a,b,c,d = inlint()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



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

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

if __name__ == "__main__": main()

Submission status: Accepted

Solution code:
input_line = map(int,raw_input().split(" "))
a = input_line[0]
b = input_line[1]
c = input_line[2]
d = input_line[3]
m1 = a * b
m2 = c * d
if m1 >= m2:
	print m1
else:
	print m2

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, 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:
s = input()
x = s.split()
y = [0,0,0,0]
i = 0
for v in x:
    y[i] = int(v)
    i = i + 1
a1 = y[0] * y[1]
a2 = y[2] * y[3]
if a1 >= a2:
    print(a1)
else:
    print(a2)

Submission status: Accepted

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

if A*B>C*D:
    print(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:
from collections import defaultdict


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())
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, raw_input().split())

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

Submission status: Accepted

Solution code:
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def ris(): return list(input())
def pli(a): return "".join(list(map(str, a)))

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

Submission status: Accepted

Solution code:
import sys

# sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


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


main()

Submission status: Accepted

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

s1 = A*B
s2 = C*D

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

Submission status: Accepted

Solution code:
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, raw_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 = input().split()
for i in range(len(a)):
    a[i] = int(a[i])
    
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:
l = list(map(int, input().split()))

A = l[0] * l[1]
B = l[2] * l[3]
print( A if (A >= B) else B)

Submission status: Accepted

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

import os
import sys

class Main(object):

    def __init__(self):
        pass

    def some_method(self):
        a, b, c, d = map(int, input().split())
        one = a * b
        another = c * d
        print(max(one, another))
        return None

if __name__ == '__main__':
    m = Main()
    m.some_method()

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    A,B,C,D = map(int, input().split())
    res1 = A * B
    res2 = C * D
    print (max(res1, res2))

Submission status: Accepted

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


print max(a*b, c*d)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

j = a * b
k = c * d


print(max(j, k))

Submission status: Accepted

Solution code:
#coding: shift_jis

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

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

Submission status: Accepted

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

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[2]*a[3]

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

if a*b > c*d:
    s = a * b
else:
    s = c * d

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, C, D = map(int, raw_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("%d" % (a*b))
else:
    print("%d" % (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:
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 = list(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 (c*d)
else : print (a*b)

Submission status: Accepted

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

# A, B, C, Dの入力
a, b, c, d = map(int, input().split())
s_1 = a * b     # 面積1(AとB)
s_2 = c * d     # 面積2(CとD)

if s_1 >= s_2:
    print(s_1)
else:
    print(s_2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i = A * B
j = C * D

if i == j:
	print(i)
elif i > j:
	print(i)
elif i < j:
	print(j)

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x1 = l[0]*l[1]
x2 = l[2]*l[3]

print max(x1,x2)

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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()


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


print(main())

Submission status: Accepted

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

Submission status: Accepted

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


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,raw_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,raw_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:
import math

l = map(int, raw_input().split())

A = l[0]
B = l[1]
C = l[2]
D = l[3]

if A*B < C*D:
    print("{}".format(C*D))
else:
    print("{}".format(A*B))

Submission status: Accepted

Solution code:
#coding: UTF-8
A, B, C, D = map(int, input().split())
a1 = A*B
a2 = C*D
if a1 >= a2:
    print(a1)
else:
    print(a2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/bin/python
# coding: utf-8

li = list(map(int,input().split()))
def area(x,y):
    return x * y
 
A = area(li[0],li[1])
B = area(li[2],li[3])

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

Submission status: Accepted

Solution code:
inp = input()
a, b, c, d = inp.split(' ')

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B,C,D= map(int, raw_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,raw_input().split())
print max(a*b,c*d)

Submission status: Accepted

Solution code:
def read(): return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
#ARC052A

a,b,c,d=map(int,raw_input().split())
s1=a*b
s2=c*d
print max(s1,s2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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,raw_input().split())
if (a*b)==(c*d):
	print a*b
else:
	print ((c*d),(a*b))[(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:
i = list(map(int,input().split()))
a = i[0]
b = i[1]
c = i[2]
d = i[3]
if a * b > c * d:
    print(a*b)
else:
    print(c*d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def area(height, width) :
    return height * width

if area(a,b) >= area(c,d) :
    larger = area(a, b)
else :
    larger = area(c, d)

print(larger)

Submission status: Accepted

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

Submission status: Accepted

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

ab = s[0] * s[1]

cd = s[2] * s[3]

if ab >= cd:
	ans = ab
else:
	ans = cd

print(ans)

Submission status: Accepted

Solution code:
[a, b, c, d] = list(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())
x = a*b
y = c*d

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

Submission status: Accepted

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

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

print(max(s1, s2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/python3

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

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

Submission status: Accepted

Solution code:
import numpy as np

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


a=A*B
c=C*D


if a<c:
    print c
else:
    print a

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: UTF-8 -*-

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    Main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int, raw_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()]
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 c * d)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

r1 = a * b
r2 = c * d

if r1 > r2:
    print r1
else:
    print 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)
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())

first = a*b
second = c*d

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

print(ans)

Submission status: Runtime Error

Solution code:
a,b=[input() for i in range(2)]
p=0
ans=0

for i in b:
  if i =='I':
    p+=1
  elif i =='D' and p>0:
    p-=1
  else:
    p-=1
  
  if ans<p:
    ans=p
 
print(ans)

Submission status: Runtime Error

Solution code:
S1 = int(input())
S2 = int(input())

if S1 > S2:
    print(S1)
elif S1 == S2:
    print(S1 * S2)
else:
    print(S2)

Submission status: Runtime Error

Solution code:
a, b, c, d = 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: Runtime Error

Solution code:
def main():
    with open('../param.txt') as f:
        line_list = f.read().split()
    A = int(line_list[0])*int(line_list[1])
    B = int(line_list[2])*int(line_list[3])
    if A > B:
        print(A)
    elif A < B:
        print(B)
    else:
        print(A)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
#52
A=int(input())
B=int(input())
C=int(input())
D=int(input())
if A*B>c*D:
    print(A*B)
else:
    print(C*D)

Submission status: Runtime Error

Solution code:
# 052

# 1.値を正しく取得
A = int(input())
B = int(input())
C = int(input())
D = int(input())

# 2.正しく処理

menseki1 = A * B
print(menseki1)
menseki2 = C * D
print(menseki2)

if menseki1 > menseki2:
    print(menseki1)

elif menseki1 < menseki2:
    print(menseki2)

else :
    print(menseki1)

Submission status: Runtime Error

Solution code:
# 052

# 1.値を正しく取得
x1 = int(input())
y1 = int(input())
x2 = int(input())
y2 = int(input())

# 2.正しく処理

menseki1 = x1 * y1
print(menseki1)
menseki2 = x2 * y2
print(menseki2)

if menseki1 > menseki2:
    print(menseki1)

elif menseki1 < menseki2:
    print(menseki2)

else :
    print(menseki1)

Submission status: Runtime Error

Solution code:
#052

#1.値を正しく取得
x1=int(input())
y1=int(input())
x2=int(input())
y2=int(input())

#2.正しく処理

menseki1 = x1 * y1
menseki2 = x2 * y2

if menseki1 >=menseki2  :
  print(menseki1)
  
else :
  print(menseki2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

b = a[0]*a[1] 
c = a[2]*a[3]
A = [b, c]
print(max(A))

Submission status: Runtime Error

Solution code:
A, B, C, D = MI()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S1 = int(A)*int(B)
s2 = int(C)*int(D)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,a,b = map(int, input().split())
x = [int(x) for x in input().split(' ')]

mp = 0
for i in range(n-1):
    mp += min(a*(x[i+1]-x[i]), b)
    
print(mp)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print("A{}C".format("B"if int(input())<1200else"R"))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = str(input())

max = 0
x = 0

for i in range(N):
    if S[i] == 'I':
        x += 1
    else:
        x -= 1
    if x > max:
        max = x

print(max)

Submission status: Runtime Error

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)
else:
    return 0
if S2 >= S1:
    print(S2)
else:
    return 0

Submission status: Runtime Error

Solution code:
import itertools

n = int(input())
s = list(input())
s1 = [1 if s[i] == 'I' else -1 for i in range(n)]
cumsum = list(itertools.accumulate(s1))
print(s1)
print(cumsum)
ans = max(cumsum)
print(max(ans, 0))

Submission status: Runtime Error

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: Runtime Error

Solution code:
A,B,C,D=list(map(int,input()))
ab=A*B
cd=C*D
if ab>cd:print(ab)
elif cd>ab:print(cd)
else:print(ab)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
if A * B > C * D:
    print(A*B)

else:
    print(C*D)

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main(void){
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    cout<<max(a*b,c*d)<<endl;
}

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())

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

Submission status: Runtime Error

Solution code:
n=int(input())
array=[]
for i in range(2,n+1):
    s=i
    while s!=1:
        turn=0
        for j in range(2,s+1):
            if s%j==0:
                s=s//j
                array.append(j)
                break
ans=1
import collections
c=collections.Counter(array)
l=list(c.values())
print(l)
for i in range(len(l)):
    ans*=l[i]+1
print(ans%(10**9+7))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
x = 800*N - ((N//15)*200)

print (x)