Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03943 (python)

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

A = [a,b,c]
A.sort()
if A[0]+A[1] == A[2]:
    print("Yes")
else:
    print("No")

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

A = [a,b,c]
A.sort()
if a+b == c:
    print("Yes")
else:
    print("No")
Problem p02690 (python)

Fixed submission:
X = int(input())
 
ans = None
 
for i in range(120):
  for j in range(120):
    if i ** 5 - j ** 5 == X:
      ans = (i, j)
    elif (i*-1) ** 5 - j ** 5 == X:
      ans = (-i, j)
    elif i ** 5 - (j*-1) ** 5 == X:
      ans = (i, -j)
print(ans[0],ans[1])

Buggy submission (verdict: Runtime Error):
X = int(input())
 
ans = None
 
for i in range(119):
  for j in range(119):
    if i ** 5 - j ** 5 == X:
      ans = (i, j)
    elif (i*-1) ** 5 - j ** 5 == X:
      ans = (-i, j)
    elif i ** 5 - (j*-1) ** 5 == X:
      ans = (i, -j)
print(ans[0],ans[1])
Problem p02705 (python)

Fixed submission:
import math

a = int(input())
print(a*math.pi*2)

Buggy submission (verdict: Runtime Error):
import math

a = int(input())
print(a*math.pi2*)
Problem p02719 (python)

Fixed submission:
N, M = map(int, input().split())
 
print(min(N % M, abs(N % M - M)))

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

print(min(N % M, abs(N % M - M))
Problem p02732 (python)

Fixed submission:
from scipy.misc import comb
from collections import Counter
import datetime

N = int(input())
num_list = list(map(int, input().split()))
# num_set = set(num_list)
num_dict = {}

num_counter = Counter(num_list)
  
# 全数あるときの組み合わせ
ans_dict_1 = {}
# 1個抜いたときの組み合わせ
ans_dict_2 = {}
rap_2 = datetime.datetime.now()
for k, v in num_counter.most_common():
  ans_dict_1[k] = comb(v,2,exact=True)
  ans_dict_2[k] = comb(v-1,2,exact=True)

total = sum(ans_dict_1.values())

for i in num_list:
  print(total - ans_dict_1[i] + ans_dict_2[i])

Buggy submission (verdict: Runtime Error):
from scipy.misc import comb

N = int(input())
num_list = list(map(int, input().split()))
num_set = set(num_list)
num_dict = {}

for i in num_set:
  if num_list.count(i) == 1:
    pass
  else:
    num_dict[i] = num_list.count(i)

# 全数あるときの組み合わせ
ans_dict_1 = {}
# 1個抜いたときの組み合わせ
ans_dict_2 = {}

for k, v in num_dict.items():
  ans_dict_1[k] = comb(v,2,exact=True)
  ans_dict_2[k] = comb(v-1,2,exact=True)

total = sum(ans_dict_1.values())

for i in num_list:
  print(total - ans_dict_1[i] + ans_dict_2[i])
Problem p02741 (python)

Fixed submission:
x = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
a = int(input())
print(x[a-1])

Buggy submission (verdict: Runtime Error):
x = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
a = int(input())
print(a[a-1])
Problem p03693 (python)

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

if (10*g + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
color_list = [0]*9

x = input()

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

for i in score_lists:
    if i < 400:
        if color_list[0] == 0:
            color_list[0] = 1
    elif i < 800:
        if color_list[1] == 0:
            color_list[1] = 1
    elif i < 1200:
        if color_list[2] == 0:
            color_list[2] = 1
    elif i < 1600:
        if color_list[3] == 0:
            color_list[3] = 1
    elif i < 2000:
        if color_list[4] == 0:
            color_list[4] = 1
    elif i < 2400:
        if color_list[5] == 0:
            color_list[5] = 1
    elif i < 2800:
        if color_list[6] == 0:
            color_list[6] = 1
    elif i < 3200:
        if color_list[7] == 0:
            color_list[7] = 1
    else:
        color_list[8] = color_list[8] + 1

ans_min = color_list[0] + color_list[1] + color_list[2] + color_list[3] + color_list[4]\
     + color_list[5] + color_list[6] + color_list[7]

if ans_min == 0 and color_list[8] != 0:
    ans_min = 1

ans_max = color_list[0] + color_list[1] + color_list[2] + color_list[3] + color_list[4]\
     + color_list[5] + color_list[6] + color_list[7] + color_list[8]

if ans_max > 8:
    ans_max = 8

print(ans_min, ans_max)
Problem p02924 (python)

Fixed submission:
def main():
    N = int(input())
    res = N*(N-1)//2
    print(res)
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    import numpy as np
    
    N = int(input())
    
    s = np.linspace(1, N-1, N-1)
    res = np.sum(s)

    print(int(res))
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    import numpy as np
    
    N = int(input())
    
    s = np.linspace(1, N, N)
    res = np.sum(s) - np.max(s)

    print(int(res))
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    import numpy as np
    
    N = int(input())
    
    s = np.linspace(1, N, N)
    res = np.sum(s) - np.max(s)

    print(int(res))
    
main()
Problem p03035 (python)

Fixed submission:
A, B = map(int,input().split())
if A > 12:
    print(B)
elif 6 <= A and A <= 12:
    print(int(B/2))
else:
    print(0)

Buggy submission (verdict: Runtime Error):
N, M = map(int,input().split())
L = [0] * M
R = [0] * M
for i in range(M):
    L[i], R[i] = map(int, input().split())

if min(R) >= max(L):
    print(min(R) - max(L) + 1)
else:
    print(0)
Problem p03944 (python)

Fixed submission:
W, H, N = list(map(int, input().split()))
A = []
for _ in range(N):
  A.append(list(map(int, input().split())))
  
xmax, xmin, ymax, ymin = W, 0, H, 0
for a in A:
  if a[2] == 1:
    xmin = max(xmin, a[0])
  if a[2] == 2:
    xmax = min(xmax, a[0])
  if a[2] == 3:
    ymin = max(ymin, a[1])
  if a[2] == 4:
    ymax = min(ymax, a[1])
    
S = (xmax-xmin) * (ymax-ymin)
if S < 0 or xmin > xmax or ymin > ymax:
  S = 0
print(S)

Buggy submission (verdict: Runtime Error):
W, H, N = list(map(int, input().split()))
A = []
for _ in range(N):
  A.append(list(map(int, input().split())))
  
xmax, xmin, ymax, ymin = W, 0, H, 0
for a in A:
  if a[2] == 1:
    xmin = max(xmin, a[0])
  if a[2] == 2:
    xmax = min(xmax, a[0])
  if a[2] == 3:
    ymin = max(ymin, a[1])
  if a[2] == 4:
    ymax = min(ymax, a[1])D
    
S = (xmax-xmin) * (ymax-ymin)
if S < 0:
  S = 0
print(S)
Problem p02936 (python)

Fixed submission:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

N, Q = map(int, input().split())
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
 
g = [[] for _ in range(N+1)]
for a,b in AB:
    g[a].append(b)
    g[b].append(a)
 
cnt = [0] * (N+1)
for p,x in PX:
    cnt[p] += x

def dfs(v, p, add):
    cnt[v] += add
    for nv in g[v]:
        if nv == p:
            continue
        dfs(nv, v, cnt[v])

dfs(1, 0, 0)

print(' '.join(map(str, cnt[1:])))

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N-1)]
PX = [list(map(int, input().split())) for _ in range(Q)]
 
g = [[] for _ in range(N+1)]
for a,b in AB:
    g[a].append(b)
    g[b].append(a)
    
cnt = [0] * (N+1)
for p,x in PX:
    cnt[p] += x

# v: node, p: parent node, add: parent value
def dfs(v, p, add):
    cnt[v] += add
    for nv in g[v]:
        if nv == p:
            continue
        dfs(nv, v, cnt[v])
 
dfs(1, 0, 0)

print(' '.join(map(str, cnt[1:])))

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
 
g = [[] for _ in range(N+1)]
for _ in range(N-1):
  a,b = map(int, input().split())
  g[a].append(b)
  g[b].append(a)
 
cnt = [0] * (N+1)
for _ in range(Q):
  p,x = map(int, input().split())
  cnt[p] += x

def dfs(v, p, add):
    cnt[v] += add
    for nv in g[v]:
        if nv == p:
            continue
        dfs(nv, v, cnt[v])

dfs(1, 0, 0)

print(' '.join(map(str, cnt[1:])))

Buggy submission (verdict: Runtime Error):
#import sys
#input = sys.stdin.readline
#sys.setrecursionlimit(10**6)

N, Q = map(int, input().split())
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
 
g = [[] for _ in range(N+1)]
for a,b in AB:
    g[a].append(b)
    g[b].append(a)
 
cnt = [0] * (N+1)
for p,x in PX:
    cnt[p] += x

def dfs(v, p, add):
    cnt[v] += add
    for nv in g[v]:
        if nv == p:
            continue
        dfs(nv, v, cnt[v])

dfs(1, 0, 0)

print(' '.join(map(str, cnt[1:])))

Buggy submission (verdict: Runtime Error):
N, Q = map(int, input().split())
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
 
g = [[] for _ in range(N+1)]
for a,b in AB:
    g[a].append(b)
    g[b].append(a)
    
cnt = [0] * (N+1)
for p,x in PX:
    cnt[p] += x

# v: node, p: parent node, add: parent value
def dfs(v, p, add):
    cnt[v] += add
    for nv in g[v]:
        if nv == p:
            continue
        dfs(nv, v, cnt[v])
 
dfs(1, 0, 0)

print(' '.join(map(str, cnt[1:])))
Problem p04043 (python)

Fixed submission:
def canConstructHaiku(arr):
  arr.sort()
  if arr[0] == 5 and arr[1] == 5 and arr[2] == 7:
    return True
  return False
 
arr = list(map(int, input().split()))
print("YES" if canConstructHaiku(arr) else "NO")

Buggy submission (verdict: Runtime Error):
def canConstructHaiku(arr):
	arr.sort()
 	if arr[0] == 5 and arr[1] == 5 and arr[2] == 7:
    	return True
    return False

arr = list(map(int, input().split()))
print("YES" if canConstructHaiku(arr) else "NO")
Problem p03166 (python)

Fixed submission:
import sys
sys.setrecursionlimit(10**9)
def path(start):
    if dp[start]!=-1:
        return dp[start]
    visited[start]=1
    maxi=-1
    for i in adjacency_list[start]:
        maxi=max(maxi,path(i))
    dp[start]=maxi+1
    return dp[start]
N,M=map(int,input().split())
dp=[-1]*(N+1)
visited=[0]*(N+1)
adjacency_list=[]
for i in range(N+1):
    adjacency_list.append([])
# print(adjacency_list)
for r in range(M):
    u,v=map(int,input().split())
    adjacency_list[u].append(v)
# print(adjacency_list)
for i in range(1,N+1):
    if len(adjacency_list[i])==0:
        dp[i]=0
# print(dp)
for i in range(1,N+1):
    if (visited[i]==0):
        path(i)
print(max(dp))

Buggy submission (verdict: Runtime Error):
def path(start):
    if dp[start]!=-1:
        return dp[start]
    visited[start]=1
    maxi=-1
    for i in adjacency_list[start]:
        maxi=max(maxi,path(i))
    dp[start]=maxi+1
    return dp[start]
N,M=map(int,input().split())
dp=[-1]*(N+1)
visited=[0]*(N+1)
adjacency_list=[]
for i in range(N+1):
    adjacency_list.append([])
# print(adjacency_list)
for r in range(M):
    u,v=map(int,input().split())
    adjacency_list[u].append(v)
# print(adjacency_list)
for i in range(1,N+1):
    if len(adjacency_list[i])==0:
        dp[i]=0
# print(dp)
for i in range(1,N+1):
    if (visited[i]==0):
        path(i)
print(max(dp))
Problem p03130 (python)

Fixed submission:
'''input
4 2
1 3
2 3
'''
import time
import math
l = [[] for i in range(5)]
flag = 0
for i in range(3):
	a, b = map(int, input().strip().split())
	l[a].append(b)
	l[b].append(a)
for i in range(1, 5):
	if(len(l[i]) > 2):
		flag = 1
		break
print("YES" if not flag else "NO")

Buggy submission (verdict: Runtime Error):
'''input

'''
import time
import math
l = [[0] for i in range(5)]
for i in range(4):
	a, b = map(int, input().strip().split())
	l[a].append(b)
	l[b].append(a)
for i in range(1, 5):
	if(len(l[i]) > 2):
		flag = 1
		break
print("YES" if flag else "NO")
Problem p03197 (python)

Fixed submission:
'''input
3
1
30000
20000
'''
import time
import math

n = int(input())
print("second" if all([int(input()) % 2 == 0 for i in range(n)]) else "first")

Buggy submission (verdict: Runtime Error):
print("second" if all([int(input()) % 2 == 0 for i in range(input())]) else "first")
Problem p02802 (python)

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

WAnum = 0
ACnum = 0

WA = [0] * N
AC = [0] * N

for i in range(M):
    num = p[i] - 1
    # 未得点のときだけ影響
    if(AC[num] >= 1):
        continue

    if(S[i] == 'WA'):
        WA[num] += 1

    elif(S[i] == 'AC'):
        AC[num] = 1
        ACnum += 1
        WAnum += WA[num]

print(ACnum, WAnum)

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

dp = [[0] * 2 for i in range(N)]  # x問目の、score, 正答までのwrong_ans                                               #dp = [[0] * 2 for i in range(100005)]  # x問目の、score, penalty

for i in range(M):
    num = p[i] - 1
    # 未得点のときだけ影響
    if(dp[num][0] == 0):
         if(S[i] == 'WA'):
             dp[num][1] += 1
             continue

         elif(S[i] == 'AC'):
             dp[num][0] += 1
             continue
         else:
             print("S is ??")

score = 0
penalty = 0
for i in range(len(dp)):
    score += dp[i][0]
    penalty += dp[i][1]

print(score, penalty)
~

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

penalty = 0
right_ans = 0

dp = [[0] * 2 for i in range(N)]  # x問目の、score, penalty

for i in range(M):

    # 得点済
    if(dp[p[i]][0] > 0):
        continue

    if(S[i] == 'AC'):
        dp[p[i]][0] += 1
        continue

    elif(S[i] == 'WA'):
        dp[p[i]][1] += 1

print(right_ans, penalty)

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

p = [0] * M
S = [''] * M


for i in range(M):
    p[i], S[i] = input().split()
    p[i] = int(p[i])

penalty = 0
right_ans = 0

dp = [[0] * 2 for i in range(N)]  # x問目の、score, penalty

for i in range(M):

    # 得点済
    if(dp[p[i]][0] > 0):
        continue

    if(S[i] == 'AC'):
        dp[p[i]][0] += 1
        continue

    elif(S[i] == 'WA'):
        dp[p[i]][1] += 1

print(right_ans, penalty)
Problem p02981 (python)

Fixed submission:
n,a,b = map(int,input().split())
print(min(n*a,b))

Buggy submission (verdict: Runtime Error):
n,a.b = map(int,input().split())
print(min(4*a,b))
Problem p02765 (python)

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

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

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
MOD = 10**9+7

def comb(n, r):
    x = 1; y = 1
    for i in range(r):
        x *= n-i
        y *= r-i
    return x*pow(y, MOD-2, MOD)

print(pow(2, n, MOD)-1 -comb(n, a) -comb(n, b))

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

if N > 10:
    print(R)
else:
    print(R-100*(10-K))

Buggy submission (verdict: Runtime Error):
, R = map(int, input().split())

if N > 10:
    print(R)
else:
    print(R+100*(10-N))
Problem p02772 (python)

Fixed submission:
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(MI())
def LIR(n): return [LI() for i in range(n)]
def S(): return input().rstrip()

def main():
    N = I(); A = LI(); judge=True
    for i in A:
        if i%2==0:
            if i%3!=0 and i%5!=0:
                judge=False
    if judge:
        print('APPROVED')
    else:
        print('DENIED')
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(MI())
def LIR(n): return [LI() for i in range(n)]
def S(): return input().rstrip()

def main():
    N = I(); A = LI(); judge=True
    for i in A:
        if A%2==0:
            if A%3!=0 or A%5!=0:
                judge=False
    if judge:
        print('APPROVED')
    else:
        print('DENIED')
if __name__ == '__main__':
    main()
Problem p02687 (python)

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

def main():
# 整数の入力
    
    s = input()
    # 出力
    if s == "ABC":
        print("ARC")
    if s == "ARC":
        print("ABC")

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import math
def main():
# 整数の入力
    x = int(input())
    a = 0
    b = 0
    while True:
        y = 0
        y5_x = math.pow(b, 5)
        y = math.pow(y5_x - x, -5)
        
        y = int(y)
        if math.pow(y, 5) + x == y5_x:
            a = y
            break
        else:
            b += 1

    print(f"{b} {a}")

if __name__ == '__main__':
    main()
Problem p03729 (python)

Fixed submission:
# -*- coding: utf-8 -*-
def shiritori(a, b):
    return a[len(a)-1:] == b[:1]


a, b, c = input().split()
if shiritori(a, b) is True and shiritori(b, c) is True:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
def shiritori(a, b):
    return a[len(a)-1:] == b[:1]


a, b, c = map(input().split())
if shiritori(a, b) is True and shiritori(b, c) is True:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
def shiritori(a, b):
    return a[len(a)-1:] == b[:1]


a, b, c = map(int, raw_input().split())
if shiritori(a, b) is True and shiritori(b, c) is True:
    print("YES")
else:
    print("NO")
Problem p03731 (python)

Fixed submission:
n, t = map(int, input().split(' '))
tlist = list(map(int, input().split(' ')))

sum_time = 0
for i in range(1, len(tlist)):
    delta = tlist[i] - tlist[i-1]
    shower = delta if delta <= t else t
    sum_time += shower
sum_time += t
print(sum_time)

Buggy submission (verdict: Runtime Error):
n, t = map(int, input().split(' '))
tlist = map(int, input().split(' '))

sum_time = 0
for i in range(1, len(tlist)):
    delta = tlist[i] - tlist[i-1]
    shower = delta if delta <= t else t
    sum_time += shower
sum_time += t
print(sum_time)
Problem p02683 (python)

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

import numpy as np

vals = []
for i in range(N):
    v = list(map(int, input().split(" ")))
    vals.append(v)

vals = np.array(vals)

import itertools

prod = []
for i in range(1, N+1):
    v = list(itertools.combinations(range(N), i))
    prod.extend(v)
    
money = 1e10

for p in prod:
    ans = np.zeros(M+1)
    
    for p_ in p:
        ans += vals[p_]
    
    flag = True
    for j in range(M):
        if ans[1+j] < X:
            flag = False
    if flag:
        if money > ans[0]:
            money = ans[0]
 
if money >= 1e10:
    print(-1)
else:
    print(int(money))

Buggy submission (verdict: Runtime Error):
N, M, X = list(map(int, input().split(" ")))

import numpy as np

vals = []
for i in range(N):
    v = list(map(int, input().split(" ")))
    vals.append(v)

vals = np.array(vals)

import itertools

prod = []
for i in range(1, N+1):
    v = list(itertools.combinations(range(N), i))
    prod.extend(v)
    
money = 1e8

for p in prod:
    ans = np.zeros(4)
    for p_ in p:
        ans += vals[p_]
    if (ans[1] >= X) and (ans[2] >= X) and (ans[3] >= X):
        if money > ans[0]:
            money = ans[0]
 
if money >= 1e8:
    print(-1)
else:
    print(int(money))
Problem p02684 (python)

Fixed submission:
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
 
import numpy as np
 
 
 
Nstock = np.zeros(N)
 
cpos = 1
Nstock[cpos - 1] = 1
stock = [cpos]
loop = []
 
idx = 0
for i in range(K):
    cpos = A[cpos-1]
    if Nstock[cpos - 1]  == 1:
        idx = stock.index(cpos)
        loop = stock[idx:]
        break
    Nstock[cpos - 1] = 1
    stock.append(cpos)
    
if loop != []:
    v = (K - idx) 
    a = v %len(loop)
    print(loop[a])
else:
    print(stock[K])

Buggy submission (verdict: Runtime Error):
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))

import numpy as np



Nstock = np.zeros(N)

cpos = 1
Nstock[cpos - 1] = 1
stock = [cpos]
loop = []

idx = 0
for i in range(K):
    cpos = A[cpos-1]
    if Nstock[cpos - 1]  == 1:
        idx = stock.index(cpos)
        loop = stock[idx:]
        break
    Nstock[cpos - 1] = 1
    stock.append(cpos)
    
v = (K - idx) 
a = v %len(loop)

print(loop[a])
Problem p02741 (python)

Fixed submission:
v = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
print(v[k-1])

Buggy submission (verdict: Runtime Error):
import numpy as np

a, b, c = map(np.float64, input().split(" "))

if (np.sqrt(a) + np.sqrt(b)) < np.sqrt(c):
    print("Yes")
else:
    print("No")
Problem p02830 (python)

Fixed submission:
# -*- coding:utf-8 -*-
N=int(input())
S,T=map(str,input().split())
ans=""
for i in range(N):
    ans=ans+S[i]+T[i]
print(ans)

Buggy submission (verdict: Runtime Error):
# -*- coding:utf-8 -*-
N=int(input())
S,T=map(str,input().split())
for i in range(N):
    ans=ans+S[i]+T[i]
print(ans)
Problem p03000 (python)

Fixed submission:
# -*- coding: utf-8 -*-
n,x=map(int,input().split())
L=input().split()
L=[int(i) for i in L]
count=0
l=0
while l<=x:
    if count>n-1:
        count=count+1
        break
    else:
        l=l+L[count]
        count=count+1
print(count)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n,x=map(int,input().split())
L=input().split()
L=[int(i) for i in L]
count=0
l=0
while l<=x:
    l=l+L[count]
    count=count+1
print(count)
Problem p03006 (python)

Fixed submission:
# -*- coding: utf-8 -*-
n=int(input())
x=[]
y=[]
total=[]
count=[]
for _ in range(n):
    x1,y1=map(int,input().split())
    x.append(x1)
    y.append(y1)
for i in range(n):
    for j in range(n):
        if i==j:
            continue
        else:
            temporary=(x[i]-x[j],y[i]-y[j])
            if temporary in total:
                count[total.index(temporary)]=count[total.index(temporary)]+1
            else:
                total.append(temporary)
                count.append(0)
if n==1:
    print(1)
else:
    print(n-max(count)-1)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n=int(input())
x=[]
y=[]
total=[]
count=[]
for _ in range(n):
    x1,y1=map(int,input().split())
    x.append(x1)
    y.append(y1)
for i in range(n):
    for j in range(n):
        if i==j:
            continue
        else:
            temporary=(x[i]-x[j],y[i]-y[j])
            if temporary in total:
                count[total.index(temporary)]=count[total.index(temporary)]+1
            else:
                total.append(temporary)
                count.append(0)
print(n-max(count)-1)

Buggy submission (verdict: Runtime Error):
# # -*- coding: utf-8 -*-
N=int(input())
X=[]
Y=[]
for _ in range(N):
    x,y=map(int,input().split())
    X.append(x)
    Y.append(y)
Z=[]
for i in range(N):
    for j in range(i+1,N):
        Z=Z+[(abs(X[i]-X[j]),abs(Y[i]-Y[j]))]
import collections
z=collections.Counter(Z)
print(N-z.most_common()[0][1])
Problem p03030 (python)

Fixed submission:
# -*- coding: utf-8 -*-
N=int(input())
restaurant=[]
for i in range(N):
    s,p=input().split()
    restaurant.append((i+1,s,int(p)))
restaurant.sort(key=lambda x:(x[1],-x[2]))
for j in range(N):
    print(restaurant[j][0])

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n=int(input())
A=[]
for i in range(n):
    a=(i+1,)+tuple(input().split())
    A.append(a)
A.sort(key=lambda x:(-x[1],x[2]),reverse=True)
for m in range(n):
    print(A[m][0])
Problem p02694 (python)

Fixed submission:
X = int(input())

year = 1
n = 100
while True:
    if n >= X:
        print(year-1)
        exit()
    n = int(n * 1.01)
    year += 1

Buggy submission (verdict: Runtime Error):
year = 1
n = 100
while True:
    if n >= X:
        print(year-1)
        exit()
    n = int(n * 1.01)
    year += 1