Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
Ls = map(int, input().split())

sum = 0

for i in range(N):
    sum += Ls[i]

if max(Ls)*2 < sum:
    print("Yes")
else:
    print("No")
    

Fixed submission:
N = int(input())
Ls = list(map(int, input().split()))

sum = 0

for i in range(N):
    sum += Ls[i]

if max(Ls)*2 < sum:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s = str(input())
ans = ""
for i in range(len(s)):
    if s[i] == 1:
        ans += 9
    else:
        ans += 1
print(ans)


Fixed submission:
s = list(str(input()))
ans = ""
for i in range(3):
    if s[i] == "1":
        ans = ans + "9"
    else:
        ans = ans + "1"
print(ans)

Buggy python submission (verdict: Runtime Error):
s = str(input())
for i in range(len(s)):
    if s[i] == 1:
        s[i] = 9
    else:
        s[i] = 1
print(s)

Fixed submission:
s = list(str(input()))
ans = ""
for i in range(3):
    if s[i] == "1":
        ans = ans + "9"
    else:
        ans = ans + "1"
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = list(str(N))
S = 0
for i in range(len(s)):
    S += s[i]

if N % S == 0:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())
s = list(str(N))
S = 0
for i in range(len(s)):
    S += int(s[i])

if N % S == 0:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = str(input())
N = int(s)
S = sum(list(s))
if N % S == 0:
    print("Yes")
else:
    print("No")


Fixed submission:
N = int(input())
s = list(str(N))
S = 0
for i in range(len(s)):
    S += int(s[i])

if N % S == 0:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = str(input())
N = int(S)
S = sum(list(s))
if N % S == 0:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())
s = list(str(N))
S = 0
for i in range(len(s)):
    S += int(s[i])

if N % S == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
D, N = map(int, input().split())

lst = []
X = "00" ** D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])


Fixed submission:
D, N = map(int, input().split())

lst = []
X = "00" * D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])

Buggy python submission (verdict: Runtime Error):
D, N = map(int, input().split())

lst = []
X = 100 ** D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])

Fixed submission:
D, N = map(int, input().split())

lst = []
X = "00" * D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])

Buggy python submission (verdict: Runtime Error):
D, N = map(int, input().split())

lst = []
X = 100 ** D

for i in range(1,101):
    if i % X == 0:
        pass
    else:
        lst.append(i*X)

print(lst[N-1])


Fixed submission:
D, N = map(int, input().split())

lst = []
X = "00" * D

for i in range(1,102):
    if i % 100 == 0:
        pass
    else:
        lst.append(str(i) + X)

print(lst[N-1])
Buggy python submission (verdict: Runtime Error):
a, b = int(input())
X = b - a
ans = 0
for i in range(X):
    ans += i
print(ans)

Fixed submission:
a, b = map(int, input().split())
X = b - a
ans = 0
for i in range(X):
    ans += i
print(ans-a)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())

ans_lst = [float("inf")]*(N)
for i in range(0,N):
    ans_lst[i] = S[:i].count("W") + S[i+1:].count("E")
ans = min(ans_lst)
print(ans)


Fixed submission:
N = int(input())
S = list(input())

lst = [0]*N
Re = S.count("E")
Lw = 0

for i in range(N):
    if S[i] == "E":
        Re -= 1
        lst[i] = Re + Lw
    else:
        Lw += 1
        lst[i] = Re + Lw - 1

ans = min(lst)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())

ans_lst = [float("inf")]*(N)
for i in range(0,N):
    ans_lst[i] = S[:i].count("W") + S[i+1:].count("E")
ans = min(ans_lst)
print(ans)

Fixed submission:
N = int(input())
S = list(input())

lst = [0]*N
Re = S.count("E")
Lw = 0

for i in range(N):
    if S[i] == "E":
        Re -= 1
        lst[i] = Re + Lw
    else:
        Lw += 1
        lst[i] = Re + Lw - 1

ans = min(lst)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import copy
N = int(input())
X = list(map(int, input().split()))
Y = sorted(X)

first_harf = Y[:int(N/2)]
second_harf = Y[int(N/2):]

for i in range(N):
    if X[i] in first_harf:
        print(second_harf[0])
    else:
        print(first_harf[-1])


Fixed submission:
import copy
N = int(input())
X = list(map(int, input().split()))
Y = sorted(X)

first_harf = Y[:int(N/2)]
second_harf = Y[int(N/2):]

for i in range(N):
    if X[i] <= first_harf[-1]:
        print(second_harf[0])
    else:
        print(first_harf[-1])

Buggy python submission (verdict: Time Limit Exceeded):
import copy
N = int(input())
X = list(map(int, input().split()))
Y = sorted(X)

first_harf = Y[:int(N/2)]
second_harf = Y[int(N/2):]

for i in range(N):
    if X[i] in first_harf:
        print(second_harf[0])
    else:
        print(first_harf[-1])


Fixed submission:
import copy
N = int(input())
X = list(map(int, input().split()))
Y = sorted(X)

first_harf = Y[:int(N/2)]
second_harf = Y[int(N/2):]

for i in range(N):
    if X[i] <= first_harf[-1]:
        print(second_harf[0])
    else:
        print(first_harf[-1])

Buggy python submission (verdict: Time Limit Exceeded):
import copy
N = int(input())
X = list(map(int, input().split()))

for i in range(N):
    Y = copy.copy(X)
    del Y[i]
    Y = sorted(Y)
    print(Y[int(N/2)-1])

Fixed submission:
import copy
N = int(input())
X = list(map(int, input().split()))
Y = sorted(X)

first_harf = Y[:int(N/2)]
second_harf = Y[int(N/2):]

for i in range(N):
    if X[i] <= first_harf[-1]:
        print(second_harf[0])
    else:
        print(first_harf[-1])
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())

NM = [[0]*(M+2) for _ in range(N+2)]

for i in range(1,N+1):
    for j in range(1,M+1):
        NM[i-1][j-1] = ~NM[i-1][j-1]
        NM[i-1][j-0] = ~NM[i-1][j-0]
        NM[i-1][j+1] = ~NM[i-1][j+1]
        NM[i-0][j-1] = ~NM[i-0][j-1]
        NM[i-0][j-0] = ~NM[i-0][j-0]
        NM[i-0][j+1] = ~NM[i-0][j+1]
        NM[i+1][j-1] = ~NM[i+1][j-1]
        NM[i+1][j-0] = ~NM[i+1][j-0]
        NM[i+1][j+1] = ~NM[i+1][j+1]

print(NM)

ans = 0
for k in range(1,N+1):
    ans += sum(NM[k][1:M+1])

print(-1*ans)


Fixed submission:
N, M = map(int, input().split())

ans = 0
if N == 1 and M == 1:
    ans = 1
elif N == 1 and M > 1:
    ans = M-2
elif N > 1 and M == 1:
    ans = N-2
else:
    ans = (N-2)*(M-2)

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list(map(int, input().split()))

if "Y" in S:
    print("Four")
else:
    print("Three")


Fixed submission:
N = int(input())
S = list(map(str, input().split()))

if "Y" in S:
    print("Four")
else:
    print("Three")
Buggy python submission (verdict: Runtime Error):
a, b = map(str, input().split())
res = int(a+b)
ans = "No"
for i in range(res**0.5):
    if i**2 == res:
        ans = "Yes"
        break
print(ans)

Fixed submission:
a, b = map(str, input().split())
res = int(a+b)
ans = "No"
for i in range(int(res**0.5)+1):
    if i**2 == res:
        ans = "Yes"
        break
print(ans)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
S = list(map(str, input().split(-)))
ans = "No"
if A == len(S[0]):
    if B == len(S[1]):
        ans = "Yes"
print(ans)


Fixed submission:
A, B = map(int, input().split())
S = list(map(str, input().split("-")))
ans = "No"
if A == len(S[0]):
    if B == len(S[1]):
        ans = "Yes"
print(ans)

Buggy python submission (verdict: Runtime Error):
AB = map(int, input().split())
S = list(map(str, input().split(-)))
ans = "No"
if AB[0] == len(S[0]):
    if AB[1] == len(S[1]):
        ans = "Yes"
print(ans)

Fixed submission:
A, B = map(int, input().split())
S = list(map(str, input().split("-")))
ans = "No"
if A == len(S[0]):
    if B == len(S[1]):
        ans = "Yes"
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))

cnt = 0

for i in range(N):
    if len(A) > K:
        min_k = min(A, key=A.get)
        cnt += A[min_k]
        A.pop(min_k)
    else:
        break

print(cnt)


Fixed submission:
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))
A = sorted(A.items(), key=lambda x: x[1], reverse=True)

cnt = 0

for i in range(N):
    if len(A) > K:
        cnt += A[-1][1]
        A.pop()
    else:
        break

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))

cnt = 0

while len(A) > K:
    min_k = min(A, key=A.get)
    cnt += A[min_k]
    A.pop(min_k)

print(cnt)


Fixed submission:
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))
A = sorted(A.items(), key=lambda x: x[1], reverse=True)

cnt = 0

for i in range(N):
    if len(A) > K:
        cnt += A[-1][1]
        A.pop()
    else:
        break

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))

cnt = 0

while len(A) > K:
    min_k = min(A, key=A.get)
    cnt += A[min_k]
    A.pop(min_k)

print(cnt)

Fixed submission:
import collections

N, K = map(int, input().split())
A = list(map(int, input().split()))
A = dict(collections.Counter(A))
A = sorted(A.items(), key=lambda x: x[1], reverse=True)

cnt = 0

for i in range(N):
    if len(A) > K:
        cnt += A[-1][1]
        A.pop()
    else:
        break

print(cnt)
Buggy python submission (verdict: Runtime Error):
n = list(input())
N = int(sum(n))
M = 0
for i in range(len(n)):
    M += int(n[i])
if N % M == 0:
    print("Yes")
else:
    print("No") 

Fixed submission:
n = list(input())
N = ""
M = 0

for i in range(len(n)):
    N += n[i]
    M += int(n[i])

N = int(N)

if N % M == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())


while N > i**2:
    i += 1

print((i-1)**2)

Fixed submission:
N = int(input())

ans = 1
for i in range(N):
    if i**2 > N:
        ans = (i-1)**2
        break

print(ans)
Buggy python submission (verdict: Runtime Error):
S = list(input())
lst = [chr(i) for i in range(97, 97+26)]
res = sorted(list(set(lst) - set(S)))

if res = []:
    print("None")
else:
    print(res[0])


Fixed submission:
S = list(input())
lst = [chr(i) for i in range(97, 97+26)]
res = sorted(list(set(lst) - set(S)))

if res == []:
    print("None")
else:
    print(res[0])
Buggy python submission (verdict: Time Limit Exceeded):
# C - pushpush
N = int(input())
a = list(map(int,input().split()))

S = sum(a)
lst = [0]*N
x = 0
y = 0

for i in range(N):
    x = sum(a[0:i])
    y = S - x
    lst[i] = abs(x-y)
lst.pop(0)

ans = min(lst)
print(ans)


Fixed submission:
# C - Splitting Pile
N = int(input())
a = list(map(int,input().split()))

lst = [0]*(N-1)
x = [a[0]]*(N-1)
y = [sum(a)-a[0]]*(N-1)
lst[0] = abs(x[0]-y[0])

for i in range(1,N-1):
    x[i] = x[i-1]+a[i] 
    y[i] = y[i-1]-a[i]
    lst[i] = abs(x[i]-y[i])
"""
print(x)
print(y)
print(lst)
"""
ans = min(lst)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# C - pushpush
n = int(input())
a = list(map(str,input().split()))

b = []

for i in range(n):
    ref = a.pop(0)
    b.append(ref)
    b = list(reversed(b))

ans = " ".join(b)
print(ans)


Fixed submission:
# C - pushpush
n = int(input())
a = list(map(str,input().split()))

b = [""]*n
var = 0

if n % 2 == 0:
    for i in range(n):
        res = a[i]
        var += i*(-1)**i
        ind = n//2 + var
        b[ind] = res
else:
    for i in range(n):
        res = a[i]
        var += i*(-1)**i
        ind = n//2 - var
        b[ind] = res

ans = " ".join(b)
print(ans)
Buggy python submission (verdict: Runtime Error):
# ABC065_B
N = int(input())
A = [int(input()) for _ in range(N)]
next = A[0]
ans = -1
cnt = 0
for i in range(N):
    next = A[next]
    cnt += 1
    if next == 2:
        ans = cnt
        break
print(ans)

Fixed submission:
# ABC065_B
N = int(input())
A = [int(input()) for _ in range(N)]

now = 0
cnt = 0
while now != 1:
    now = A[now] - 1
    cnt += 1
    if cnt > N:
        cnt = -1
        break
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
# C - Reconciled?
N, M = map(int,input().split())

S = 1
for i in range(1,min(N,M)+1):
    S *= i % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)


Fixed submission:
# C - Reconciled?
import math
N, M = map(int,input().split())

S = math.factorial(min(N,M)) % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# C - Reconciled?
N, M = map(int,input().split())

S = 1
for i in range(1,min(N,M)+1):
    S *= i % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)


Fixed submission:
# C - Reconciled?
import math
N, M = map(int,input().split())

S = math.factorial(min(N,M)) % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# C - Reconciled?
N, M = map(int,input().split())

S = 1
for i in range(1,min(N,M)+1):
    S *= i

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)


Fixed submission:
# C - Reconciled?
import math
N, M = map(int,input().split())

S = math.factorial(min(N,M)) % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# C - Reconciled?
N, M = map(int,input().split())

Sn = 1
for i in range(1,N+1):
    Sn *= i

Sm = 1
for i in range(1,M+1):
    Sm *= i

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = Sn * Sm
else:
    ans = Sn*Sm*2

ans = ans % 1000000007

print(ans)


Fixed submission:
# C - Reconciled?
import math
N, M = map(int,input().split())

S = math.factorial(min(N,M)) % 1000000007

ans = 0
if abs(N-M) > 1:
    ans = 0
elif abs(N-M) == 1:
    ans = S*S*max(N,M)
else:
    ans = S*S*2

ans = ans % 1000000007

print(ans)
Buggy python submission (verdict: Runtime Error):
# ABC064_B
N = int(input())
A = [list(map(int,input().split()))]
print(max(A)-min(A))

Fixed submission:
# ABC064_B
N = int(input())
A = list(map(int,input().split()))
print(max(A)-min(A))
Buggy python submission (verdict: Time Limit Exceeded):
# C - Bugged
N = int(input())
S = [int(input()) for _ in range(N)]

lst = []
for i in range(2**N):
	ref = 0
	for j in range(N):
		if 1 & (i >> j):
			ref += S[j]
	if ref % 10 == 0:
		ref = 0
	lst.append(ref)

print(max(lst))


Fixed submission:
# C - Bugged
N = int(input())
S = [int(input()) for _ in range(N)]
S = sorted(S)

ans = sum(S)

if ans % 10 != 0:
	pass
else:
	for i in range(N):
		if S[i] % 10 != 0:
			ans = ans - S[i]
			break
	else:
		ans = 0

print(ans)
Buggy python submission (verdict: Runtime Error):
A = [[1,3,5,7,8,10,12],[4,6,9,11],[2]]
x,y = map(int, input().split())
flg = 0
for a in A:
    if x in a and y in a:
        flg = 1

if flg = 1:
    print("Yes")
else:
    print("No")

Fixed submission:
A = [[1,3,5,7,8,10,12],[4,6,9,11],[2]]
x,y = map(int, input().split())
flg = 0
for a in A:
    if x in a and y in a:
        flg = 1

if flg == 1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
R = [list(map(int, input().split())) for _ in range(N)]

for i in range(1,N+1):
    print(R.count(i))


Fixed submission:
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(M)]
R = sum(A,[])

for i in range(1,N+1):
    print(R.count(i))
Buggy python submission (verdict: Time Limit Exceeded):
# ABC061_C
N, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]

lst = []

for i in range(N):
    lst += [AB[i][0]]*AB[i][1]

lst = sorted(lst)
print(lst[K-1])


Fixed submission:
# ABC061_C
N, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
AB = sorted(AB)

for i in range(N):
    K -= AB[i][1]
    if K <= 0:
        print(AB[i][0])
        break

Buggy python submission (verdict: Time Limit Exceeded):
# ABC061_C
N, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]

lst = []

for i in range(N):
    for j in range(AB[i][1]):
        lst += [AB[i][0]]

lst = sorted(lst)
print(lst[K-1])


Fixed submission:
# ABC061_C
N, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]
AB = sorted(AB)

for i in range(N):
    K -= AB[i][1]
    if K <= 0:
        print(AB[i][0])
        break
Buggy python submission (verdict: Runtime Error):
N, T = map(int, input().split())
t = list(map(int, input().split()))

lst = [0]*(t[N-1]+T)

for i in range(N):
    for j in range(T):
        lst[t[i]+j] += 1

ans = len(lst) - lst.count(0)
print(ans)


Fixed submission:
N, T = map(int, input().split())
t = list(map(int, input().split()))

ans = T

for i in range(N-1):
    if t[i+1] - t[i] >= T:
        ans += T
    else: # t[i+1]-t[i]<T
        ans += t[i+1] - t[i]

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fac * integer % 1000000007
print(fact)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact *= integer

res = fact % 1000000007
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
def fract(n):
    fact = 1
    for integer in range(1, n+1):
        fact *= integer
    return fact

res = fract(N) % 1000000007
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Runtime Error):
N = int(input())
def fract(n):
    if n == 0:
        return 1
    elif n == 1:
        return n
    return n * fract(n-1)

res = fract(N) % 1000000007
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Runtime Error):
N = int(input())
def fract(n):
    if n == 1:
        return n
    return n * fract(n-1)
res = fract(N) % 1000000007
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Runtime Error):
N = int(input())
def fract(n):
    if n == 1:
        return n
    return n * fract(n-1)
res = fract(N) % 1000000007
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)

Buggy python submission (verdict: Runtime Error):
N = int(input())
def fract(n):
    if n == 1:
        return n
    return n * fract(n-1)
res = fract(N) /(1000000007)
print(res)

Fixed submission:
N = int(input())
fact = 1
for integer in range(1,N+1):
    fact = fact * integer % 1000000007
print(fact)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

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

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



Fixed submission:
# -*- coding: utf-8 -*-

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

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

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

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



Fixed submission:
# -*- coding: utf-8 -*-

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

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

Buggy python submission (verdict: Runtime Error):
# -*- 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



Fixed submission:
# -*- coding: utf-8 -*-

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

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

Buggy python submission (verdict: Runtime Error):
# -*- 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



Fixed submission:
# -*- coding: utf-8 -*-

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

if A*B >= C*D:
    print(A*B)
else:
    print(C*D)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import math

n = input()

N = math.factorial(int(n))

j= 0

for i in range(1, N+1):
    if N % i == 0:
        j += 1
    
print(j % 1000000007)


Fixed submission:
# -*- coding: utf-8 -*-
import math
import collections

n = input()

# 階乗を計算する
N = math.factorial(int(n))

# 試し割り方で素因数分解を行う
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

a = prime_factorize(N)

# 素因数の値と個数を辞書型にする
c = collections.Counter(a)

# 個数だけをリストで取得
d = list(c.values())

# 個数+1の総積が約数の個数となる
e = 1
for i in range(len(d)):
    e = e*(d[i]+1)

# 求められていた値の出力
print(e % 1000000007)