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

Solution code:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

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

Submission status: Runtime Error

Solution code:
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:
A, B, C, D = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

areaAB = (A*B)
areaCD = (C*D)

if areaAB >= areaCD:
  print (areaAB)
  
else:
  print (areaCD)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

areaAB = (A*B)
areaCD = (C*D)

if areaAB == areaCD:
  print (areaAB)
  
if areaAB > areaCD:
  print (areaAB)

if areaCD > areaAB:
  print (areaCD)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

areaAB = A*B
areaCD = C*D

if areaAB == areaCD:
  print (areaAB)
  
if areaAB > areaCD:
  print (areaAB)

if areaCD > areaAB:
  print (areaCD)

Submission status: Runtime Error

Solution code:
mod = 1000000000 + 7
 
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
 
n = int(input())
dat = [0] * 2000 # 約数として求められたある数の合計
 
# N! の各要素の素因数分解をする
res = 1
for i in range(1, n + 1):
    d = factorization(i)
    for j in range(len(d)):
        dat[d[j][0]] += d[j][1]
 
for i in range(2, n + 1):
    res *= (dat[i] + 1)
    res %= mod
 
print(res)

Submission status: Runtime Error

Solution code:
A = input()
B = input()
C = input()
D = input()

volume1 = A * B
volume2 = C * D

if volume1 > volume2:
    print(volume1)
else:
    print(volume2)

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
x=0
ans=0
for i in range(n):
    if s[i]=="I":
        x += 1
    else:
        x -= 1
    ans = max(ans,x)
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
x=0
max=0
for i in range(n):
    if s[i]=="I":
        x += 1
    else:
        x -= 1
    max = max(max,x)
print(max)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A B C D = input()

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
 
def fetch_one_line():
    return stdin.readline().rstrip()
 
 
def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]
 
 
def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]
 
 
def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

sum = 0
change = {"I": 1, "D": -1}
length = int(fetch_one_line())
target = fetch_one_line()
records = [0 for _ in range(length)]

for i, t in enumerate(target):
	sum += change[t]
	records[i] = sum

max_val = max(records)
if max_val < 0:
    max_val = 0
print(max_val)

Submission status: Runtime Error

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

sum = 0
change = {"I": 1, "D": -1}
length = int(fetch_one_line())
target = fetch_one_line()
records = [0 for _ in range(length)]

for i, t in enumerate(target):
   sum += change[t]
   records[i] = sum

max_val = max(records)
if max_val < 0:
    max_val = 0
print(max_val)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

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 = (int(x) for x in input().split())
x = list(map(int,input().split()))
#print(x)
s = 0
for  i in range(n-1):
    l =  (x[i+1] - x[i])*A
    if l <= B:
        s = s +l
        print(s)
    else:
        s = s + B
print(s)

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()
a=0
b=0
for i in range(n-1):
  if s[i]=="I":
    a=a+1
    if a>b:
      b=a
  else:
    a=a-1
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math
import numpy as np
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: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

A, B, C, D = int(raw_input())
E = A*B-C*D

if E >= 0:
    print A*B
else:
    print C*D

Submission status: Runtime Error

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

A, B, C, D = int(raw_input())
E = A*B-C*D

if E >= 0:
    print A*B
else E < 0:
    print C*D

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
print(max(A*B, C*D))

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,open(0))
print(max([a*b,c*d]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input_n=input()
input_s=input()
tmp=0
x = 0
for i in input_s:
  if i == "I":
    x=x+1
  else:
    x=x-1
  tmp=max(tmp,x)

print(tmp)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
K = eval("*".join(map(str, list(range(1, N+1)))))
ans = 1
for i in range (2, N + 1):
    num = 0
    while K % i == 0:
        num += 1
        K //= i
    ans *= (num + 1)
print(ans % (10**9 + 7))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

x=int(a)*int(b)
y=int(c)*int(d)

if x>y:
    print(x)

elif x<y:
    print(y)

else:
    print(x)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define ll long long
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

using namespace std;

int main() {
  INIT;
  
  int a, b,c,d;
  cin >> a >> b >> c >> d;

  if(a*b > c*d){
    cout << a*b << endl;
  }else{
    cout << c*d << endl;
  }
  return 0;
}

Submission status: Runtime Error

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

Solution code:
# A,B,C,D = int(input()) for i in range(4)
A = int(input())
B = int(input())
C = int(input())
D = 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:
# A,B,C,D = int(input()) for i in range(4)
A = int(input())
B = int(input())
C = int(input())
D = int(input())
AB = A * B
CD = C * D

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

Submission status: Runtime Error

Solution code:
A,B,C,D = int(input()) for i in range(4)
AB = A * B
CD = C * D

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

s1 = a*b
s2 = c*d

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

Submission status: Runtime Error

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

s1 = a*b
s2 = c*d

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=input()
s=list(input())
x=0
l=[]
for i in s:
    if i=="I":
        x+=1
    elif i=="D":
        x-=1
    l.append(x)
print(max(l))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
S = str(input())
a = []
for i in range(N):
  b = S[0:i+1].count("I")
  c = S[0:i+1].count("D")
  M = b-c
  a.append(M)
print(max(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(max(int(input())*int(input()) for i in [1,1]))

Submission status: Runtime Error

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


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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
input()
tmp = x = 0
for a in input():
  x += int(a.replace('I','1').replace('D','-1'))
  if tmp < x:
    tmp = x

print(max([0,tmp]))

Submission status: Runtime Error

Solution code:
input()
tmp = x = 0
for a in input():
  x += int(a.replace('I','1').replace('D','-1'))
  if tmp < x:
    tmp = x

print(max([,tmp]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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:
a,b,c,d=[int(input())for i in[0]*4];print(max(a*b,c*d))

Submission status: Runtime Error

Solution code:
a,b = int(input()),input()
j,l=0,[0]
for i in b:
	if i == "I":
		j+=1
	else:
		j-=1
	l.append(j)
print(max(l))

Submission status: Runtime Error

Solution code:
a,b = int(input()),input()
j,l=0,[0]
for i in b:
	if i == "I":j+=1
	else:j-=1
	l.append(j)
print(max(l))

Submission status: Runtime Error

Solution code:
import math

prime = {}

N = int(input())

if N==1:
    print(1)
    exit()

isPrime = [True]*(N+1)
isPrime[0] = False
isPrime[1] = False
for i in range(2,int(math.sqrt(N))+2):
    if isPrime[i]:
        n = 2*i
        while n<=N:
            isPrime[n] = False
            n += i

for i in range(N+1):
    if isPrime[i]:
        prime[i] = 0

key_list = list(prime.keys())

for num in range(2,N+1):
    res = num
    idx = 0
    while res>1:
        k = key_list[idx]
        if res%k == 0:
            prime[k] += 1
            res = res//k
        else:
            idx += 1
    
ans = 1
for v in prime.values():
    ans *= (v+1) 
    ans = ans % (10**9+7)
    if ans==0:
        ans = 1
    
print(ans)

Submission status: Runtime Error

Solution code:
i = int(input())
s = input()
ans = 0

for x in range(len(s)) :
    if s[x] == "I" :
        ans += 1
    else :
        ans -= 1

print(ans)

Submission status: Runtime Error

Solution code:
i = int(input())
s = input()
ans = 0

for x in range(len(i)) :
    if s[x] == "I" :
        ans += 1
    else :
        ans -= 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.getrecursionlimit()
sys.setrecursionlimit(1000)

l = int(raw_input())

def factorial(l):
    if l == 0:
        return 1
    else:
        return l * factorial(l-1)
integ = factorial(l)
integ = integ
factors = []
i = 1

while(integ >= i):
    if (integ % i) == 0:
        factors.append(i)
    i+=1
print len(factors)
divisor = long(len(factors))
origin =long((10 ** 9) + 7)

Submission status: Runtime Error

Solution code:
inputted = int(raw_input())
l = list(raw_input())
x = 0
record = []
record.append(x)
for i in range(len(l)):
    if l[i] == "I":
        x+=1

    elif l[i] == "D":
        x-=1
    record.append(x)
print max(record)

Submission status: Runtime Error

Solution code:
a = input().spulit()
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: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    n = int(input())
    s = input()

    x, maxv = 0, 0
    for c in s:
        if c == 'I':
            x += 1
        elif c == 'D':
            x -= 1
        if x > maxv:
            maxv = x
    print(maxv)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
s = raw_input("Please enter your numbers: ")
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: Runtime Error

Solution code:
s = input()
a = s/1000 
b = s/100 -(s/1000)*10 
c = s/10 -(s/100)*10 
d = s - (s/10)*10

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()
b = input()
c = input()
d = input()
if a*b > c*d:
    print a*b
elif c*d > a*b:
    print c*d
else:
    print a*b

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, a, b = [int(x) for x in input().split(' ')]
dis = [a*int(x) for x in input().split(' ')]
dist = [dis[x+1] - dis[x] for x in range(n-1)]
out = 0
for j in dist:
    if j > b:
        out += b
    else:
        out += j
print(out)

Submission status: Runtime Error

Solution code:
#coding: shift_jis
N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N-1):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)

Submission status: Runtime Error

Solution code:
#coding: shift_jis


N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N-1):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
x = 0
max_x = 0
for c in S:
    if c == 'I': x += 1
    else: x -= 1
    max_x = max(max_x, x)
print(max_x)

Submission status: Runtime Error

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

import math

def main():
    T = 1000000007

    print(math.factorial(int(input())))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
#coding: UTF-8
N, A, B=map(int, input().split())
lis=list(map(int,input().split()))
#print(lis)
out=0
for i in range(0,N-1):
    d=lis[i+1]-lis[i]
    if d*A < (B-A):
        out=out+d*A
    else:
        out=out+B
print(out)

Submission status: Runtime Error

Solution code:
n,s=int(input()),input()
print(max([s[0:i].count('I')-s[0:i].count('D') for i in range(n)]))

Submission status: Runtime Error

Solution code:
import math
from sympy import divisor_count
N = int(input())
N = math.factorial(N)
mod = 10**9+7

print(divisor_count(N) % mod)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
pr = [True] * 1001
n = int(input())
ans = 1
MOD = 10 ** 9 + 7

for i in range(2, n + 1):
    if pr[i]:
        for j in range(i * 2, n + 1, i):
            pr[j] = False
        cnt = 0
        now = n
        while now:
            cnt += now // i
            now //= i
        ans = ans * (cnt + 1) % MOD

print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np


N,A,B = map(int,raw_input().split())

city = raw_input()

ci = city.split(" ")

path = []

for i in range(len(ci)-1):
    z = int(ci[i+1])-int(ci[i])
    path.append(z)

costa = []

def binary_encode(i, num_digits):
    return np.array([i >> d & 1 for d in range(num_digits)])

for i in range(2**len(path)):
    pc = binary_encode(i,len(path))
    cost =0
    for z in range(len(pc)):
        if pc[z] == 0:
            cost = cost + A *path[z]
        else:
            cost = cost + B

    costa.append(cost)

print min(costa)

Submission status: Runtime Error

Solution code:

import numpy as np


N,A,B = map(int,raw_input().split())

city = raw_input()

ci = city.split(" ")

path = []

for i in range(len(ci)-1):
    z = int(ci[i+1])-int(ci[i])
    path.append(z)

costa = []

def binary_encode(i, num_digits):
    return np.array([i >> d & 1 for d in range(num_digits)])

for i in range(2**len(path)):
    pc = binary_encode(i,len(path))
    cost =0
    for z in range(len(pc)):
        if pc[z] == 0:
            cost = cost + A *path[z]
        else:
            cost = cost + B

    costa.append(cost)

print min(costa)
~

Submission status: Runtime Error

Solution code:
# -*- coding:utf-8 -*-
import math
import sys

def mark(s, x):
    for i in range(x + x, len(s), x):
        s[i] = False

def sieve(n):
    s = [True] * n
    for x in range(2, int(n**0.5) + 1):
        if s[x]: mark(s, x)
    return [i for i in range(0,n) if s[i] and i > 1]

n = int(input())
p = sieve(n)
arr = [0]*len(p)
n = math.factorial(n)

for i in range(len(p)):
    flag = 1
    k = p[i]
    while flag:
        if n%k == 0:
            k = k*p[i]
            arr[i] += 1
        else:
            flag = 0

x = 1
for i in range(len(arr)):
    if arr[i] != 0:
        x *= (arr[i]+1)
if ( n = 6):
    print(4)
else:
    print(x%(10**9+7))

Submission status: Runtime Error

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

sum1=a*b
sum2=c*d

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

Submission status: Runtime Error

Solution code:
n = int(raw_input())
s = str(raw_input())
x = 0
xs = [x]
for si in s:
    if si == 'I': x += 1
    else: x -= 1
    xs.append(x)
print max(xs)

Submission status: Runtime Error

Solution code:
input()
S = input()
x = 0
max_x = 0
for elem in S:
	if elem == 'I':
		x += 1
	elif elem == 'D':
		x -= 1
	if x > max_x:
		max_x = x
print(max_x)

Submission status: Runtime Error

Solution code:
N=int(input())
div=1000000007

primedict= {i:True for i in range(2,N+1)}

for i in range(2,N+1):
        if primedict[i]==True:
                j=2
                while i*j<=N:
                        primedict[i*j]=False
                        j+=1

primelist = [i for i in  range(2,N+1) if primedict[i]==True]

# print(primelist)

primecntdict={p:0 for p in primelist}

for n in range(2,N+1):
        for p in [p for p in primelist if p <= n]:
                while n%p==0:
                        n/=p
                        primecntdict[p]+=1

res=1
for p in primelist:
        res*=primecntdict[p]+1
        res%=div
# print(primecntdict[2])
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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