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

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

if N%K==0:
	print(0)
else:
	print(1)

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

if N%K==0:
	print(0)
	else:
		print(1)

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

if N%K==0:
	print(0)
	elif N%K!=0:
		print(1)

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

if N%5==0:
	print(0)
	elif N%5!=0:
		print(1)
Problem p03293 (python)

Fixed submission:
S=input()
T=input()

ans = "No"
for i in range(len(S)):
	if S[i:] + S[0:i] == T:
		ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
ans = "No"
for i in range(len(S)):
	if S[:i] + S[0:i] == T:
		ans = "Yes"

print(ans)
Problem p03415 (python)

Fixed submission:

U=input()
M=input()
B=input()

print(U[0]+M[1]+B[2])

Buggy submission (verdict: Runtime Error):
U=input()
M=input()
B=input()

print(U[0].M[1].B[2])

Buggy submission (verdict: Runtime Error):
U=int(input())
M=int(input())
B=int(input())

print(U[0].M[1].B[2])

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

print(A[0].B[1].C[2])

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

print(A[0].B[1].C[2])

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

print(A[0],B[1],C[2])
Problem p02582 (python)

Fixed submission:
S=input()
if S[1-1]=='R':
  if S[2-1]=='R':
    if S[3-1]=='R':
      print(3)
    else:
      print(2)
  else:
    print(1)
elif S[2-1]=='R':
  if S[3-1]=='R':
    print(2)
  else:
    print(1)
elif S[3-1]=='R':
  print(1)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
S=input()
if S[1]=="R":
  if S[2]=="R":
    if S[3]=="R":
      print(3)
    else:
      print(2)
  else:
    print(1)
elif S[2]=="R":
  if S[3]=="R":
    print(2)
  else:
    print(1)
elif S[3]=="R":
  print(1)
else:
  print(0)
Problem p02613 (python)

Fixed submission:
N = int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(0,N):
  j = str(input())
  if j == "AC":
    AC+=1
  elif j == "WA":
    WA+=1
  elif j == "TLE":
    TLE+=1
  else:
    RE+=1
print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

Buggy submission (verdict: Runtime Error):
N = int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(0,N):
  j = str(input())
  if j = "AC":
    AC+=1
  elif j = "WA":
    WA+=1
  elif j = "TLE":
    TLE+=1
  else:
    RE+=1
print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))
Problem p02675 (python)

Fixed submission:
N=int(input())
f = N % 10
if f==3:
  print("bon")
elif f==0 or f==1 or f==6 or f==8:
  print("pon")
else:
  print("hon")

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

Buggy submission (verdict: Runtime Error):
N = input()
f = N % 10 
if (f==3):
  print("bon")
elif (f==0 || f==1 || f== 6 || f==8):
  print("pon")
else:
  print("hon")
Problem p02677 (python)

Fixed submission:
import math
 
PI = math.pi
A, B, H, M = map(int, input().split())
 
arg_a = (float(H) + float(M)/60) / 12.0 * 360
arg_b = float(M) / 60.0 * 360
 
 
C = math.sqrt(A*A + B*B - 2*A*B* math.cos((arg_a-arg_b)/360*2*PI))
print(C)

Buggy submission (verdict: Runtime Error):
import math
 
PI = math.pi
A=int(input())
B=int(input())
H=int(input())
M=int(input())
 
arg_a = (H + M/60) / 12.0 * 360
arg_b = M / 60.0 * 360
 
 
C = (A*A + B*B - 2*A*B* math.cos((arg_a-arg_b)/360*2*PI)) ** (1/2)
print(C)

Buggy submission (verdict: Runtime Error):
import math
A = int(input())
B = int(input())
H = int(input())
M = int(input())
t = H * 60 + M
CC = A**2 + B **2 - 2 * A * B * math.cos(((math.pi/60)-(math.pi/360))*t)
print(CC ** (1/2))

Buggy submission (verdict: Runtime Error):
import math
A = int(input())
B = int(input())
H = int(input())
M = int(input())
t = H * 60 + M
CC = A**2 + B **2 - 2 * A * B * math.cos(((math.pi/60)-(math.pi/360))*t)
print(CC ** (1/2))

Buggy submission (verdict: Runtime Error):
import math
A = int(input())
B = int(input())
H = int(input())
M = int(input())
 
t = H * 60 + M
CC = A**2 + B **2 - 2 * A * B * math.cos(((pi/60)-(pi/360))*t)
print(c ** (1/2))

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

t = H * 60 + M
CC = A**2 + B **2 - 2 * A * B * math.cos(((pi/60)-(pi/360))*t)
print(c ** (1/2))
Problem p02687 (python)

Fixed submission:
S = input()

if S =='ABC':
  print('ARC')
else:
  print('ABC')

Buggy submission (verdict: Runtime Error):
N,K = map(int,input().split())
 
P = [0 for i in range(N)]
m = 0
for i in range(K):
  a = int(input())
  b = list(int,input().split())
  for j in range(a):
    P[b[j]-1] = 1
    j += 1
    
for l in range(N):
  if P[l] == 0:
    m += 1
    
print(m)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
 
M = [0]*n
 
for i in range(k):
    d = int(input())
    a = [int(x) for x in input().split()]
    for j in range(d):
        M[a[j]-1] += 1
 
print(M.count(0))

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
 
m = [0]*n
 
for i in range(k):
    d = int(input())
    a = [int(x) for x in input().split()]
    for j in range(d):
        m[a[j]-1] += 1
 
print(m.count(0))

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
 
member = [0]*n
 
for i in range(k):
    d = int(input())
    a = [int(x) for x in input().split()]
    for j in range(d):
        
        member[a[j]-1] += 1
 
print(member.count(0))

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

if S ='ABC':
  print('ARC')
else:
  print('ABC')

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

if S = "ABC":
  print("ARC")
else:
  print("ABC")
Problem p02706 (python)

Fixed submission:
N,M = map(int,input().split())
A = list(map(int,input().split()))
print(max(-1,N-sum(A)))

Buggy submission (verdict: Runtime Error):
N,M = map(int,input().split())
A = [map(int,input().split())]
print(max(-1,N-sum(A)))

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

list = [map(int,input().split())]

if count(list) > N:
  print(-1)
else:
  print(N-count(list))
Problem p03035 (python)

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

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A >= 13:
  print(B)
elif A>=6 and A<=12:
  print(B/2)
elif: A<=5:
  print(0)
Problem p02717 (python)

Fixed submission:
import numpy as np  

li = np.array(input().split(" "), dtype=np.int)
li[0], li[1] = li[1], li[0]
li[0], li[2] = li[2], li[0]

print(li[0], li[1], li[2])

Buggy submission (verdict: Runtime Error):
li = list(map(int, input().split(" ")))
print(f"{li[2]} {li[0]} {li[1]}")

Buggy submission (verdict: Runtime Error):
li = input().split(" ")
print(f"{li[2]} {li[0]} {li[1]}")

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

li = np.array(input().split(" "), dtype=np.int)
li[0], li[1] = li[1], li[0]
li[0], li[2] = li[2], li[0]

print(li[0], li[1], li[2])
Problem p02783 (python)

Fixed submission:
data = input().split()
strengh = int(data[0])
attack = int(data[1])
count = 0

while strengh > 0:
    strengh -= attack
    count += 1

print(count)

Buggy submission (verdict: Runtime Error):
from numba inmport 

@jit
def do():
  data = input().split()
  monsters = int(data[0])
  smash = int(data[1])
 
  mon_str = input().split()
  mon_str = [int(b) for b in mon_str]
  count = 0
 
  for i in range(smash):
      try:
          enemy = mon_str.index(max(mon_str))
          del mon_str[enemy]
    
      except ValueError:
          pass
  print(sum(mon_str))
 
do()
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,b = map(int, input(),split())

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

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

if num (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):
a,b,c = (int(x) for x in input() . split())

print(a + b + c)
Problem p02608 (python)

Fixed submission:
N = int(input())
ans = [0]*(N+1)
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            num = x*x + y*y + z*z + x*y + y*z + z*x
            if num>N:
                break
            ans[num] = ans[num] + 1
for m in ans[1:]:
    print(m)

Buggy submission (verdict: Runtime Error):
N = int(input())
ans = [0]*(N)
for x in range(1,100):
    for y in range(1,100):
        for z in range(1,100):
            num = x*x + y*y + z*z + x*y + y*z + z*x
            if num>N:
                break
            ans[num] = ans[num] + 1
for m in ans:
    print(m)
Problem p02576 (python)

Fixed submission:
# 入力
N, X, T = input().split()

N = int(N)
X = int(X)
T = int(T)

if N % X == 0:
    cnt = int(N / X)
else:
    cnt = int(N / X + 1)

print(cnt * T)

Buggy submission (verdict: Runtime Error):
# 入力
N, X, T = input().split()

if N % X == 0:
    cnt = int(N / X)
else:
    cnt = int(N / X + 1)

print(cnt * T)

Buggy submission (verdict: Runtime Error):
# 入力
N, X, T = input().split()

if N % X == 0:
    cnt = N / X
else:
    cnt = int(N / X + 1)

print(cnt * T)
Problem p02657 (python)

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

print(a * b)

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

val_list = input().split()
answer = 0
for i, val in enumerate(val_list):
    if i == 0:
        answer = int(val)
    else:
        answer = answer * int(val)

if answer > 10 ** 18:
    print(-1)
else:
    print(answer)

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

val_list = input().split()
answer = 0
for i, val in enumerate(val_list):
    if i == 0:
        answer = int(val)
    else:
        answer = answer * int(val)

if answer > 10 ** 18:
    print(-1)
else:
    print(answer)

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

val_list = input().split()
answer = 0
for i, val in enumerate(val_list):
    if i == 0:
        answer = int(val)
    else:
        answer = answer * int(val)

if answer > 10**18:
    print(-1)
else:
    print(answer)
Problem p02675 (python)

Fixed submission:
num_val = str(input())

if num_val[len(num_val) - 1] in ['2', '4', '5', '7', '9']:
    print('hon')
elif num_val[len(num_val) - 1] in ['0', '1', '6', '8']:
    print('pon')
elif num_val[len(num_val) - 1] in ['3']:
    print('bon')

Buggy submission (verdict: Runtime Error):
num_val = str(input())

if num_val[len(num_val) - 1] in ['2', '4', '5', '7', '9']:
  print('hon')
  elif num_val[len(num_val) - 1] in ['0', '1', '6', '8']:
    print('pon')
    elif num_val[len(num_val) - 1] in ['3']:
      print('bon')

Buggy submission (verdict: Runtime Error):
    num_val = str(input())
     
    if num_val[len(num_val) - 1] in ['2', '4', '5', '7', '9']:
        print('hon')
    elif num_val[len(num_val) - 1] in ['0', '1', '6', '8']:
        print('pon')
    elif num_val[len(num_val) - 1] in ['3']:
        print('bon')
Problem p03243 (python)

Fixed submission:
n = int(input())

lst = [111,222,333,444,555,666,777,888,999]

for i in lst:
    if n <= i:
        print(i)
        break

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

lst = [111,222,333,444,555,666,777,888,999]

for i in lst:
    if n <= i:
        print(i)
        break
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
a,b = map(int,input())
prin(a*b)
Problem p02664 (python)

Fixed submission:
T=input()

res = ""
for i in range(len(T)) :
    if (T[i] != "?") :
        res += T[i]
        continue
    res += "D"

    # if (i != 0) :
    #     if (T[i-1] == "P") :
    #         res += "D"
    #     else :
    #         res += "D"

print(res)

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

res = ""
for i in len(T) :
    if (T[i] != "?") :
        res += T[i]
        continue

    if (i != 0) :
        if (T[i-1] == "P") :
            res += "D"
        else :
            res += "D"

print(res)
Problem p02947 (python)

Fixed submission:
import statistics as stat
import collections as cl

N = int(input())

s_li = []
s_dic = {}
c = 0
for i in range(N) :
    s = ''.join(sorted(list(input())))
    # con = s_li.count(s)
    # if (con >= 1) :
    #     c += con
    # s_li.append(s)
    if (s in s_dic) :
        c += s_dic[s]
        s_dic[s] += 1
    else :
        s_dic[s] = 1

print(c)

Buggy submission (verdict: Runtime Error):
import statistics as stat
import collections as cl

N = int(input())

s_li = []
s_dic:dict = {}
c = 0
for i in range(N) :
    s = ''.join(sorted(list(input())))
    # con = s_li.count(s)
    # if (con >= 1) :
    #     c += con
    # s_li.append(s)
    if (s in s_dic) :
        c += s_dic[s]
        s_dic[s] += 1
    else :
        s_dic[s] = 1
print(c)

Buggy submission (verdict: Runtime Error):
import statistics as stat
import collections as cl

N = int(input())

s_li = []
s_dic:dict = {}
c = 0
for i in range(N) :
    s = ''.join(sorted(list(input())))
    # con = s_li.count(s)
    # if (con >= 1) :
    #     c += con
    # s_li.append(s)
    if (s in s_dic) :
        c += s_dic[s]
        s_dic[s] += 1
    else :
        s_dic[s] = 1
print(c)
Problem p03206 (python)

Fixed submission:
D = int(input())

if (D == 25) :
	print("Christmas")
elif (D == 24) :
	print("Christmas Eve")
elif (D == 23):
	print("Christmas Eve Eve")
elif (D == 22):
	print("Christmas Eve Eve Eve")

Buggy submission (verdict: Runtime Error):
N,X = [int(i) for i in input().split()]

def get_next_burger(current_burger) :
	return "B" + current_burger + "P" + current_burger + "B"

current = "P"

for i in range(N) :
	current = get_next_burger(current)

target = current[:X]
print(target.count("P"))
Problem p03280 (python)

Fixed submission:
read_line = [int(i) for i in input().split()]
A = read_line[0]
B = read_line[1]

print(A*B-A-B+1)

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

p = 0
for i in range(len(S)) :
	if (S[i] != "1") :
		print(S[i])
		p = 1
		break
	
if (p == 0) :
	print("1")
Problem p03282 (python)

Fixed submission:
def main() :
	S = input()
	K = int(input())

	is_1 = True
	for i in range(K) :
		if (len(S) < i) :
			break

		# print("S[i] : " + S[i])
		if (S[i] != "1") :
			is_1 = False
			break

	if (is_1) :
		print("1")
		return

	for i in range(len(S)) :
		if (S[i] == "1") :
			continue

		print(S[i])
		break


main()

Buggy submission (verdict: Runtime Error):
S = input()
K = long(input())

for i in range(len(S)) :
	if (S[i] == "1") :
		continue
	
	print(S[i])
	break
Problem p03501 (python)

Fixed submission:
n,a,b = [int(i) for i in input().split()]
if (a*n < b) :
  print(a*n)
else :
  print(b)

Buggy submission (verdict: Runtime Error):
n,a,b = [int(i) for i in input().split()]
if (a＊n < b) :
  print(a＊n)
else :
  print(b)
Problem p03563 (python)

Fixed submission:
R = int(input())
G = int(input())

print(2*G-R)

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

print(2G-R)
Problem p03573 (python)

Fixed submission:
a,b,c = [int(i) for i in input().split()]

if ([a,b,c].count(a) == 1) :
	print(a)
elif ([a,b,c].count(b) == 1) :
	print(b)
else :
	print(c)

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

if ([a,b,c].count(a) = 1) :
	print(a)
elif ([a,b,c].count(b) = 1) :
	print(b)
else :
	print(c)
Problem p03574 (python)

Fixed submission:
def draw_map(count_map, row_index, col_index) :
	for i in range(row_index-1, row_index+2) :
		if (i < 0 or len(count_map) <= i) :
			continue
		for j in range(col_index-1, col_index+2) :
			if (j < 0 or len(count_map[0]) <= j) :
				continue
			count_map[i][j] += 1
	
	return count_map
    				
    			

H,W = [int(i) for i in input().split()]
mines = []
for i in range(H) :
	mines.append(input())

# 白地図を用意して、1ずつ足す
# 空きマスだったら数字に置き換える
count_map = [[0 for i in range(W)] for j in range(H)]
for i in range(H) :
	for j in range(W) :
		if (mines[i][j] == "#") :
			mine_map = draw_map(count_map,i,j)

for i in range(H) :
	out_line = ""
	for j in range(W) :
		if (mines[i][j] == ".") :
			out_line += str(count_map[i][j])
		else :
			out_line += "#"
	print(out_line)

Buggy submission (verdict: Runtime Error):
def draw_map(count_map, row_index, col_index) :
	for i in range(row_index-1, row_index+2) :
		if (i < 0 or len(count_map) <= i) :
			continue
		for j in range(col_index-1, col_index+2) :
			if (j < 0 or len(count_map[0]) <= j) :
				continue
			count_map[i][j] += 1
	
	return count_map
    				
    			

H,W = [int(i) for i in input().split()]
mines = []
for i in range(H) :
	mines.append(input())

# 白地図を用意して、1ずつ足す
# 空きマスだったら数字に置き換える
count_map = [[0 for i in range(W)] for j in range(H)]
for i in range(H) :
	for j in range(W) :
		if (mines[i][j] == "#") :
			mine_map = draw_map(count_map,i,j)

for i in range(H) :
	out_line = ""
	for j in range(H) :
		if (mines[i][j] == ".") :
			out_line += str(count_map[i][j])
		else :
			out_line += "#"
	print(out_line)
Problem p03609 (python)

Fixed submission:
X ,t = [int(i) for i in input().split()]
if (X > t) :
    print(X-t)
else :
    print(0)

Buggy submission (verdict: Runtime Error):
import collections as cl
N = int(input())
a_li = [i for i in input().split()]
c = cl.Counter(a_li)

keys = list(c.keys())
max_sum = 0
if (len(c) == 1) :
    print(1)
elif (len(c) == 2) :
    if (abs(a_li[0] - a_li[1]) <= 1 ) :
        print(2)
    else :
        print(1)
else :
    for k in range(len(c) -2 ) :
        sum_v = c[keys[k]] + c[keys[k+1]] + c[keys[k+2]]
        if (max_sum < sum_v) :
            max_sum = sum_v
    
    print(max_sum)
Problem p03611 (python)

Fixed submission:
import collections as cl
N = int(input())
a_li = [int(i) for i in input().split()]
a_li2 = [i-1 for i in a_li]
a_li3 = [i+1 for i in a_li]
a_li.extend(a_li2)
a_li.extend(a_li3)
c = cl.Counter(a_li)
print(c.most_common()[0][1])

# keys = list(c.keys())
# max_sum = 0
# if (len(c) == 1) :
#     # 1種類しかない
#     print(len(a_li))
# elif (len(c) == 2) :
#     # 2種類ある
#     if (abs(int(keys[0]) - int(keys[1])) <= 2 ) :
#         # 差が2以下なら全部同じ値にできる
#         print(len(a_li))
#     else :
#         # 差が2より大きいなら多いほうの個数が最大
#         if (int(c[keys[0]]) > int(c[keys[1]])) :
#             print(c[keys[0]])
#         else :
#             print(c[keys[1]])
# else :
#     # この思想はNG。keys[k]からkeys[k+2]の差が2以下じゃないと成り立たない。
#     for k in range(len(c) -2 ) :
#         sum_v = c[keys[k]] + c[keys[k+1]] + c[keys[k+2]]
#         if (max_sum < sum_v) :
#             max_sum = sum_v
    
#     print(max_sum)

Buggy submission (verdict: Runtime Error):
import collections as cl
N = int(input())
a_li = [i for i in input().split()]
c = cl.Counter(a_li)

keys = list(c.keys())
max_sum = 0
if (len(c) == 1) :
    print(1)
elif (len(c) == 2) :
    if (abs(a_li[0] - a_li[1]) <= 1 ) :
        print(2)
    else :
        print(1)
else :
    for k in range(len(c) -2 ) :
        sum_v = c[keys[k]] + c[keys[k+1]] + c[keys[k+2]]
        if (max_sum < sum_v) :
            max_sum = sum_v
    
    print(max_sum)

Buggy submission (verdict: Runtime Error):
import collections as cl
N = int(input())
a_li = [i for i in input().split()]
c = cl.Counter(a_li)
print(c)
# for k in list(c.keys())[:-2] :
keys = list(c.keys())
max_sum = 0
if (len(c) == 1) :
    print(1)
elif (len(c) == 2) :
    if (abs(a_li[0] - a_li[1]) <= 1 ) :
        print(2)
    else :
        print(1)
else :
    for k in range(len(c) -2 ) :
        sum_v = c[keys[k]] + c[keys[k+1]] + c[keys[k+2]]
        if (max_sum < sum_v) :
            max_sum = sum_v
    
    print(max_sum)
Problem p03635 (python)

Fixed submission:
n,m = [int(i) -1 for i in input().split()]
print(n * m)

Buggy submission (verdict: Runtime Error):
n = int(input()) -1
m = int(input()) -1
print(n * m)

Buggy submission (verdict: Runtime Error):
n = int(input()) -1
m = int(input()) -1
print(n * m)

Buggy submission (verdict: Runtime Error):
print((int(input()) -1) * (int(input()) -1))

Buggy submission (verdict: Runtime Error):
print((int(input()) -1) * (int(input()) -1))
Problem p03943 (python)

Fixed submission:
a,b,c = [int(i) for i in input().split()]

if (sum([a,b,c]) == max(a,b,c) * 2) :
	print("Yes")
else :
	print("No")

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

if (sum(a,b,c) == max(a,b,c) * 2) :
	print("Yes")
else :
	print("No")
Problem p02639 (python)

Fixed submission:
def main():
  input_number = list(map(int, input().split()))
  for i in range(5):
    if input_number[i]==0:
      print(i+1)
      exit()

if __name__=='__main__':
  main()

Buggy submission (verdict: Runtime Error):
X,Y = map(int, input().split())
if Y%2==1:
    print('No')
else:
    kame=Y//4
    Y=Y-(kame*4)
    turu=Y//2
    if (turu+kame)==X:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
X,Y = map(int, input().split())
if Y%2==1:
    print("No")
else:
    kame=Y//4
    Y=Y-(kame*4)
    turu=Y//2
    if (turu+kame)==X:
        print("Yes")
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
def main():
  input_number=list(map(int, input().split()))
  for i in input:
    if i==0:
      print(i)
      break

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

Fixed submission:
N = int(input())
L=[input() for i in range(N)]

print("AC" + " x "+ str(L.count("AC")))
print("WA" + " x "+ str(L.count("WA")))
print("TLE" + " x "+ str(L.count("TLE")))
print("RE" + " x "+ str(L.count("RE")))

Buggy submission (verdict: Runtime Error):
N = []
L=[input() for i in range(N)]

print("AC" + " x "+ str(L.count("AC")))
print("WA" + " x "+ str(L.count("WA")))
print("TLE" + " x "+ str(L.count("TLE")))
print("RE" + " x "+ str(L.count("RE")))

Buggy submission (verdict: Runtime Error):
N = []
N.append(input())

print("AC" + " x "+ N.count("AC"))
print("WA" + " x "+ N.count("WA"))
print("TLE" + " x "+ N.count("TLE"))
print("RE" + " x "+ N.count("RE"))

Buggy submission (verdict: Runtime Error):
N = []
N.append(input())

print("AC" + " x "+ count("AC"))
print("WA" + " x "+ count("WA"))
print("TLE" + " x "+ count("TLE"))
print("RE" + " x "+ count("RE"))
Problem p02640 (python)

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

if (Y % 2 == 0) and (4*X >= Y >=2*X):
    print('Yes')

else:
    print('No')

Buggy submission (verdict: Runtime Error):
X,Y =input().split()

if (Y % 2 == 0) and (4*X >= Y >=2*X):
    print('Yes')

else:
    print('No')
Problem p02657 (python)

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

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

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

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

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

Buggy submission (verdict: Runtime Error):
N =int(input())
A = list(map(int, input().split()))
ans = 1
for a in A:
    ans *= a
    if ans > 10**18:
        print(-1)
        exit()
print(ans)

Buggy submission (verdict: Runtime Error):
N =int(input())
A = list(map(int, input().split()))
 
for a in A:
    ans *= a
    if ans > 10**18:
        print(-1)
        exit()
print(ans)

Buggy submission (verdict: Runtime Error):
ans = A * B
print(ans)

Buggy submission (verdict: Runtime Error):
ans = a * b
print(ans)