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

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

#leftto0
cost_left = 0
for i in range(x-1,0,-1):
    if i in a:
        cost_left+= 1
    
#right_to_N
cost_right = 0
for i in range(x+1, n):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))

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

cost_left = 0
for i in range(x-1,0,-1):
    if i in a:
        cost_left+= 1
cost_right = 0
for i in range(x+1, N):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))

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

#leftto0
cost_left = 0
b = range(x-1,0,-1)
for i in b:
    if i in a:
        cost_left+= 1
    
#right_to_N
cost_right = 0
for i in range(x+1, N):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))

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

#leftto0
cost_left = 0
b = range(x-1,0,-1)
for i in b:
    if i in a:
        cost_left+= 1
    
#right_to_N
cost_right = 0
for i in range(x+1, N):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))

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

#leftto0
cost_left = 0
b = range(0,x)
B = b.reverse()
for i in B:
    if i in a:
        cost_left+= 1
    
#right_to_N
cost_right = 0
for i in range(x+1, N):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))

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

#leftto0
cost_left = 0
for i in range(0,x).reverse:
    if i in a:
        cost_left+= 1
    
#right_to_N
cost_right = 0
for i in range(x+1, N):
    if i in a:
        cost_right+= 1
    
print(min(cost_left, cost_right))
Problem p03470 (python)

Fixed submission:
n = int(input())
a = len(set(list(map(int,[input() for i in range(n)]))))
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = len(set(list(map(int,[input for i in range(n)]))))
print(a)
Problem p03471 (python)

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

for i in range(n+1):
    for j in range(n-i+1):
        if 10000 * i + 5000 * j + 1000 * (n-i-j)==y:
            print(i, j, n-i-j)
            exit()
print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n+1):
    for j in range(n-i+1):
        if 10000 * i + 5000 * j +1000(n-i-j) == y:
            print(i, j, n-i-j)
            exit() 
print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n+1):
    for j in range(n-i+1):
        if 10000 * i + 5000 * j +1000(n-i-j) == y:
            print(i, j, n-i-j)
        exit() 
print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n+1):
    for j in range(n-i+1):
        if (10000*i + 5000*j +1000(n-i-j)) == y:
            print(i, j, n-i-j)
            exit() 
print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n+1):
    for j in range(n-i+1):
        if (10000*i + 5000*j +1000(n-i-j)) == y:
            print(i, j, n-i-j)
            exit() 
print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n+1):
    for j in range(n-i+1):
        if (10000*i + 5000*j +1000(n-i-j)) == y:
            print(i, j, n-i-j)
            exit()
        else:
            print("-1 -1 -1")

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
ans = 0
for i in range(n+1):
    for j in range(n-i+1):
        if (10000*i + 5000*j +1000(n-i-j)) ==y:
            print(i, j, n-i-j)
            exit()
        else:
            print('-1 -1 -1')

Buggy submission (verdict: Runtime Error):
n, y = map(int, input().split())
ans = 0
for i in range(n+1):
    for j in range(n-i+1):
        if (10000*i + 5000*j +1000(n-i-j)) ==y:
            print(i, j, n-i-j)
        else:
            print('-1 -1 -1')
Problem p03478 (python)

Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
    if a <= sum(list(map(int, list(str(i))))) <= b:
        ans += i
print(ans)

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
ans = 0
for i in range(n):
    if a <= sum(list(map(int, list(str(i))))) <= b:
    ans += 1
print(ans)
Problem p03494 (python)

Fixed submission:
import math
n = input()
a = list(map(int, input().split()))
ans = float('inf')
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind('1') - 1)
print(round(ans))

Buggy submission (verdict: Runtime Error):
import math
n = input()
a = list(map(int, input().split()))
ans = float('inf')
for i in a:
    ans = min(ans, len(bin(i) - bin(i).rfind('1') - 1)
print(round(ans))

Buggy submission (verdict: Runtime Error):
import math
n = input()
a = list(map(int, input().split()))
ans = float('inf')
for i in a:
    ans = min(ans, len(bin(i) - bin(i).rfind('1') - 1)
print(round(ans))
Problem p03737 (python)

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

res = "".join([a[0].upper(), b[0].upper(), c[0].upper()])
print(res)

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

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
else:
    print("EQUAL")

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

res = "".join([a[0].upper(), b[0].upper(), c[0].upper()])
print(res
Problem p03457 (python)

Fixed submission:
# 動けるかどうかの判定
def movable(prev_loc, loc):
  dt = loc[0] - prev_loc[0]
  dx = abs(loc[1] - prev_loc[1])
  dy = abs(loc[2] - prev_loc[2])
  # 時間内に届かない
  if dx + dy > dt:
    return False
  if (dx + dy) % 2 == dt % 2:
    return True
  else:
    return False

# 入力
n = int(input())
loc_list = []
for _ in range(n):
  loc_list.append(list(map(int, input().split())))

# 処理
ans = True
prev_loc = [0, 0, 0]
for loc in loc_list:
  # 現在の位置から次の位置へ移動可能かどうかを判定
  if not movable(prev_loc, loc):
    ans = False
    break
  prev_loc = loc

if ans:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
# 入力
n = int(input())
loc_list = []
for _ in range(n):
  loc_list.append(list(map(int, input().split())))

# 処理
ans = True
prev_loc = [0, 0, 0]
for loc in loc_list:
  # 現在の位置から次の位置へ移動可能かどうかを判定
  if not movable(prev_loc, loc):
    ans = False
    break
  prev_loc = loc

if ans:
  print("Yes")
else:
  print("No")
  
# 動けるかどうかの判定
def movable(prev_loc, loc):
  dt = loc[0] - prev_loc[0]
  dx = abs(loc[1] - prev_loc[1])
  dy = abs(loc[2] - prev_loc[2])
  # 時間内に届かない
  if dx + dy > dt:
    return False
  if dx + dy % 2 == dt % 2:
    return True
  else:
    return False
Problem p03609 (python)

Fixed submission:
x,t=[int(x) for x in input().split()]
print(max(0,x-t))

Buggy submission (verdict: Runtime Error):
x,t=[int(x) for x in input().split()]
print(max(0,x-t)
Problem p03635 (python)

Fixed submission:
i=[int(x)-1 for x in input().split()]
print(i[0]*i[1])

Buggy submission (verdict: Runtime Error):
H,W=[int(x) for x in input().split()]
N=int(input())
a=[int(x) for x in input().split()]
s=""
for i in range(N):
    s=s+str(i+1)*a[i]
for l in range(H):
    if l%2==0:
        print(" ".join(s[W*l:W*(l+1)]))
    else:
        print(" ".join(s[W*l:W*(l+1)][::-1]))

Buggy submission (verdict: Runtime Error):
input(sum([int(x)-1 for x in input().split()]))
Problem p03645 (python)

Fixed submission:
N,M=[int(x) for x in input().split()]
set1=[]
setn=[]
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 += ipt
    if N in ipt:
        setn += ipt
if set(set1) & set(setn):
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

Buggy submission (verdict: Runtime Error):
set1=set()
setn=set()
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 = set1.union(ipt)
    if N in ipt:
        setn = setn.union(ipt)
if set1.symmetric_difference(setn):
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")
Problem p03657 (python)

Fixed submission:
A,B=map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%3==0:
    print("Possible")
else:
    print("Impossible")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A%3==0 pr B%3==0 or (A+B)%3==0:
    print("Possible")
else:
    print("Impossible")
Problem p03679 (python)

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

if A-B>=0:
    print("delicious")
else:
    if X+A-B>=0:
        print("safe")
    else:
        print("dangerous")

Buggy submission (verdict: Runtime Error):
X A B = map(int,input().split())

if A-B>=0:
    print("delicious")
else:
    if X+A-B>=0:
        print("safe")
    else:
        print("dangerous")
Problem p03738 (python)

Fixed submission:
num=[]
for i in [0]*2:
    num.append(int(input()))
if num[0]>num[1]:
    print("GREATER")
elif num[0]==num[1]:
    print("EQUAL")
else:
    print("LESS")

Buggy submission (verdict: Runtime Error):
num=[]
for i in [0]*2:
    num.append(int(input()))
if num[0]>num[1]:
    print("GREATER")
elif num[0]=num[1]:
    print("EQUAL")
else:
    print("LESS")
Problem p03759 (python)

Fixed submission:
a,b,c=[int(x) for x in input().split()]
if  b-a==c-b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=[int(x) for x in input().split()]
if  b−a==c−b:
    print("YES")
else:
    print("NO")
Problem p03777 (python)

Fixed submission:
a,b=[x for x in input().split()]
if (a=="H" and b=="D") or (a=="D" and b=="H"):
    print("D")
else:
    print("H")

Buggy submission (verdict: Runtime Error):
a,b=[int(x) for x in input().split()]
if (a=="H" and b="D") or (a=="D" and b=="H"):
    print("D")
else:
    print("H")
Problem p03795 (python)

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

Buggy submission (verdict: Runtime Error):
import sys
N = int(input())
ipt = list(input())
stR = ["S" for i in range(N)]

def sheep(stg):
     return stg
def wolf(stg):
    if stg == "S":
        return "W"
    else:
        return "S"
def modN (i):
    return i%N
def check ( num1,num2 ):
    
    for i in range(N+2):
        if stR[modN(i+1)] == "S" and ipt[modN(i+1)]=="o"  :
            stR[modN(i+2)]=sheep(stR[modN(i)])
        elif stR[modN(i+1)] == "W" and ipt[modN(i+1)]=="x":
            stR[modN(i+2)]=sheep(stR[modN(i)])
        else:
            stR[modN(i+2)]=wolf(stR[modN(i)])
    
    if stR[0]==num1 and stR[1]==num2:
        print("".join(stR))
        return True
    else:
        return False

if check("S","W"):
    sys.exit()
else:
    stR[0]="W"
    if check("W","W"):
        sys.exit()
    else:
        stR[1]="S"
        if check("W","S"):
            sys.exit()
        else:
            stR[0]="S"
            if check("S","S"):
                sys.exit()
            else:
                print(-1)
Problem p03829 (python)

Fixed submission:
n,a,b=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=min(a*(x[i+1]-x[i]),b)
print(ans)

Buggy submission (verdict: Runtime Error):
n,a,b=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=max(a*(x[i+1]-x[i]),b)
print(ans)
Problem p04043 (python)

Fixed submission:
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
    if i == 5:
        k += 1
    elif i==7:
        j += 1
#    print(ipt,i,k,j)

if j == 1 and k == 2:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):

ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Buggy submission (verdict: Runtime Error):
import itertools
ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
import itertools
ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in ipt:
    if i == 5:
        k +=1
    elif i==7:
        j += 1

if J == 1 & K == 2:
    print("YES")
else:
    print("NO")
Problem p03433 (python)

Fixed submission:
# coding: utf-8

N = input()
A = input()

N = int(N)
A = int(A)

if N % 500 <= A:
    print("Yes")
else:
    print("No")

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

N = input()
A = input()

N = int(N)
A = int(A)

flag = 0

if N % 500 == 0:
    print('YES')
    flag = 1
else:
    for i in range(10000 // 500):
        sum_ = 500 * i

        if sum_ > N:
            x = i - 1
            break

for i in range(A):
    y = 500 * x + i

    if N == y:
        print('YES')
        flag = 1

if flag == 0:
    print('NO')
Problem p03469 (python)

Fixed submission:
s = input()
print(s.replace('2017', '2018'))

Buggy submission (verdict: Runtime Error):
s = input()
s[:4] = '2017'
print(s)
Problem p03369 (python)

Fixed submission:
s = input()
 
print(700 + 100 * s.count("o"))

Buggy submission (verdict: Runtime Error):
s = input()
 print(700 + 100 * s.count("o"))
Problem p03469 (python)

Fixed submission:
s = str(input())
s = "2018/01" + s[7:10]
print(s)

Buggy submission (verdict: Runtime Error):
s = str(input())
s[3] = "7"
print(s)
Problem p03485 (python)

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.floor((a+b)/2))

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = a*b/2
c = math.ceil(c)
print(c)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.ceil(a*b/2))

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.floor(a*b/2))
Problem p03493 (python)

Fixed submission:
a = str(input())
print(int(a[0]) + int(a[1]) + int(a[2]))

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

Fixed submission:
n, x = input().split()
n = int(n)
x = int(x)
m = []
i_min = 0
result = 0

for i in range(n):
 m.append(int(input()))

for i in range(len(m)):
 x = x - m[i]
 result = result + 1

for i in range(len(m)):
 if m[i_min] > m[i]:
  i_min = i

for i in range(x):
 if x >= m[i_min]:
  result = result + 1
  x = x - m[i_min]
 else:
  break

print(result)

Buggy submission (verdict: Runtime Error):
#NとXの読み込み
n, x = input().split()
n = int(n)
x = int (x)
m = []
i_min = 0 
result = 0

#m1からmnまでの読み込み
for i in range(n):
 m.append(int(input())
#全種類ひとつずつ作る
for i in range(len(m)):
 x = x - m[i]
 result = result + 1
#リストの中の最小値を突き止める
for i in range(len(m)):
 if m[i_min] > m[i]:
   i_min = i
#i_minを作れるだけ作る
for i in range(x):
 if x >= m[i_min]:
  result = result + 1
  x = x - m[i_min]
 else:
  break
#印刷
print(result)
Problem p03493 (python)

Fixed submission:
S = input()

count = 0

for s in S:
  if s == "1":
    count += 1

print(count)

Buggy submission (verdict: Runtime Error):
print(input().count(1))
Problem p03494 (python)

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

count = 0

while all(num%2 == 0 for num in nums):
  nums = [num/2 for num in nums]
  count += 1

print(count)

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

count = 0

while all(num%2 == 0 for num in nums):
  nums = [num/2 for num in nums]
  count += 1

print(num)
Problem p03693 (python)

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

if num % 4 == 0:
    print('YES')
else:
    print('NO')

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

if s%4 == 0:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
s = input().split()
num = int(s)

if num % 4 == 0:
  print('YES')
else:
  print('NO')

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

if num % 4 == 0:
  print('YES')
else:
  print('NO')
Problem p03485 (python)

Fixed submission:
a, b=map(int,input().split())
print((a+b+1)//2)

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

c=(a+b-1)/2+1
print(int(c))

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

c=(a+b)/2
print(int(c))
Problem p03493 (python)

Fixed submission:
import re

s=re.findall(r"1",input())
print(len(s))

Buggy submission (verdict: Runtime Error):
s=list(map(int,input().split()))
c=0
if s[0]==1:
    c+=1
if s[1]==1:
    c+=1
if s[2]==1:
    c+=1

print(c)

Buggy submission (verdict: Runtime Error):
s=input().split()
c=0
if s[0]==1:
    c+=1
if s[1]==1:
    c+=1
if s[2]==1:
    c+=1

print(c)
Problem p03455 (python)

Fixed submission:
a,b = map(int,input().split())
if a * b % 2 == 0:
    print ("Even")
else:
    print("Odd")

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

Fixed submission:
s = input()
print(s.count('1'))

Buggy submission (verdict: Runtime Error):
n = int(input())
nums = [int(i) for i in input().split()]
ans = 0
while True:
    if [i for i in nums if i % 2 == 1]:
        break
    nums = [i//2 for i in nums]
    ans += 1
print(ans)
Problem p03502 (python)

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
def f(n):
    return sum(map(int,　str(n)))

X = int(input())

if X % f(X) == 0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
def f(n):
    return sum(map(int,str(n)))

X = int8(input())

if X % f(X) == 0:
    print('Yes')
else:
    print('No')

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

total = 0
for i in range(1,n+1):
    total += N[i]

    if N % total == 0:
        print('Yes')
    else:
        print('No')

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

total = 0
for i in range(1,n+1):
    total += N

    if N % total == 0:
        print('Yes')
    else:
        print('No')

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

total = 0
for i in range(len(N)):
    total += N
    
    if N % sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())
def if_test:
    if N % sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

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

    if N / sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())
s = 0
for i in range(1,n+1):
    if N / sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')
Problem p03369 (python)

Fixed submission:
S = input()
a = 700
if S[0] == "o":
  a += 100
if S[1] == "o":
  a += 100
if S[2] == "o":
  a += 100
print(a)

Buggy submission (verdict: Runtime Error):
S = input()
a = 700
if S[0] ++ "o":
  a += 100
if S[1] ++ "o":
  a += 100
if S[2] ++ "o":
  a += 100
print(a)
Problem p03636 (python)

Fixed submission:
a = input()
print(a[0]+str(len(a)-2)+a[-1])

Buggy submission (verdict: Runtime Error):
a = input()
print(a[0]+len(a)+a[-1])

Buggy submission (verdict: Runtime Error):
a = input()
s = a.length
print(a[0]+int(s)+a[-1])
Problem p03455 (python)

Fixed submission:
p = input().split()
s = int(p[0]) * int(p[1])

if s % 2 == 1:
	print("Odd")
else:
	print("Even")

Buggy submission (verdict: Runtime Error):
p = int(input())
if p % 2 == 1:
	print("Odd")
else:
	print("Even")
Problem p03455 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())
c = a * b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")

Buggy submission (verdict: Runtime Error):
i = input().split()
j = i[0] * i[1]
if j % 2 == 0:
  print("Even")
else:
  print("Odd")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())
c = a * b
if c % 2 = 0:
  print("Even")
else:
  print("Odd")
Problem p03456 (python)

Fixed submission:
import math
a, b = map(int, input().split())
c = int(str(a)+str(b))
if math.sqrt(c) - int(math.sqrt(c))== 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
import math
a, b = map(int, input().split)
c = int(str(a)+str(b))
if math.sqrt(c) % 2 == 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
import math
a, b = map(int, input().split)
c = int(str(a)+str(b))
if math.sqrt(c) % 2 == 0:
  Yes
else:
  No
Problem p03485 (python)

Fixed submission:
i = list(map(int, input().split()))
j = i[0] + i[1]
if j % 2 == 0:
  print(int(j / 2))
else:
  print(int(j/2)+1)

Buggy submission (verdict: Runtime Error):
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int(j/2)+1)

Buggy submission (verdict: Runtime Error):
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int (j/2)+1)
Problem p03493 (python)

Fixed submission:
i = {}
i[0] = int(input())
i[1] = int(i[0] / 10)
i[2] = int(i[1] / 10)
i[1] = i[1] - i[2] * 10
i[0] = i[0] - i[1] * 10 - i[2] * 100
s = i[0] + i[1] + i[2]
print(s)

Buggy submission (verdict: Runtime Error):
i[0] = int(input())
i[1] = int(i[0] / 10)
i[2] = int(i[1] / 10)
i[1] = i[1] - i[2] * 10
i[0] = i[0] - i[1] * 10 - i[2] * 100
s = i[0] + i[1] + i[2]
print(s)
Problem p03455 (python)

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

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

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

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

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

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

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

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

if a%2==0 or b%2==0:
    print("Even")
else:
    print("Odd")
Problem p03369 (python)

Fixed submission:
a,b,c=input()
s=700
if a=='o' :
  s=s+100
if b=='o' :
  s=s+100
if c=='o' :
  s=s+100
print(s)

Buggy submission (verdict: Runtime Error):
a,b,c=input().split()
s=700
if a=='o' :
  s=s+100
if b=='o' :
  s=s+100
if c=='o' :
  s=s+100
print(s)
Problem p03693 (python)

Fixed submission:
r,g,b=(int(x) for x in input().split())

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

Buggy submission (verdict: Runtime Error):
r=int(input())
g=int(input())
b=int(input())
num=100*r+10*g+b
if num%4==0:
    print("YES")
else:
    print("NO")
return 0

Buggy submission (verdict: Runtime Error):
r=int(input())
g=int(input())
b=int(input())
num=100*r+10*g+b
if num%4==0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
r=int(input())
g=int(input())
b=int(input())
a=100*r+10*g+b

if a%4 ==0:
    print("YES")
else:
    primt("NO")

Buggy submission (verdict: Runtime Error):
r,g,b=input()
if (100*r+10*g+b)/4==0:
	print("YES")
else:
  print("NO")
Problem p03469 (python)

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

s1 = "2018" + s[4:] if s.startswith("2017") else s
print(s1)

Buggy submission (verdict: Runtime Error):
s = input().rstrip()

s1 = "2018" + s[4:] if s.startwith("2017") else s