Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
enpitu = input("N ==:")
if enpitu <= 999:
	honsuu = enpitu // 10
	if honsuu == 3:
		print("bon")
	elif honsuu == 0, 1, 6, 8:
		print("pon")
	else:
		print("hon")
else:
    break


Fixed submission:
n = int(input()) % 10
if n == 3:
    print("bon")
elif n in {0, 1, 6, 8}:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
enpitu = input("N ==:")
honsuu = enpitu // 10
if honsuu == 3:
	print("bon")
elif honsuu == 0, 1, 6, 8:
	print("pon")
else:
	print("hon")


Fixed submission:
n = int(input()) % 10
if n == 3:
    print("bon")
elif n in {0, 1, 6, 8}:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
enpitu = input("":)
honsuu = enpitu // 10
if enpitu == 3:
	print("bon")
elif enpitu == 0, 1, 6, 8:
	print("pon")
else:
	print("hon")


Fixed submission:
n = int(input()) % 10
if n == 3:
    print("bon")
elif n in {0, 1, 6, 8}:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
enpitu = input("N ==")
honsuu = enpitu // 10
if enpitu == 3:
	print("bon")
elif enpitu == 0, 1, 6, 8:
	print("pon")
else:
	print("hon")

Fixed submission:
n = int(input()) % 10
if n == 3:
    print("bon")
elif n in {0, 1, 6, 8}:
    print("pon")
else:
    print("hon")
Buggy python submission (verdict: Runtime Error):
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)


Fixed submission:
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30 * h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)

Buggy python submission (verdict: Runtime Error):
import math
a, b, h, m = map(int,input().split())
fine = math.radians(3 * (5h - m))
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)


Fixed submission:
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30 * h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)

Buggy python submission (verdict: Runtime Error):
import math
a, b, h, m = map(int,input().split())
fine = math.cos((5h - m) * math.pi / 60)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * fine)
print(c)


Fixed submission:
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30 * h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)

Buggy python submission (verdict: Runtime Error):
import math
a, b, h, m = map(int,input().split)
fine = math.cos((5h - m) * math.pi / 60)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * fine)
print(c)


Fixed submission:
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30 * h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)

Buggy python submission (verdict: Runtime Error):
import math
a, b, h, m = map(int,input().split)
fine = math.cos((5h - m) * math.pi / 60)
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * fine)
print(c)

Fixed submission:
import math
a, b, h, m = map(int,input().split())
fine = math.radians(30 * h - 11 * m / 2)
c = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(fine))
print(c)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
if s = t[:-1]:
	print("Yes")
else:
    print("No")

Fixed submission:
s = input()
t = input()
if s == t[:-1]:
	print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
if s == "ARC":
	print("ABC")
elif s == "ABC":
    print("ARC")
else:
    break

Fixed submission:
s = input()
if s == "ARC":
	print("ABC")
else:
    print("ARC")
Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
for n in 10 ** 10 ** 10:
  if x <= (101 ** n) / (100 ** (n - 1)):
    print(n)

Fixed submission:
x = int(input())
n = 0
mon = 100
while mon < x:
  mon *= 1.01
  mon = int(mon)
  n += 1
  
print(n)
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if ((aok - 1) * d - a) => 0:
  print("No")
else:
  print("Yes")


Fixed submission:
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if ((aok - 1) * d - a) >= 0:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if (aok - 1) * d - a => 0:
  print("No")
else:
  print("Yes")


Fixed submission:
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if ((aok - 1) * d - a) >= 0:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if (aok - 1) * d - a => 0:
  print("NO")
else:
  print("Yes")


Fixed submission:
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if ((aok - 1) * d - a) >= 0:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if (int(aok) - 1) * d - a => 0:
  print("NO")
else:
  print("Yes")

Fixed submission:
a, b, c, d = map(int, input().split())
aok = 0
while c > 0:
  c = c - b
  aok += 1
  
if ((aok - 1) * d - a) >= 0:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
n = int(input())
lis = set()
for i in range(n):
  i = str(input())
  ilen = len(i)
  lis.append(ilen)
  
kind = int(len(lis))
print(kind)


Fixed submission:
n = int(input())
lis = set()
for i in range(n):
  i = str(input())
  lis.add(i)
  
kind = int(len(lis))
print(kind)

Buggy python submission (verdict: Runtime Error):
n = int(input())
lis = {}
for i in range(n):
  i = str(input())
  ilen = len(i)
  lis.append(ilen)
  
kind = int(len(lis))
print(kind)


Fixed submission:
n = int(input())
lis = set()
for i in range(n):
  i = str(input())
  lis.add(i)
  
kind = int(len(lis))
print(kind)
Buggy python submission (verdict: Runtime Error):
k, n = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = []
c = abs(k+a[0]-a[n-1])
for i in range(1, n):
  b.append(abs(a[i] - a[i-1]))
  b.sort()
  p = b[-1]

if p > c:
  print(k - p)
else:
  print(k - c)


Fixed submission:
s = input()
if s[-1] == s[-2]:
  if s[-3] == s[-4]:
    print("Yes")
    exit()

print("No")
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
if m >= 2:
  if n < 2:
    print(int(m*(m-1)/2)
    quit()
  else:
    print(int(m*(m-1)/2 + n*(n-1)/2))
    quit()
    
if m < 2:
  if n < 2:
    print(0)
  else:
    print(int(n*(n-1)/2))
  


Fixed submission:
n, m = map(int, input().split())
if m >= 2:
  if n < 2:
    print(int(m*(m-1)/2))
    quit()
  else:
    print(int(m*(m-1)/2 + n*(n-1)/2))
    quit()
    
if m < 2:
  if n < 2:
    print(0)
  else:
    print(int(n*(n-1)/2))
Buggy python submission (verdict: Runtime Error):
l = int(intput())
e = l / 3.0
print(e*e*e)

Fixed submission:
l = int(input())
e = l / 3
print(e*e*e)

Buggy python submission (verdict: Runtime Error):
l = float(intput())
e = l / 3.0
print(e*e*e)

Fixed submission:
l = int(input())
e = l / 3
print(e*e*e)

Buggy python submission (verdict: Runtime Error):
l = float(intput())
e = l // 3.0
print(e*e*e)

Fixed submission:
l = int(input())
e = l / 3
print(e*e*e)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
p2 = [p[i]*0.5 + 0.5 for i in range(N)]
size = N + 1
cusum = [0] * size
max = 0

for i in range(N):
    cusum[i+1] = cusum[i] + p2[i]

for i in range(N-K+1):
    tmp = cusum[i+K] - cusum[i]
    if max < tmp:
        max = tmp
print(max)


Fixed submission:
S,T = input().split()
A,B = map(int,input().split())
U = input()

if S==U:
    A-=1
else:
    B-=1

print(A,B)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
H = list(map(int,input().split()))
if K != 0 and len(H) < K:
    print(0)
    exit()
for i in range(K):
    H.remove(max(H))
print(sum(H))

def input():
    return sys.stdin.readline()[:-1]


Fixed submission:
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
H = list(map(int,input().split()))
if K != 0 and len(H) < K:
    print(0)
    exit()
H.sort()
for i in range(K):
    H.pop(-1)
print(sum(H))

def input():
    return sys.stdin.readline()[:-1]

Buggy python submission (verdict: Time Limit Exceeded):
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
N = list(map(int,input().split()))
if K != 0 and len(N) < K:
    print(0)
    exit()
for i in range(K):
    N.remove(max(N))
print(sum(N))

def input():
    return sys.stdin.readline()[:-1]


Fixed submission:
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
H = list(map(int,input().split()))
if K != 0 and len(H) < K:
    print(0)
    exit()
H.sort()
for i in range(K):
    H.pop(-1)
print(sum(H))

def input():
    return sys.stdin.readline()[:-1]

Buggy python submission (verdict: Time Limit Exceeded):
NK = input().split()
N,K = int(NK[0]),int(NK[1])
N = list(map(int,input().split()))
if K != 0 and len(N) < K:
    print(0)
    exit()
for i in range(K):
    N.remove(max(N))
print(sum(N))

Fixed submission:
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
H = list(map(int,input().split()))
if K != 0 and len(H) < K:
    print(0)
    exit()
H.sort()
for i in range(K):
    H.pop(-1)
print(sum(H))

def input():
    return sys.stdin.readline()[:-1]

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
N = list(map(int,input().split()))
if K != 0 and len(N) < K:
    print(0)
    exit()
for i in range(K):
    N.remove(max(N))
print(sum(N))

Fixed submission:
import sys
NK = input().split()
N,K = int(NK[0]),int(NK[1])
H = list(map(int,input().split()))
if K != 0 and len(H) < K:
    print(0)
    exit()
H.sort()
for i in range(K):
    H.pop(-1)
print(sum(H))

def input():
    return sys.stdin.readline()[:-1]
Buggy python submission (verdict: Runtime Error):
kamo,max,ave = map(int, input().split())
now = list(map(int, input().split()))
ten = 0
for i in now:
    ten += i

need = kamo * ave

if ( kamo * ave > ten + max):
    print(-1)
else:
    if(kamo * ave - ten >= 0):
        print(kamo * ave - ten)
    else:
        print(0)


Fixed submission:
a = input()
print (chr(ord(a) + 1))
Buggy python submission (verdict: Runtime Error):
s = list(input())
box = []
cnt = 0
for i in s:
	if i == 'R':
		cnt += 1
	else:
		box.append(cnt)
print(max(box))

Fixed submission:
s = list(input())
box = []
cnt = 0
for i in s:
	if i == 'R':
		cnt += 1
	else:
		box.append(cnt)
		cnt = 0
box.append(cnt)
print(max(box))
Buggy python submission (verdict: Runtime Error):
import math
n,d = map(int,input().split())
xy = [list(map(int,input().split())) for _ in range(n)]
cnt = 0
for i in range(n):
	if math.sqrt((xy[0])**2 + (xy[1])**2) <= d:
		cnt += 1
print(cnt)

Fixed submission:
import math
n,d = map(int,input().split())
xy = [list(map(int,input().split())) for _ in range(n)]
cnt = 0
for i in range(n):
	if math.sqrt((xy[i][0])**2 + (xy[i][1])**2) <= d:
		cnt += 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = []
tmp = 1
#最初のK番目まで
for i in range(k):
  tmp *= a[i]
ans.append(tmp)
for j in range(k,n):
  tmp *= a[j]
  tmp //= a[j-k]
  ans.append(tmp)
for t in range(n-k):
  if ans[t+1] > ans[t]:
    print("Yes")
  else:
    print("No")

Fixed submission:
n,k = map(int,input().split())
a = list(map(int,input().split()))
ans = []
for i in range(k,n):
  ans.append(a[i] - a[i-k])
for j in ans:
  if j > 0:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())
crain = (4 * N - M) / 2
R = N - int(crain)
if crain.is_integer():
  if crain >= 0　and R > 0:
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
import sys
x,y = map(int,input().split())
for i in range(x+1):
  for j in range(x-i+1):
    if i+j == x and (i*2)+(j*4) == y:
      print("Yes")
      sys.exit()
print("No")

Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())
crain = (4 * N - M) / 2
if crain.is_integer():
  if crain >= 0　and (N - int(crain)) > 0:
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
import sys
x,y = map(int,input().split())
for i in range(x+1):
  for j in range(x-i+1):
    if i+j == x and (i*2)+(j*4) == y:
      print("Yes")
      sys.exit()
print("No")

Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())
crain = (4 * N - M) / 2
if crain.is_integer():
  if crain >= 0　and N - int(crain) > 0:
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
import sys
x,y = map(int,input().split())
for i in range(x+1):
  for j in range(x-i+1):
    if i+j == x and (i*2)+(j*4) == y:
      print("Yes")
      sys.exit()
print("No")
Buggy python submission (verdict: Runtime Error):
import sys
x,n = map(int,input().split())
l = list(map(int,input().split()))
not_l,ans = [],[]
if not x in l:
	print(x)
	sys.exit()
l = sorted(l)
for i in range(1,50):
	if not i in l:
		not_l.append(i)
for j in range(len(not_l)):
	ans.append([not_l[j],abs(not_l[j]-x)])
ans.sort(key=lambda x:x[1])
print(ans[0][0])


Fixed submission:
import sys
x,n = map(int,input().split())
l = list(map(int,input().split()))
not_l,ans = [],[]
if not x in l:
	print(x)
	sys.exit()
l = sorted(l)
for i in range(0,max(l)+3):
	if not i in l:
		not_l.append(i)
for j in range(len(not_l)):
	ans.append([not_l[j],abs(not_l[j]-x)])
ans.sort(key=lambda x:x[1])
print(ans[0][0])

Buggy python submission (verdict: Runtime Error):
import sys
x,n = map(int,input().split())
l = list(map(int,input().split()))
not_l,ans = [],[]
if not x in l:
	print(x)
	sys.exit()
l = sorted(l)
for i in range(1,101):
	if not i in l:
		not_l.append(i)
for j in range(len(not_l)):
	ans.append([not_l[j],abs(not_l[j]-x)])
ans.sort(key=lambda x:x[1])
print(ans[0][0])


Fixed submission:
import sys
x,n = map(int,input().split())
l = list(map(int,input().split()))
not_l,ans = [],[]
if not x in l:
	print(x)
	sys.exit()
l = sorted(l)
for i in range(0,max(l)+3):
	if not i in l:
		not_l.append(i)
for j in range(len(not_l)):
	ans.append([not_l[j],abs(not_l[j]-x)])
ans.sort(key=lambda x:x[1])
print(ans[0][0])
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
#res = A[0]
for i in range(1,N): 
	A[0] *= A[i]
if A[0] <= 10**18:
	print(A[0])
else:
	print("-1")


Fixed submission:
A = input().split()
print(int(A[0])*int(A[1]))

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N): 
	A[0] *= A[i]
if A[0] < 10**18:
	print(A[0])
else:
	print("-1")


Fixed submission:
A = input().split()
print(int(A[0])*int(A[1]))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
#res = A[0]
for i in range(1,N): 
	A[0] *= A[i]
if A[0] <= 10**18:
	print(A[0])
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
res = A[0]*A[1]
for i in range(2,N): 
	res *= A[i]
if res <= 10**18:
	print(res)
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
res = A[0]
for i in range(1,N): 
	res *= A[i]
if res <= 10**18:
	print(res)
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
res = A[0]
for i in range(1,N): 
	res *= A[i]
if res <= 10**18:
	print(res)
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
res = A[0]
for i in range(1,N): 
	res *= A[i]
if res <= 10**18:
	print(res)
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
res = A[0]
for i in range(1,len(A)): 
	res *= A[i]
if res <= 10**18:
	print(res)
else:
	print("-1")


Fixed submission:
a=int(input())
b=input().split(" ")
sum1=1
 
if "0" in b:
    print("0")
else:
    for i in range(a):
        sum1=sum1*int(b[i])
        if sum1>10**18:
            sum1=-1
            break
    print(sum1)
Buggy python submission (verdict: Runtime Error):
A,B = input().split()
A = int(A) 
B = float(B)
B = "{:.2f}".format(B)
#print(int(A*B))
print(int(A*B))

Fixed submission:
import math
from decimal import *
a,b = map(float,input().split())
ans = Decimal(str(b))*int(a)
print(math.floor(ans))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
for i in range(n):
	print(a.count(i+1))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = [0]*(n+1)
for i in range(len(a)):
	ans[a[i-1]] += 1
ans.pop(0)
for j in range(n):
	print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = [0]*(n+1)
na = max(a)+1
for i in range(1,na+1):
	ans[i] += a.count(i)
ans.pop(0)
for j in range(n):
	print(ans[j])

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = [0]*(n+1)
for i in range(len(a)):
	ans[a[i-1]] += 1
ans.pop(0)
for j in range(n):
	print(ans[j])
Buggy python submission (verdict: Runtime Error):
N = int(input())
seq = [i for in range(1,N) 
count = 0
for t in range(len(seq)):
  if seq[t]%3 != 0 or seq[t]%5 != 0:
       count += seq[t]
print(count)

Fixed submission:
N = int(input())
seq = [i for i in range(1,N+1)]
count = 0
for t in range(0,N):
	if seq[t]%3 != 0 and seq[t]%5 != 0:
		count += seq[t]
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import math
K = int(input())
ans = 0
for i in range(1,K+1):
	for j in range(1,K+1):
		for n in range(1,K+1):
			tmp = math.gcd(i,j)
			ans += math.gcd(tmp,n)
print(ans)

Fixed submission:
import math
K = int(input())
ans = 0
for i in range(1,K+1):
	for j in range(1,K+1):
		tmp = math.gcd(i,j)
		for n in range(1,K+1):
			ans += math.gcd(tmp,n)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import fractions
K = int(input())
ans = 0
for i in range(1,K+1):
	for j in range(1,K+1):
		for n in range(1,K+1):
			tmp = fractions.gcd(i,j)
			ans += fractions.gcd(tmp,n)
print(ans)

Fixed submission:
import math
K = int(input())
ans = 0
for i in range(1,K+1):
	for j in range(1,K+1):
		tmp = math.gcd(i,j)
		for n in range(1,K+1):
			ans += math.gcd(tmp,n)
print(ans)
Buggy python submission (verdict: Runtime Error):
X,Y,Z = map(int,input().sp;split())
print(Z,X,Y)

Fixed submission:
import sys
#readline = sys.stdin.readline()
A,B,C = map(int,input().split())
print(C,A,B)

Buggy python submission (verdict: Runtime Error):
import sys
readline = sys.stdin.readline()
A,B,C = map(int,readline().split())
print(C,A,B)

Fixed submission:
import sys
#readline = sys.stdin.readline()
A,B,C = map(int,input().split())
print(C,A,B)

Buggy python submission (verdict: Runtime Error):
import sys
readllne = sys.stdin.readllne
A,B,C = map(int,readllne().split())
print(C,A,B)


Fixed submission:
import sys
#readline = sys.stdin.readline()
A,B,C = map(int,input().split())
print(C,A,B)

Buggy python submission (verdict: Runtime Error):
import sys
readllne = sys.stdin.readllne()
A,B,C = map(int,readllne().split())
print(C,A,B)

Fixed submission:
import sys
#readline = sys.stdin.readline()
A,B,C = map(int,input().split())
print(C,A,B)
Buggy python submission (verdict: Runtime Error):
k,n = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
  if a[i] >= k/2
    a[i] = a[i] -k
print(max(a)-min(a))

Fixed submission:
k,n = map(int,input().split())
a = list(map(int,input().split()))
l = []
l.append(abs(k-abs(a[0]-a[n-1])))
for i in range(n-1):
	l.append(abs(a[i]- a[i+1]))
print(sum(l)-max(l))
Buggy python submission (verdict: Runtime Error):
N,R = map(int,input().split())
print(R if N >= 10 else R+{100*(10-N)})


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

print(R if N >= 10 else R + 100*(10-N))

Buggy python submission (verdict: Runtime Error):
N,R = map(int,input().split())
print(R if N >= 10 else R+{100*(10-K)})


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

print(R if N >= 10 else R + 100*(10-N))

Buggy python submission (verdict: Runtime Error):
N,R = map(int,input().split())
print(R if N >= 10 else R+100*(10-K))

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

print(R if N >= 10 else R + 100*(10-N))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
A_count = 0

#A内の奇数を0にする
for i in range(len(A)):
  if A[i]%2 != 0:
    A.pop(A[i]) 
#A内偶数をチェックする
for t in range(len(A)):
  if A[i]%3 == 0 or A[i]%5 == 0:
    A_count +=1
print("APPROVED" if A_count == len(A) else "DENIED")

    

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

#A内の奇数を0にする
for i in range(len(A)):
	if A[i]%2 != 0:
		A[i] = 0
#A内偶数をチェックする
for t in range(len(A)):
	if A[t] > 0:
		if A[t]%3 == 0 or A[t]%5 == 0:
			A[t] = 0
print("APPROVED" if sum(A) == 0  else "DENIED")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [input() for s in range(n)]
l = len(set(s))
tmp,ans,lans = [],[0]*l,[]
for i in range(n):
	if not s[i] in tmp:
		tmp.append(s[i])
		ans[tmp.index(s[i])] += 1
	else:
		ans[tmp.index(s[i])] += 1

for j in range(l):
	if ans[j] == max(ans):
		lans.append(tmp[j])
lans.sort()
for h in range(len(lans)):
	print(lans[h])

Fixed submission:
n = int(input())
s = [input() for s in range(n)]
dic = {}

for i in range(n):
	if not s[i] in dic:
		dic[s[i]] = 1
	else:
		dic[s[i]] += 1

cnt_max = max(dic.values()) 
ans = []
for j in dic.keys():
	if dic[j] == cnt_max:
		ans.append(j)

ans.sort()

for h in range(len(ans)):
	print(ans[h])
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
for i in range(k):
	h[i] = 0
print(sum(h))

Fixed submission:
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
if k > n:
	k = n
for i in range(k):
	h[i] = 0
print(sum(h))
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input(),split())
print("Yes" if N == M else "No")

Fixed submission:
N,M = map(int,input().split())
print("Yes" if N == M else "No")