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

Fixed submission:
H = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] <= 0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] =< 0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
H, N = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
    H = H -A[i]
if H =< 0:
    print('Yes')
else:
    print('No')
Problem p02811 (python)

Fixed submission:
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    print("")

Buggy submission (verdict: Runtime Error):
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:

Buggy submission (verdict: Runtime Error):
huga = list(map(int, input().split()))
if huga[0]*500 - huga[1] >= 0:
    print(Yes)
elif huga[0]*500 - huga[1] > 0:
    print(No)
else:
Problem p02817 (python)

Fixed submission:
ST = input().split()
print(ST[1] + ST[0], sep = "")

Buggy submission (verdict: Runtime Error):
ST = split.input()
print(ST[1] + ST[0], sep = "")
Problem p02830 (python)

Fixed submission:
N = int(input())
Slist = input().split()
A = Slist[0]
B = Slist[1]

for i in range (N):
	print(A[i],B[i], end='',sep='')

Buggy submission (verdict: Runtime Error):
N = int(input())
S,T = input().split()
A = []
B = []
A = list(S)
B = list(T)
for i in range(N)
	print(A[i],B[i], end='')
Problem p02848 (python)

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


def encrypt(S, N):
    X = ""

    for ch in list(S):
        if 'A' <= ch <= 'Z':
            X += chr((ord(ch) - ord('A') + int(N)) % 26 + ord('A'))
        elif 'a' <= ch <= 'z':
            X += chr((ord(ch) - ord('a') + int(N)) % 26 + ord('a'))
        else:
            X += ch

    return X

# 暗号化
X = encrypt(S, N)
print(X)

Buggy submission (verdict: Runtime Error):
# 数字
N = int(input())

# 文字
S = input()

AAA = ""

for char in list(S):
    hoge = ord(char)
    huga = hoge - 97
    huga = (huga + N) % 26
    hoge = num + 97
    AAA += chr(hoge)

print()

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

# 文字
S = input()

AAA = ""

for char in list(S):
    hoge = ord(char)
    huga = hoge - 97
    huga = (huga + S) % 26
    hoge = num + 97
    AAA += chr(hoge)

print()
Problem p02953 (python)

Fixed submission:
n = int(input())
lst = [int(i) for i in input().split()]

lst[0] -=1
for i in range(1,len(lst)):
    if (lst[i-1] != lst[i]) or (lst[i-1] > lst[i]):
        lst[i] -= 1

flag = 0
for i in range(len(lst)-1):
    if (lst[i] <= lst[i + 1]) & (flag==0):
        flag = 0
    else:
        flag = 1

if len(lst) == 1:
    flag = 1


if flag == 0:
    print('Yes')
else:
    if len(lst) == 1:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
lst = [int(i) for i in input().split()]

flag = 0

for i in range(0,len(lst)-1):
    if lst[i]-1 == lst[i+1]:
        lst[i] = lst[i] - 1
        print(lst)


if flag == 0:
    for i in range(0,len(lst)-1):
        if (lst[i] <= lst[i+1])&(flag==0):
            print(str(lst[i])+'<='+str(lst[i+1]))
            flag = 0
        else:
            flag = 1


print(lst)
if flag == 0:
    print('Yes')
else:
    print('No')
Problem p02957 (python)

Fixed submission:
a, b = map(int, input().split())
def kansu_return_flag(a,b):
    ans = 0
    flag = 0

    if abs(a-b)%2 != 0:
        flag = 0
    else:
        ans = (a+b)/2
        flag = 1
    return flag,ans

flag,ans = kansu_return_flag(a,b)

if flag == 1:
    print(int(ans))
else:
    print('IMPOSSIBLE')

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
def kansu_return_flag(a,b):
    
    flag = 0
    if a>b:
        big = a
        small = b
    else:
        big = b
        small = a
        
    for i in range(small,big):
        a_ans = abs(big-i)
        b_ans = abs(small-i)
        if a_ans == b_ans:
            ans = i
            flag = 1
            break
    return flag,ans

flag,ans = kansu_return_flag(a,b)

if flag == 1:
    print(ans)
else:
    print('IMPOSSIBLE')

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
def kansu_return_flag(a,b):
    
    flag = 0
    if a>b:
        big = a
        small = b
    else:
        big = b
        small = a
        
    for i in range(big):
        a_ans = abs(big-i)
        b_ans = abs(small-i)
        if a_ans == b_ans:
            ans = i
            flag = 1
            break
    return flag

flag = kansu_return_flag(a,b)

if flag == 1:
    print(ans)
else:
    print('IMPOSSIBLE')

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

def kansu_return_flag(a,b):
    
    flag = 0

    for i in range(10**9):
        a_ans = abs(a-i)
        b_ans = abs(b-i)
        if a_ans == b_ans:
            ans = i
            flag = 1
            break
    return flag

flag = kansu_return_flag(a,b)

if flag == 1:
    print(ans)
else:
    print('IMPOSSIBLE')
Problem p02783 (python)

Fixed submission:
hp_list = input().split(" ")
h = int(hp_list[0])
a = int(hp_list[1])
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1

count = int(count)
print(count)

Buggy submission (verdict: Runtime Error):
hp_list = input().split(" ")
h = hp_list[0]
a = hp_list[1]
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1
 
print(count)
Problem p03296 (python)

Fixed submission:
def main():
    N = int(input())
    slimes = list(map(int, input().split()))
    ans = 0

    for i in range(1, N):
        if slimes[i-1] == slimes[i]:
            slimes[i] = 10001 + ans
            # assert slimes[i] != slimes[i-1]                                 
            # assert slimes[i] != slimes[i+1]                                 
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    N = int(input())
    slimes = list(map(int, input().split()))
    ans = 0

    for i in range(1, N):
        if slimes[i-1] == slimes[i]:
            slimes[i] = 10001 + ans
            assert slimes[i] != slimes[i-1]
            assert slimes[i] != slimes[i+1]
            ans += 1

    print(ans)


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

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

import os
import sys
import math
import numpy as np


N = int(input())
A = np.array([int(input()) for i in range(N)])

counter = {}

for a in A:
    if a in counter.keys():
        counter[a] = abs(counter[a] - 1)
    else:
        counter[a] = 1

print(sum(counter.values()))

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

import os
import sys
import math
import numpy as np


N = int(input())
A = np.array([int(input()) for i in range(N)])

counter = np.zeros(np.max(A)+1)

for a in A:
    counter[a] += 1

counter %= 2

print(int(np.sum(counter)))
Problem p03695 (python)

Fixed submission:
import sys


if __name__ == "__main__":
    N = int(input())

    rates = map(int, raw_input().split())
    # rates = [map(int, raw_input().split()) for i in range(N)]

    # tasks = np.array(tasks)
    normal_colors = int(3200/400)
    colors = [0] * normal_colors
    aaa = 0
    for rate in rates:
        if rate >= 3200:
            aaa +=1
        else:
            colors[rate/400] = 1

    print max(sum(colors),1), sum(colors)+aaa

Buggy submission (verdict: Runtime Error):
import sys


if __name__ == "__main__":
    N = int(input())

    rates = [map(int, raw_input().split()) for i in range(N)]
    # tasks = np.array(tasks)
    normal_colors = int(3200/400)
    colors = [None] * normal_colors
    any = 0
    for rate in rates:
        if rate >= 3200:
            any +=1
        else:
            colors[rate/400] = 1
    print(sum(colors), sum(colors)+any)
Problem p03759 (python)

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

import os
import sys
import math
import numpy as np

a, b, c = map(int, input().split())
if (b - a) == (c - b):
    print('YES')
else:
    print('NO')

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

import os
import sys
import math
import numpy as np

n, m = map(int, input().split())
X = input().split()
X = list(map(int, X))
Y = input().split()
Y = list(map(int, Y))


# 1 つの最小長方形は (n-1)*(m-1) 回加算される

S = 0
mod = 10 ** 9 + 7

for x in range(n-1):
	for y in range(m-1):
		var = (X[x+1]-X[x]) * (Y[y+1]-Y[y])
		# print(var)
		x_times = (x+1) * (n-x-1)
		y_times = (y+1) * (m-y-1)

		S += ((var * x_times * y_times) % mod)


print(S%mod)

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

import os
import sys
import math
import numpy as np

O = input()
E = input()
ans = ''
for i in range(len(E)):
    ans += O[i]
    ans += E[i]

if len(O) != len(E):
    ans += O[-1]

print(ans)
Problem p02823 (python)

Fixed submission:
n,a,b = list(map(int,input().split()))
z=b-a
if z%2==1:
    print(min(a-1,n-b)+1+(z-1)//2)
else:
    print(z//2)

Buggy submission (verdict: Runtime Error):
n,a,b = list(map(int,input().split()))
if (b-a)%2==1:
    if a-1 > n-b:
        q=n-b+1
        z=n-q
        print((q+z)/2
    else:
        z=b-a
        print((z-1)/2)
Problem p02767 (python)

Fixed submission:
n = int(input())
x = list(map(int, input().strip().split()))
alist=[]
pm=10e9
for p in range (min(x),max(x)+1):
    ans=0
    for xi in x:
        ans += (xi-p)**2

    if(ans<pm):
        pm=ans
print(pm)

Buggy submission (verdict: Runtime Error):
n = int(input())
x = list(map(int, input().strip().split()))
alist=[]
for p in range (min(x),max(x)):
    ans=0
    for xi in x:
        ans += (xi-p)**2
    alist.append(ans)
    
print(min(alist))
Problem p02817 (python)

Fixed submission:
s = input().split()

print(s[1]+s[0])

Buggy submission (verdict: Runtime Error):
import math
n = int(input()) 

def is_prime(n):
    if n == 1: return True

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
    return True

if(is_prime(n)):
    print(n)
else:
    while(is_prime(n) == False):
        n = n + 1
        is_prime(n)
    print(n)
Problem p02830 (python)

Fixed submission:
length =int(input())

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

result = ""

list_s = list(s)
list_t = list(t)

for i in range(length):
  result = result + list_s[i]
  result = result + list_t[i]
  #result = result + s + list_t[i]
 
print(result)

Buggy submission (verdict: Runtime Error):


length =int(input())

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

result = ""

for i in s:
  list_t = list(t)
  result = result + s + list_t[i]
 
print(result)
Problem p03433 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = int(input())


if n < 500:
    if n <= a:
        print('Yes')
    else:
        print('No')
else:    
    amari = n%500
    if amari <= a:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = int(input())
# スペース区切りの整数の入力
# b, c = map(int, input().split())
# 文字列の入力
# s = input()
# # 出力
# print("{} {}".format(a+b+c, s))

if n < 500:
    if n > a:
        print('Yes')
    else:
        print('No')
else:    
    amari = n%500

    if amari =< a:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = int(input())
# スペース区切りの整数の入力
# b, c = map(int, input().split())
# 文字列の入力
# s = input()
# # 出力
# print("{} {}".format(a+b+c, s))

amari = n%500

if amari =< a:
    print('Yes')
else:
    print('No')
Problem p02786 (python)

Fixed submission:
def f(hp):
    if hp == 1:
        return 1
    return 2 * f(int(hp/2)) + 1

H = int(input())
print(f(H))

Buggy submission (verdict: Runtime Error):
H = int(input())

def f(hp):
    if hp == 1:
        return 1
    return f(hp/2)*2+1

print(f(H))
Problem p02801 (python)

Fixed submission:
c = input()
ans = chr(ord(c)+1)
print(ans)

Buggy submission (verdict: Runtime Error):
k,x = map(int,input().split())
a = 500*k
if a >= x:
    print('Yes')
else:
    print('No')
Problem p02838 (python)

Fixed submission:
n = int(input())
A = [int(i) for i in input().split()]

s = [0]*61
for a in range(n):
    for i in range(61):
        if(A[a]>>i&1)==1:
            s[i+1] += 1
ans = 0
for i in range(60):
    # print("a",2**(i-1)*s.get(i,0)*(n-s.get(i,0)))
    # print("b",s.get(i,0))
    # print("c",(n-s.get(i,0)))
    ans += 2**(i)*s[i+1]*(n-s[i+1])
ans = ans % (10**9+7)
print(int(ans))
# print(s)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(i) for i in input().split()]

# s = [0]*61
# for a in A:
#     for i in range(61):
#         # print(cnt,a)
#         if(a>>i&1)==1:
#             s[i+1] += 1
ans = 0
for i in range(61):
    # print("a",2**(i-1)*s.get(i,0)*(n-s.get(i,0)))
    # print("b",s.get(i,0))
    # print("c",(n-s.get(i,0)))
    ans += 2**(i-1)*s[i]*(n-s[i])
ans = ans % (10**9+7)
print(int(ans))
# print(s)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(i) for i in input().split()]

s = [0]*60
for a in A:
    cnt = 0
    while a != 0:
        # print(cnt,a)
        if(a&1)==1:
            s[cnt+1] += 1
        cnt+=1
        a = a >> 1
ans = 0
for i in range(60):
    # print("a",2**(i-1)*s.get(i,0)*(n-s.get(i,0)))
    # print("b",s.get(i,0))
    # print("c",(n-s.get(i,0)))
    ans += (2**(i-1)*s[i]*(n-s[i])) % (10**9+7)
ans = ans % (10**9+7)
print(int(ans))
# print(s)

Buggy submission (verdict: Runtime Error):
n = int(input())
A = [int(i) for i in input().split()]

s = [0]*60
for a in A:
    cnt = 0
    while a != 0:
        # print(cnt,a)
        if(a&1)==1:
            s[cnt+1] += 1
        cnt+=1
        a = a >> 1
ans = 0
for i in range(60):
    # print("a",2**(i-1)*s.get(i,0)*(n-s.get(i,0)))
    # print("b",s.get(i,0))
    # print("c",(n-s.get(i,0)))
    ans += (2**(i-1)*s.get(i,0)*(n-s.get(i,0))) % (10**9+7)
ans = ans % (10**9+7)
print(int(ans))
# print(s)
Problem p02839 (python)

Fixed submission:
H, W = [int(x) for x in input().split()]
 
A = [[0]*W for i in range(H)]
for c in [1, -1]:
    for i in range(H):
        arr = [int(x) for x in input().split()]
        for j in range(W):
            A[i][j] += arr[j] * c
 
M = 160*80
dp = [[0]*W for i in range(H)]
dp[0][0] = 1 << M
for i in range(H):
    for j in range(W):
        if i > 0:
            dp[i][j] |= dp[i-1][j]
        if j > 0:
            dp[i][j] |= dp[i][j-1]
        a = abs(A[i][j])
        dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a)
 
ans = M
for i in range(2*M):
    if dp[H-1][W-1] & (1 << i) > 0:
        ans = min(ans, abs(M-i))
print(ans)

Buggy submission (verdict: Runtime Error):
H, W = [int(x) for x in input().split()] A = [[0]*W for i in range(H)] for c in [1, -1]: for i in range(H): arr = [int(x) for x in input().split()] for j in range(W): A[i][j] += arr[j] * c M = 160*80 dp = [[0]*W for i in range(H)] dp[0][0] = 1 << M for i in range(H): for j in range(W): if i > 0: dp[i][j] |= dp[i-1][j] if j > 0: dp[i][j] |= dp[i][j-1] a = abs(A[i][j]) dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a) ans = M for i in range(2*M): if dp[H-1][W-1] & (1 << i) > 0: ans = min(ans, abs(M-i)) print(ans)
Problem p02843 (python)

Fixed submission:
def solve():
    x = int(input())
    s = str(x)
    if x < 100:
        return print(0)
    s2s = ''.join(([s[-2],s[-1]]))
    s2 = int(s2s)
    # print(s2)

    x1 = s2 // 5
    # print(x1)
    if s2 % 5 == 0:
        n = x1
    else:
        n = x1+1
    # print(n)
    if 100*n > x:
        print(0)
    else:
        print(1)
solve()

Buggy submission (verdict: Runtime Error):
x = int(input())
s = str(x)
if x < 100:
    print(0)
s2s = ''.join(([s[-2],s[-1]]))
s2 = int(s2s)
# print(s2)

x1 = s2 // 5
# print(x1)
if s2 % 5 == 0:
    n = x1
else:
    n = x1+1
# print(n)
if 100*n > x:
    print(0)
else:
    print(1)

Buggy submission (verdict: Runtime Error):
x = int(input())
s = str(x)
s2s = ''.join(([s[-2],s[-1]]))
s2 = int(s2s)
# print(s2)

x1 = s2 // 5
# print(x1)
if s2 % 5 == 0:
    n = x1
else:
    n = x1+1
# print(n)
if 100*n > x:
    print(0)
else:
    print(1)
Problem p02885 (python)

Fixed submission:
lis = [ int(i) for i in input().split()]
a = lis[0]
b = lis[1]
if b*2 > a:
  print(0)
else:
  print(a - b*2)

Buggy submission (verdict: Runtime Error):
lis = [ int(i) for i in input().split]
a = lis[0]
b = lis[1]
if b*2 > a:
  print(0)
else:
  print(a - b*2)
Problem p02886 (python)

Fixed submission:
n = int(input())
lis = [int(i) for i in input().split()]
sum = 0
for i in range(n-1):
  for j in range(i+1,n):
    sum += lis[i]*lis[j]
print(sum)

Buggy submission (verdict: Runtime Error):
n = int(input())
lis = [int(i) for i in input().split()]
sum = 0
for i in range(n-1):
  for j in range(i+1,n):
    sum += i*J
print(sum)
Problem p02898 (python)

Fixed submission:
n,k = map(int,input().split())
lis = [int(i) for i in input().split()]

c = 0
for i in lis:
        if i >= k:
            c += 1
print(c)

Buggy submission (verdict: Runtime Error):
n,k = map(int,input().split())
lis = [int(e) for i in input().split()]

c = 0
for i in lis:
        if i >= e:
            c += 1
print(c)

Buggy submission (verdict: Runtime Error):
n,k = map(int,input().split())
lis = [int(e) for i in input().split()]
c = 0
for i in lis:
  if i >= k:
    c += 1
print(c)
Problem p03035 (python)

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

ans = 0
if a <= 5:
    ans = 0
elif a <= 12:
    ans = b/2
else :
    ans = b
print(int(ans))

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

ans = 0
if a < = 5:
    ans = 0
elif a < = 12:
    ans = b/2
else :
    ans = b
print(ans)
Problem p03555 (python)

Fixed submission:
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

def get_row():
    array = []
    txt = raw_input()

    for char in txt:
        array.append(char)

    return array

# defined & initial arrays
cells_top = []
cells_bottom = []

# get cells
cells_top = get_row()
cells_bottom = get_row()

p_dbg(cells_top)
p_dbg(cells_bottom)

# reverse
cells_top.reverse()

p_dbg(cells_top)

# Decision
if(cells_top == cells_bottom):
    print 'YES'
else:
    print 'NO'

Buggy submission (verdict: Runtime Error):
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

# 1st. get Num

Num = int(raw_input())

p_dbg('Num : ' + str(Num))

square_max = 1

# MEMORY OVER
# for i in range(1, Num):
#     tmp = i * i
#     p_dbg(str(i) + str(square_max))
#     if(tmp <= Num):
#         square_max = tmp
#     else:
#         break

i = 1
tmp = 1
while tmp < Num:
    p_dbg(str(i) + ':' + str(square_max))
    square_max = tmp
    tmp = i*i
    i = i+1

print square_max
Problem p03556 (python)

Fixed submission:
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

# 1st. get Num

Num = int(raw_input())

p_dbg('Num : ' + str(Num))

square_max = 1

# MEMORY OVER
# for i in range(1, Num):
#     tmp = i * i
#     p_dbg(str(i) + str(square_max))
#     if(tmp <= Num):
#         square_max = tmp
#     else:
#         break

i = 1
tmp = 1
while tmp <= Num:
    p_dbg(str(i) + ':' + str(square_max))
    square_max = tmp
    tmp = i*i
    i = i+1

print square_max

Buggy submission (verdict: Runtime Error):
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

# 1st. get Num

Num = int(raw_input())

p_dbg('Num : ' + str(Num))

square_max = 1

for i in range(1, Num):
    tmp = i * i
    p_dbg(str(i) + str(square_max))
    if(tmp <= Num):
        square_max = tmp
    else:
        break

print square_max
Problem p03455 (python)

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

print("Even" if a*b%2==0 else "Odd")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=int(a*b)
if c%2==1:
  print("Odd")
else:
  print("Even")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=(a*b)
if c%2==1:
  print("Odd")
else c%2==0:
  print("Even")
Problem p03493 (python)

Fixed submission:
print(input().count("1"))

Buggy submission (verdict: Runtime Error):
S=input()
print(S.count(1))
Problem p03573 (python)

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

if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)

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

if a==b:
    print(c)
elif a==c:
    print(b)
else:
    print(a)
Problem p03605 (python)

Fixed submission:
a=input()

if "9" in a:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b=input()
LIST=[a,b]
if "9" in LIST:
  print("Yes")
else:
  print("No)

Buggy submission (verdict: Runtime Error):
a,b=input().split()
LIST=[a,b]
if "9" in LIST:
  print("Yes")
else:
  print("No)
Problem p03679 (python)

Fixed submission:
x,a,b=map(int,input().split())
 
if b-a<=0:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")

Buggy submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
 
if b-a<=o:
    print("delicious")
elif b-a<=x:
    print("safe")
else:
    print("dangerous")
Problem p03795 (python)

Fixed submission:
a=int(input())
 
print(a*800-200*(a//15))

Buggy submission (verdict: Runtime Error):
=int(input())

print(a*800-200*(a//15))
Problem p03998 (python)

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

card={"a":A,"b":B,"c":C}
answer={"a":"A","b":"B","c":"C"}
turn="a"

while True:
    if len(card[turn])==0:
        break
    next_turn=card[turn][0]
    card[turn]=card[turn][1:]
    turn=next_turn

print(answer[turn])

Buggy submission (verdict: Runtime Error):
A=input())
B=input())
C=input())

card={a:A,b:B,c:C}
answer=["a":"A","b":"B","c":"C"]
turn="a"

while True:
    if len(card[turn])==0:
        break
    next_turn=card[turn][0]
    card[turn]=card[turn][1:]
    turn=next_turn

print(answer[turn])
Problem p04043 (python)

Fixed submission:
a,b,c,=map(int,input().split())
if a+b+c==17:
  print("YES")
else:
  print("NO")

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

List=[]
for i in range(a):
    List.append(input())

print("".join(sorted(List)))

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

List=[]
for i in range(a):
    List.append(input())

print("".join(sorted(List)))

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

List=[]
for i in range(a):
    List.append(input)

print("".join(sorted(List)))

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

List=[]
for i in range(a):
    List.append(input)

    print("".join(sorted(List)))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
List=[input() for i in range(a)]

print("".join(sorted(List)))
Problem p02811 (python)

Fixed submission:
k,x = map(int, input().split())
if k*500 >= x:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
k, x = int(input())
if k*500 >= x:
  print('Yes')
else:
  print('No')
Problem p03456 (python)

Fixed submission:
a,b = input().split()
ab = a + b
ab = int(ab)
if (ab**0.5).is_integer() == True:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a,b = map(input().split())
ab = a + b
ab = int(ab)
if (ab**0.5).is_integer() == True:
  print('Yes')
else:
  print('No')
Problem p02811 (python)

Fixed submission:
K, X = map(int, input().split())

if K*500 >= X:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
K = int(input("Enter k: "))
X = int(input("Enter x: "))

if K * 500 >= X:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
k = int(input("Enter k: "))
x = int(input("Enter x: "))
if (k * 500 > x):
    print("Yes")
else:
    print("No")