Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
K=int(input())
A=int(input())
B=int(input())

if ('A,B%K==0'):
  print('OK')
else:
  print('NG')

Fixed submission:
k = int(input())
a, b = map(int, input().split())
x = b // k * k
if a <= x:
    print("OK")
else:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=int(input())
A=int(input())
B=int(input())
if A>=1 and B<=1000:
  print('OK')
else:
  print('NG')

Fixed submission:
k = int(input())
a, b = map(int, input().split())
x = b // k * k
if a <= x:
    print("OK")
else:
    print("NG")
Buggy python submission (verdict: Runtime Error):
N=input()[-1:]

if N="3":
  print("bon")
elif N in {0,1,6,8}:
  print("pon")
else:
  print("hon")

Fixed submission:
N=input()[-1]
if N=="3":
  print("bon")
elif N in {"0","1","6","8"}:
  print("pon")
else:
  print("hon")
Buggy python submission (verdict: Time Limit Exceeded):
A, B, N = map(int, input().split())
result = []
cnt = 0

for _ in range(N):
  cnt += 1
  result.append(int(A*cnt/B)-A*int(cnt/B))
  
print(max(result))

Fixed submission:
A, B, N = map(int, input().split())
cnt = min(B-1, N)
result = int(A*cnt/B)-A*int(cnt/B)
  
print(result)

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

A, B, N = map(int, input().split())
result = []
cnt = 0

for _ in range(N):
  cnt += 1
  result.append(math.floor(A*cnt/B)-A*math.floor(cnt/B))
  
print(max(result))

Fixed submission:
A, B, N = map(int, input().split())
cnt = min(B-1, N)
result = int(A*cnt/B)-A*int(cnt/B)
  
print(result)
Buggy python submission (verdict: Runtime Error):
n = int(input())
list =[input() for _ in range(n)]: 
print(len(set(list)))

Fixed submission:
n = int(input())

s_list = []
for i in range(n):
    s = str(input())
    s_list.append(s)
    
print(len(set(s_list)))
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()))
if k>=n:
    print(0)
else:
  H.sort(reverse=True)
  for i in range(k):
    H[i] = 0

  print(sum(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(H)

print(sum(H))

Fixed submission:
n, k = map(int, input().split())
H = list(map(int, input().split()))
if k>=n:
    print(0)
else:
  H.sort(reverse=True)
  for i in range(k):
    H[i] = 0

  print(sum(H))
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
min_a=str(a)*b
min_b=str(b)*a
print(min(min_a, min_b)

Fixed submission:
a,b = map(int,input().split())
min_a=str(a)*b
min_b=str(b)*a
print(min(min_a, min_b))
Buggy python submission (verdict: Runtime Error):
import math 

all_list = []

for i in range(5):
  a = int(input())

  all_list.append(a)
  
last_list = [x % 10 for x in all_list if x % 10 > 0]
last_list2 = [x for x in all_list if x % 10 > 0]
last_x = last_list2[last_list.index(min(last_list))]

all_list.remove(last_x)

sum_list = [math.ceil(x / 10) * 10 for x in all_list]

m = sum(sum_list) + last_x
print(m)

Fixed submission:
import math 

all_list = []

for i in range(5):
  a = int(input())

  all_list.append(a)
  
last_list = [x % 10 for x in all_list if x % 10 > 0]
last_list2 = [x for x in all_list if x % 10 > 0]

if len(last_list) > 0:
  last_x = last_list2[last_list.index(min(last_list))]
  all_list.remove(last_x)
else:
  last_x = 0

sum_list = [math.ceil(x / 10) * 10 for x in all_list]

m = sum(sum_list) + last_x
print(m)
Buggy python submission (verdict: Runtime Error):
import numpy as np

N, M = map(int, input().split())
num_dict = dict()
A_list = []

for n in range(N):
  A, B = map(int, input().split())
  num_dict[A] = B
  A_list.append(A)

A_list.sort()
b_accum = 0
all_pay = 0

for a in A_list:
  if M <= b_accum:
    break

  if b_accum + num_dict[a] <= M:
    all_pay += num_dict[a] * a
    b_accum += num_dict[a]
    
    if M == b_accum:
		
  
  else:
    all_pay += (M - b_accum) * a 
    b_accum += num_dict[a]
    
print(all_pay)

 

Fixed submission:
import numpy as np

N, M = map(int, input().split())
num_dict = dict()
A_list = []
B_list = []

for n in range(N):
  A, B = map(int, input().split())
  num_dict.setdefault(A, 0)
  num_dict[A] += B
  A_list.append(A)

A_list = list(set(A_list))
A_list.sort()
b_accum = 0
all_pay = 0

for a in A_list:
  if M <= b_accum:
    break

  if b_accum + num_dict[a] <= M:
    all_pay += num_dict[a] * a
    b_accum += num_dict[a]    
  
  else:
    all_pay += (M - b_accum) * a 
    b_accum += num_dict[a]
    break
    
print(all_pay)
Buggy python submission (verdict: Runtime Error):
N = int(input())
all_yen = 0
for n in range(N):
    x , u = input().split()
    if u  == 'BTC':
        x *= 380000.0

    all_yen += x




Fixed submission:
N = int(input())
all_yen = 0
for n in range(N):
    x , u = input().split()
    x = float(x)
    if u == 'BTC':
        x *= 380000.0
        
    all_yen += x

print(all_yen)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
cnt = 0

for b in range(K+1, N+1):
    u = ((N - b)//b) + 1
    v =  (N - K)//b

    cnt += (b-K)*u + (v-u+1)*(-b*(u+v)+2*N-2*K+2)*(1/2)

print(cnt)





Fixed submission:
row1 = input()[0]
row2 = input()[1]
row3 = input()[2]

print(row1 + row2 + row3)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())

cnt = 0


for b in range(K+1, N+1):
    if N % b  == 0:
        cnt += (b-K)*(N//b) + max((N - (N //b) * b) - K  , 0)
    else
        cnt += (b - K) * (N // b) + max((N - (N // b) * b) - K+1, 0)
print(cnt)





Fixed submission:
N, K = map(int, input().split())
cnt = 0

if K > 0:
    for b in range(K+1, N+1):
        u = ((N - b)//b) + 1
        v =  (N - K)//b

        cnt += (b-K)*u + (v-u+1)*(-b*(u+v)+2*N-2*K+2)/2
else:
    for b in range(K+1, N+1):
        u = ((N - b)//b) + 1
        v =  (N - K)//b

        cnt += (b-K)*u + (v-u+1)*(-b*(u+v)+2*N-2*K+2)/2 - 1

print(int(cnt))
Buggy python submission (verdict: Runtime Error):
N = int(input())

ball_list = []

for i in range(N):
    ball_list.append(int(input()))

print(len(list(set(ball_list)))

Fixed submission:
N = int(input())

ball_list = map(str, input().split())
type_num = len(list(set(ball_list)))

if type_num == 3:
    print('Three')
else:
    print('Four')
Buggy python submission (verdict: Runtime Error):
a, b = map(int input().split())

def convert_num(a):
    if a == 1:
        a = 14
    return a

a = convert_num(a)
b = convert_num(b)
if a > b:
    print('Alice')
elif a == b:
    print('Draw')
else:
    print('Bob')
    

Fixed submission:
a, b = map(int, input().split())

def convert_num(a):
    if a == 1:
        a = 14
    return a

a = convert_num(a)
b = convert_num(b)
if a > b:
    print('Alice')
elif a == b:
    print('Draw')
else:
    print('Bob')
Buggy python submission (verdict: Runtime Error):
import numpy as np
N, M = map(int, input().split())
 
G = np.zeros((N, M)) 
total_path_num = 0
not_reach_node = list(range(1, N))
node = 0
 
for i in range(M):
  a, b = map(int, input().split())
  G[a-1, b-1] += 1
  G[b-1, a-1] += 1
  
def search_path(G, not_reach_node, node):
  global total_path_num
  if len(not_reach_node) == 0:
    total_path_num += 1
    return total_path_num
  
  for x in np.where((G[node] == 1))[0]:
    try:
      if (x in not_reach_node):
        not_reach_node_copy = not_reach_node.copy()
        not_reach_node_copy.remove(x)
        search_path(G, not_reach_node_copy, x)
    except:
      pass
        
search_path(G, not_reach_node, node)      	
 
print(total_path_num)

Fixed submission:
import numpy as np
N, M = map(int, input().split())
 
G = np.zeros((N, N)) 
total_path_num = 0
not_reach_node = list(range(1, N))
node = 0
 
for i in range(M):
  a, b = map(int, input().split())
  G[a-1, b-1] += 1
  G[b-1, a-1] += 1
  
def search_path(G, not_reach_node, node):
  global total_path_num
  if len(not_reach_node) == 0:
    total_path_num += 1
    return total_path_num
  
  for x in np.where((G[node] == 1))[0]:
    if (x in not_reach_node):
      not_reach_node_copy = not_reach_node.copy()
      not_reach_node_copy.remove(x)
      search_path(G, not_reach_node_copy, x)

search_path(G, not_reach_node, node)      	
 
print(total_path_num)

Buggy python submission (verdict: Runtime Error):
import numpy as np
N, M = map(int, input().split())

G = np.zeros((N, M)) 
total_path_num = 0
not_reach_node = list(range(1, N))
node = 0

for i in range(M):
  a, b = map(int, input().split())
  G[a-1, b-1] += 1
  G[b-1, a-1] += 1
  
def search_path(G, not_reach_node, node):
  global total_path_num
  if len(not_reach_node) == 0:
    total_path_num += 1
    return total_path_num
  
  for x in np.where((G[node] == 1))[0]:
    if (x in not_reach_node):
      not_reach_node_copy = not_reach_node.copy()
      not_reach_node_copy.remove(x)
      search_path(G, not_reach_node_copy, x)
        
search_path(G, not_reach_node, node)      	

print(total_path_num)


Fixed submission:
import numpy as np
N, M = map(int, input().split())
 
G = np.zeros((N, N)) 
total_path_num = 0
not_reach_node = list(range(1, N))
node = 0
 
for i in range(M):
  a, b = map(int, input().split())
  G[a-1, b-1] += 1
  G[b-1, a-1] += 1
  
def search_path(G, not_reach_node, node):
  global total_path_num
  if len(not_reach_node) == 0:
    total_path_num += 1
    return total_path_num
  
  for x in np.where((G[node] == 1))[0]:
    if (x in not_reach_node):
      not_reach_node_copy = not_reach_node.copy()
      not_reach_node_copy.remove(x)
      search_path(G, not_reach_node_copy, x)

search_path(G, not_reach_node, node)      	
 
print(total_path_num)
Buggy python submission (verdict: Time Limit Exceeded):
N, T = map(int, input().split())

cost_list = list(map(int, input().split()))

max_num = 0
max_profit = 0

for i in range(len(cost_list)-1):
    profits = [x - cost_list[i] for x in cost_list[i+1 :]]
    M_profit = max(profits)

    if max_profit < M_profit:
        max_num = 1
        max_profit = M_profit

    elif max_profit == M_profit:
        max_num += 1

print(max_num)


Fixed submission:
import numpy as np
N, T = map(int, input().split())

cost_list = np.array(list(map(int, input().split())))

max_num = 0
max_profit = 0
max_list = []
max_value = 0
for x in reversed(cost_list[1:]):
    max_value = max(max_value, x)
    max_list.append(max_value)
max_list = list(reversed(max_list))
max_list = np.array(max_list)
res = max_list - cost_list[:-1]

res_max = max(res)

max_num_list = [y for y in res if y == res_max]

print(len(max_num_list))
Buggy python submission (verdict: Runtime Error):
 a, b = map(int, input().split())

if a >= 2 and b >=2 :
    ans = (a * (a + 1)//2 - a) + (b * (b +1)//2 - b)
    print(ans)

if a < 2 and b < 2:
    print(0)

if a < 2 and b >= 2:
    print(b * (b + 1)//2 -b)

if a >= 2 and b < 2:
    print(a * (a + 1)//2 -a)

Fixed submission:
a, b = map(int, input().split())

if a >= 2 and b >=2 :
    ans = ((a * (a + 1))//2 - a) + ((b * (b +1))//2 - b)
    print(ans)

if a < 2 and b < 2:
    print(0)

if a < 2 and b >= 2:
    print((b * (b + 1))//2 -b)

if a >= 2 and b < 2:
    print((a * (a + 1))//2 -a)
Buggy python submission (verdict: Runtime Error):
a, b  = map(int, input().split())

for i in range(10000):
  if i * 0.08 == a and i * 0.1 == b:
    print(i)
    exit(0)
else:
  print(-1)
    
    


Fixed submission:
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')

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

for i in range(10000):
  if i == a * 0.08 and i ==  b * 0.1:
    print(i)
    exit(0)
print('-1')
    


Fixed submission:
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')

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

for i in range(10000):
  if i == a * 0.08 and i ==  b * 0.1:
    print(i)
    exit(0)
  else:
    print('-1')
    


Fixed submission:
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')

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

for i in range(10000):
  if i == a * 0.08 and i ==  b * 0.1:
    print(i)
  else:
    print('-1')
    


Fixed submission:
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')

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

for i in range(10000):
  if a * 0.08 == b * 0.1:
    print(a)
    exit(0)
  else:
    print('-1')
    


Fixed submission:
s = input()
if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())


ans = (n //(a + b)) * a
if n % (a + b) <= a:
  print(ans + (n % (a + b))
elif n % (a + b) >= a:
  print(ans + a)
        


Fixed submission:


n, a, b = map(int, input().split())
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)

Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())


ans = (n //(a + b)) * a
if n % (a + b) < a:
  print(ans + (n % (a + b))
elif n % (a + b) >= a:
  print(ans + a)
        


Fixed submission:


n, a, b = map(int, input().split())
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)

Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())


ans = (n //(a + b)) * a
if n % (a + b) < a:
  print(ans + (n % (a + b))
elif n % (a + b) > a:
  print(ans + a)
        

Fixed submission:


n, a, b = map(int, input().split())
ans = n // (a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)
Buggy python submission (verdict: Runtime Error):
a = list(map(int, input().split()))

if set(len(a)) == 2:
  print('Yes')

else:
  print('No')
  


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

if len(set(a)) == 2:
  print('Yes')
else:
  print('No')

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

if len(set(a)) = 2:
  print('Yes')
else:
  print('No')
  


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

if len(set(a)) == 2:
  print('Yes')
else:
  print('No')

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

if len(set(a)) =< 2:
  print('Yes')
else:
  print('No')
  

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

if len(set(a)) == 2:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

for i in range(n):
    if a[i] % 6 == or a[i] % 10:
        print('APPROVED')
        break

print('DENIED')

Fixed submission:
n = int(input())
a = list(map(int, input().split()))

for i in range(n):
    if a[i] % 2 == 0:
        if a[i] % 3 == 0 or a[i] % 5 == 0:
            continue
        else:
            print('DENIED')
            exit()

print('APPROVED')
Buggy python submission (verdict: Runtime Error):
s = input()

print(chr(ord(s) + 1)


Fixed submission:
s = input()

print(chr(ord(s) + 1))

Buggy python submission (verdict: Runtime Error):
s = input()

print(char(ord(s) + 1)


Fixed submission:
s = input()

print(chr(ord(s) + 1))

Buggy python submission (verdict: Runtime Error):
s = input()

print(char(ord(s) + 1))


Fixed submission:
s = input()

print(chr(ord(s) + 1))

Buggy python submission (verdict: Runtime Error):
a = input()
ans = char(ord(a) + 1)

print(ans)

Fixed submission:
s = input()

print(chr(ord(s) + 1))
Buggy python submission (verdict: Runtime Error):
n = int(input())

s, t = map(input().split())

ans = ''

for i in range(n):
    ans += s[i]
    ans += t[i]

print(ans)

Fixed submission:
n = int(input())

s, t =input().split()

ans = ''

for i in range(n):
    ans += s[i]
    ans += t[i]

print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a + b + c <= 22:
  print('bust')
else;¥:
  print('win')

Fixed submission:
a, b, c = map(int, input().split())

if a + b + c >= 22:
  print('bust')
else:
  print('win')
Buggy python submission (verdict: Runtime Error):
a = int(input())

list = []

for i in range(a):
  if a % i == 0:
    list.append(i)
list2 = []
for j in list:
  if j < 10:
    list2.append(j)

if len(list2) >= 2:
  print('Yes')
else:
  print('No')
  

Fixed submission:
n = int(input())

for i in range(1, n + 1):
    if n % i == 0:
        j = n // i
        if i < 10 and j < 10:
            print('Yes')
            break
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = []
for i in range(1, n + 1):
    if n % i == 0:
        if i ** 2 > n:
            break
        j = n // i
        l.append(i + j)

print(min(l) - 2)

Fixed submission:
n = int(input())
l = []
for i in range(1, int(n ** 0.5 + 1)):
    if n % i == 0:
        j = n // i
        l.append(i + j)

print(min(l) - 2)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = []
for i in range(1, n + 1):
    if n % i == 0:
        j = n // i
        l.append(i + j)

print(min(l) - 2)

Fixed submission:
n = int(input())
l = []
for i in range(1, int(n ** 0.5 + 1)):
    if n % i == 0:
        j = n // i
        l.append(i + j)

print(min(l) - 2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
h = list(map(int, input().split()))

ans = 0

for i in h:
  if i >= k:
    ans += 1
print(ans)

Fixed submission:
n,k = map(int, input().split())
h = list(map(int, input().split()))

ans = 0

for i in h:
  if i >= k:
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n = map(int, input().split())
ans = n.count('1')

print(ans)


Fixed submission:
s = list(input())

ans = 0

for i in s:
    if i == '1':
        ans += 1
    
    if i == '0':
        continue

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

Fixed submission:
def resolve():
    n = list(input())
    target = int(n[-1])
    if target in [2,4,5,7,9]:
        print('hon')
    elif target in [0,1,6,8]:
        print('pon')
    else:
        print('bon')
resolve()
Buggy python submission (verdict: Runtime Error):
import math
a = int(input())
b = int(input())
h = int(input())
m = int(input())
ans = math.sqrt(float(a)^2+float(b)^2+2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi))
print(ans)

Fixed submission:
import math
a,b,h,m = map(int, input().split())
ans = math.sqrt(float(a)**2+float(b)**2-2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi*2))
print(ans)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
h = int(input())
m = int(input())
ans = math.sqrt(float(a)^2+float(b)^2+2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi))
print(ans)

Fixed submission:
import math
a,b,h,m = map(int, input().split())
ans = math.sqrt(float(a)**2+float(b)**2-2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi*2))
print(ans)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
h = int(input())
m = int(input())
ans = math.sqrt(a^2+b^2+2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi))
print(ans)

Fixed submission:
import math
a,b,h,m = map(int, input().split())
ans = math.sqrt(float(a)**2+float(b)**2-2*a*b*math.cos((h/12 + m/720 - m/60)*math.pi*2))
print(ans)
Buggy python submission (verdict: Runtime Error):
no=int(input())
n=no
c=0
while(n):
  if n == 0:
    print c/n
    break
  if n%2 == 1:
    c += 1

Fixed submission:
no=int(input())
n=no
c=0
while(n>0):
  if n%2 == 1:
    c += 1
  n -= 1
print(c/no)

Buggy python submission (verdict: Runtime Error):
no=int(input())
n=no
c=0
while(n):
  if n == 0:
    print c/n
    break
  if n%2 == 1:
    c += 1

Fixed submission:
no=int(input())
n=no
c=0
while(n>0):
  if n%2 == 1:
    c += 1
  n -= 1
print(c/no)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
l=list(map(int,input().split()))
c=0
for i in l:
  if l>=k:
    c+=1
print c

Fixed submission:
n,k=map(int,input().split())
l=list(map(int,input().split()))
c=0
for i in l:
  if i>=k:
    c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
n = input()
n_1 = int(n[-1])
hon = [2,4,5,7,9]
pon = [0,1,6,8]
bon = [3]
if n_1 in hon:
  print('hon')
  elif n_1 in pon:
    print('pon')
  else:
    print('bon')

Fixed submission:
n = input()
n_1 = int(n[-1])
hon = [2,4,5,7,9]
pon = [0,1,6,8]
bon = [3]
if n_1 in hon:
    print('hon')
elif n_1 in pon:
    print('pon')
else:
    print('bon')
Buggy python submission (verdict: Runtime Error):
if S == "ABC":
  print("ARC")
 else:
  print("ABC")

Fixed submission:
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")

Buggy python submission (verdict: Runtime Error):
S = input()
if S == "ABC":
  print("ARC")
 else:
  print("ABC")

Fixed submission:
S = input()
if S == "ABC":
  print("ARC")
else:
  print("ABC")
Buggy python submission (verdict: Runtime Error):
print(int((int(input()) + int(input)) * int(input()) / 2))

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print(int((a+b)*h / 2))
Buggy python submission (verdict: Runtime Error):
a = int(input())

for i in range(a + 1):
  sum += i
 
print(sum)

Fixed submission:
a = int(input())
sum = 0

for i in range(a+1):
  sum += i
  
print(sum)
Buggy python submission (verdict: Runtime Error):
li = list(input())
line = []

for i in li:
  if i == "0":
    line.append("0")
  elif i == "1":
    line.append("1")
  else:
    line.pop(len(line) - 1)

print("".join(line))

Fixed submission:
li = list(input())
line = []

for i in li:
  if i == "0":
    line.append("0")
  elif i == "1":
    line.append("1")
  else:
    if len(line) != 0:
      line.pop(len(line) - 1)

print("".join(line))
Buggy python submission (verdict: Runtime Error):
nums = list(map(int, input().split("")))

if sum(nums) == 17 and (5 in nums) and (7 in nums):
  print("YES")
else:
  print("NO")

Fixed submission:
nums = list(map(int, input().split(" ")))
 
if sum(nums) == 17 and (5 in nums) and (7 in nums):
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
import math

N = input()
print(math.ceil(N/2))

Fixed submission:
import math
 
N = float(input())
print(math.ceil(N/2))
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

pirnt(6-A-B)


Fixed submission:
A = int(input())
B = int(input())

print(6-A-B)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

X = input(S)
q = X//100
mod = X%100

if q*5 > mod: print(1)
else: print(0)

Fixed submission:
# coding: utf-8

X = int(input())
q = X//100
mod = X%100

if q*5 >= mod: print(1)
else: print(0)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
N=int(input())
S=input()
if S[:N/2]==S[N/2:]: print("Yes")
else: print("No")

Fixed submission:
# coding: utf-8
N=int(input())
S=input()
if S[:int(N/2)]==S[int(N/2):]: print("Yes")
else: print("No")
Buggy python submission (verdict: Runtime Error):
A, B = int(input().split())

if 0<A and A<10 and 0<B and B<10:
    print(A*B)
else:
    print(-1)


Fixed submission:
A, B = (int(x) for x in input().split())

if 0<A and A<10 and 0<B and B<10:
    print(A*B)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
A, B = input().split()

if 0<A and A<10 and 0<B and B<10:
    print(A*B)
else:
    print(-1)

Fixed submission:
A, B = (int(x) for x in input().split())

if 0<A and A<10 and 0<B and B<10:
    print(A*B)
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(int(x) for x in input().split())
for i in range(N):
    minimum = A.index(i+1)
    print(minimum+1, end=" ")


Fixed submission:
N = int(input())
A = list(int(x) for x in input().split())
d = {}

for i in range(N):
    d[i] = A[i]
d_sorted = sorted(d.items(), key=lambda x:x[1])
for key, value in d_sorted:
    print(key+1, end=" ")