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

Fixed submission:
N = str(raw_input())
if(N.find(N[0]*3) != -1):
    print 'Yes'
elif(N.find(N[1]*3) != -1):
    print 'Yes'
else:
    print 'No'

Buggy submission (verdict: Runtime Error):
N = raw_input()
keys = ['+','-']
x = 0
check = True
for key1 in keys:
    if key1 == '+' and check:
        x = int(N[0]) + int(N[1])
    elif(key1 == '-' and check):
        x = int(N[0]) - int(N[1])
    for key2 in keys:
        if key2 == '+' and check:
            x = x  + int(N[2])
        elif(key2 == '-' and check):
            x = x  - int(N[2])
            
        for key3 in keys:
            if key3 == '+' and check:
                x = x  + int(N[3])
                if (x == 7):
                    ans = N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    #print N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False

                else:
                    x = 0
            elif(key3 == '-' and check):
                x = x  - int(N[3])

                if (x == 7):
                    ans =  N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False

                else:
                    x = 0
print ans
Problem p03545 (python)

Fixed submission:
N = raw_input()
keys = ['+','-']
x = 0
check = True
ans = ''
for key1 in keys:
    if key1 == '+' and check:
        x1 = int(N[0]) + int(N[1])
    elif(key1 == '-' and check):
        x1 = int(N[0]) - int(N[1])
    for key2 in keys:
        if key2 == '+' and check:
            x2 = x1  + int(N[2])
        elif(key2 == '-' and check):
            x2 = x1  - int(N[2])
        
        #print x
        for key3 in keys:
            if key3 == '+' and check:
                #print x
                #print int(N[3])
                x3 = x2  + int(N[3])
                #print x
                if (x3 == 7):
                    ans = N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False


            elif(key3 == '-' and check):

                x3 = x2  - int(N[3])

                if (x3 == 7):
                    ans =  N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False

            #print x
print ans

Buggy submission (verdict: Runtime Error):
N = raw_input()
keys = ['+','-']
x = 0
check = True

for key1 in keys:
    if key1 == '+' and check:
        x = int(N[0]) + int(N[1])
    elif(key1 == '-' and check):
        x = int(N[0]) - int(N[1])
    for key2 in keys:
        if key2 == '+' and check:
            x = x  + int(N[2])
        elif(key2 == '-' and check):
            x = x  - int(N[2])
            
        for key3 in keys:
            if key3 == '+' and check:
                x = x  + int(N[3])
                if (x == 7):
                    ans = N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    #print N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False
                else:
                    x = 0
            elif(key3 == '-' and check):
                x = x  - int(N[3])

                if (x == 7):
                    ans =  N[0] + key1 + N[1] + key2 + N[2] + key3 + N[3]+ '=7'
                    check = False

                else:
                    x = 0
print ans
Problem p03547 (python)

Fixed submission:
a, b = raw_input().split()

dic = {
    "A":10,
    "B":11,
    "C":12,
    "D":13,
    "E":14,
    "F":15}
aa = dic[a]
bb = dic[b]

if(aa < bb):
    y = "<"
elif(aa > bb):
    y = ">"
else:
    y = "="
    
print(y)

Buggy submission (verdict: Runtime Error):
a, b = raw_input().split()
a = int(a)
b = int(b)
nnn = a-b
nn = 2**b
n = (1900*b+100*nnn)*nn
print(n)

Buggy submission (verdict: Runtime Error):
a = raw_input()
b = raw_input()
dic = {
    "0":0,
    "1":1,
    "2":2,
    "3":3,
    "4":4,
    "5":5,
    "6":6,
    "7":7,
    "8":8,
    "9":9,
    "A":10,
    "B":11,
    "C":12,
    "D":13,
    "E":14,
    "F":15}
aa = dic[a]
bb = dic[b]

if(aa < bb):
    y = "<"
elif(aa > bb):
    y = ">"
else:
    y = "="
    
print(y)

Buggy submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!
a = raw_input()
b = raw_input()
dic = {
    "0":0,
    "1":1,
    "2":2,
    "3":3,
    "4":4,
    "5":5,
    "6":6,
    "7":7,
    "8":8,
    "9":9,
    "A":10,
    "B":11,
    "C":12,
    "D":13,
    "E":14,
    "F":15,}
aa = dic[a]
bb = dic[b]

if(aa < bb):
    y = "<"
elif(aa > bb):
    y = ">"
else:
    y = "="
    
print(y)
Problem p03079 (python)

Fixed submission:
input_length = input().split(' ')

result = ''
x = input_length.count(input_length[0])
if x == len(input_length):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())
while True:
    s = input()
    if len(s) == N:
        break
        
caps = list(s)

if caps.count('R') > N / 2:
    print('Yes')
else:
    print('No')
Problem p03085 (python)

Fixed submission:
ACGT = {'A':'T', 'C':'G', 'T':'A', 'G':'C'}
input_ACGT = input()
print(ACGT[input_ACGT])

Buggy submission (verdict: Runtime Error):
import re
N, Q = (int(i) for i in input().split(' ')) 
S = input()
for i in range(Q):
    l_i, r_i = (int(j) for j in input().split())
    matches = re.findall('AC', S[l_i-1:r_i])
    print(len(matches))
Problem p03086 (python)

Fixed submission:
atcoder = input()
ACGT = list('ACGT')

s = ''
sub_list = []
for i, l in enumerate(list(atcoder)):
    if l in ACGT:
        s += l
        if i == len(atcoder)-1:
            sub_list.append(len(s))
    else:
        sub_list.append(len(s))
        s = ''
print(max(sub_list))

Buggy submission (verdict: Runtime Error):
atcoder = input()
ACGT = list('ACGT')

s = ''
sub_list = []
for i, l in enumerate(list(atcoder)):
    if l in ACGT:
        s += l
        if i == len(atcoder)-1:
            sub_list.append(len(s))
    else:
        if s != '':
            sub_list.append(len(s))
        s = ''
print(max(sub_list))

Buggy submission (verdict: Runtime Error):
atcoder = input()
ACGT = 'ACGT'

s = ''
sub_list = []
for i, l in enumerate(list(atcoder)):
    if l in list(ACGT):
        s += l
    else:
        if s != '':
            sub_list.append(len(s))
        s = ''

print(max(sub_list))

Buggy submission (verdict: Runtime Error):
atcoder = input()
ACGT = 'ACGT'

s = ''
sub_list = []
for i, l in enumerate(list(atcoder)):
    if l in list(ACGT):
        s += l
    else:
        if s != '':
            sub_list.append(len(s))
        s = ''

print(max(sub_list))
Problem p03151 (python)

Fixed submission:
N = int(input())
A = list(map(int, input().split(' ')))
B = list(map(int, input().split(' ')))

sum_A = sum(A)
sum_B = sum(B)

diff = []
neg = 0
count = 0

if sum_B > sum_A:
    print(-1)
    exit()

for a, b in zip(A, B):
    diff += [a-b]
    if a < b:
        count += 1
        neg += a - b

for d in sorted(diff, reverse=True):
    if neg >= 0:
        break
    count += 1
    neg += d

print(count)

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

diff = []
neg = 0
count = 0

if sum(B) >  sum(A):
    print(-1)
    exit()

for a, b in zip(A, B):
    diff += [a-b]
    if a < b:
        count += 1
        neg += a - b

for d in reverse(diff):
    if neg >= 0:
        break
    count += 1
    neg += d

print(count)
Problem p03145 (python)

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

menseki = a * b // 2

print(menseki)

Buggy submission (verdict: Runtime Error):
s = int(input())
a = [0] * 100000
a[0] = s

sum = 0
flag = 0
for i in range(100000):
    if a[i] % 2 == 0:
        a[i+1] = a[i] // 2
    else:
        a[i+1] = 3 * a[i] + 1
    sum += 1
    if a[i] in a[:i]:
        print(sum)
        exit()
Problem p03059 (python)

Fixed submission:
input_str = input().split(" ")
input_int = list(map(int, input_str))
A = input_int[0]
B = input_int[1]
T = input_int[2]

bis_sum = 0
start = 0
end = A
while True:
    if start < T+0.5 and end > T+0.5:
        break
    start += A
    end += A
    bis_sum += B

print(bis_sum)

Buggy submission (verdict: Runtime Error):
import copy

def gcd(a, b):
    while b != 0:
        a, b = b, a%b
    return a

def gcd_list(numbers):
    g = numbers[0]
    for m in numbers:
        g = gcd(g, m)
    return g

N = int(input())
A = list(map(int, input().split(" ")))

gcds = list()
for a in A:
    B = copy.deepcopy(A)
    B.remove(a)
    g = gcd_list(B)
    gcds.append(g)
print(max(gcds))
Problem p03060 (python)

Fixed submission:
N = int(input())
V = list(map(int, input().split(" ")))
C = list(map(int, input().split(" ")))
Z = 0
for v, c in zip(V, C):
    if v-c>0: Z += v-c
print(Z)

Buggy submission (verdict: Runtime Error):
inputs = input().split("\n")
N = int(inputs[0])
V = list(map(int, inputs[1].split(" ")))
C = list(map(int, inputs[2].split(" ")))
Z = 0
for v, c in zip(V, C):
    if v-c>0: Z += v-c
print(Z)

Buggy submission (verdict: Runtime Error):
inputs = input().split("\n")
N = int(inputs[0])
V = list(map(int, inputs[1].split(" ")))
C = list(map(int, inputs[2].split(" ")))
Z = 0
for v, c in zip(V, C):
    if v-c>0: z += v-c
print(Z)

Buggy submission (verdict: Runtime Error):
inputs = input().split("\n")
N = int(inputs[0])
V = list(map(int, inputs[1]))
C = list(map(int, inputs[2]))
Z = 0
for v, c in zip(V, C):
    if v-c>0: z += v-c
print(Z)
Problem p03379 (python)

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

# N = 2
# X = [1, 2]

# N = 6
# X = [5, 5, 4, 4, 3, 3]

# target = int((N-1)/2)
first_m = int(N/2)
second_m = first_m - 1
X_ = sorted(X)
for i in range(N):
    if X[i] <= X_[second_m]: print(X_[first_m])
    else: print(X_[second_m])

Buggy submission (verdict: Runtime Error):
from statistics import median

N = int(input())
X = list(map(int, input().split(' ')))

def get_median(l):
    return median(l)

for i in range(N):
    target_l = X[:i] + X[i+1:]
    target_l = sorted(target_l)
    print(target_l[(N+1)/2])
Problem p03419 (python)

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

if M > N:
    tmp = M
    M = N
    N = tmp

if N == 1 and M == 1: print(1)
elif M == 1: print(N-2)
else: print((N-2)*(M-2))

Buggy submission (verdict: Runtime Error):
def initBoard(rowSize, colSize):
    board = list()
    for i  in range(rowSize):
        col = [1]*colSize
        board.append(col)
    return board

def canFlip(i, j):
    return i >= 0 and i < rowSize and j >= 0 and j < colSize

def flip(board, i, j):
    if board[i][j] == 0:
        board[i][j] = 1
    elif board[i][j] == 1:
        board[i][j] = 0

def process(board, i, j):
    if canFlip(i, j):
        flip(board, i, j)
    if canFlip(i-1, j+1):
        flip(board, i-1, j+1)
    if canFlip(i, j+1):
        flip(board, i, j+1)
    if canFlip(i+1, j+1):
        flip(board, i+1, j+1)
    if canFlip(i-1, j):
        flip(board, i-1, j)
    if canFlip(i+1, j):
        flip(board, i+1, j)
    if canFlip(i-1, j-1):
        flip(board, i-1, j-1)
    if canFlip(i, j-1):
        flip(board, i, j-1)
    if canFlip(i+1, j-1):
        flip(board, i+1, j-1)

def countBack(board):
    count = 0
    for i in range(len(board)):
        for j in range(len(board[0])):
            if board[i][j] == 0: count += 1
    return count

N, M = map(int, input().split(" "))

rowSize = N
colSize = M
board = initBoard(rowSize, colSize)
for i in range(N):
    for j in range(M):
        process(board, i, j)
print(countBack(board))
Problem p03067 (python)

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

if(a<b):
	for i in range(a, b):
		if i==c:
			print("Yes")
			exit()
if(a>b):
	for i in range(b, a):
		if i==c:
			print("Yes")
			exit()

print("No")

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

for i in range(a, b+1):
	if i=c:
		print("Yes")
		exit()
print("No")
Problem p03068 (python)

Fixed submission:
n = int(input())
s = list(input())
k = int(input())

moji = s[k-1]

for i in range(n):
	if s[i]!=moji:
		s[i]='*'

ans = ''.join(s)
print(ans)

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

moji = s[k-1]

for ss in s:
	if s[ss]!=moji:
		s[ss]='*'

print(str(s))
Problem p03071 (python)

Fixed submission:

a, b = map(int, input().split())
count = 0

for i in range(2):
	if a>=b:
		count += a
		a -= 1
	else:
		count += b
		b -= 1

print(count)

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

for range(2):
	if a>=b:
		count += a
		a -= 1
	else:
		count += b
		b -= 1

print(count)
Problem p03059 (python)

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

Buggy submission (verdict: Runtime Error):
def gcd(a, b):
    while True:
        bigger=max(a,b)
        smaller=min(a,b)
        mod=bigger%smaller
        if mod==0:
            return smaller
        else:
            return gcd(smaller, mod)

n = int(input())
a = list(map(int, input().split()))
ansers=[]
non_remove=a[0]
ansers.append(a[1])
for i in range(1, n):
    ansers = [ gcd(ans, a[i]) for ans in ansers ]
    ansers.append(non_remove)
    non_remove = gcd(non_remove, a[i])
print(max(ansers))
Problem p03060 (python)

Fixed submission:
N = int(input())
V = input().split()
C = input().split()
value = int(0)
i = int(0)
for i in range(N):
    if int(V[i]) > int(C[i]):
        add = int(V[i]) - int(C[i])
        value = value + add
    i = i + 1
print(value)

Buggy submission (verdict: Runtime Error):
N = int(input())
V = input().split()
C = input().split()
i = int(0)
value = int(0)
if i < N:
    if V[i] - C[i] > 0:
        value = value + V[i] - C[i]
        i += 1
print(value)

Buggy submission (verdict: Runtime Error):
N = int(input())
V = input().split()
C = input().split()
i = int(0)
if i < N:
    if V[i] - C[i] > 0:
        value = value + V[i] - C[i]
        i += 1
print(value)
Problem p03071 (python)

Fixed submission:
A, B = map(int, input().split())
C_1 = 2*A - 1
C_2 = A + B
C_3 = 2*B - 1
print(max([C_1, C_2, C_3]))

Buggy submission (verdict: Runtime Error):
N = int(input())
H = input().split()
i = int(0)
j = int(0)
n = int(1)
m = int(0)
for i in range(N-1):
    for j in range(i+1):
        if H[i] >= H[j]:
            m = m + 1
    if m == i+1:
        n = n + 1
print(n)
Problem p03085 (python)

Fixed submission:
b=input()
bases={'A':'T', 'T':'A', 'C':'G', 'G':'C'}
print(bases[b])

Buggy submission (verdict: Runtime Error):
bases={
  'A':'T',
  'T':'A',
  'C':'G',
  'G':'C'
}
b=input()
print(bases(b))

Buggy submission (verdict: Runtime Error):
bases={
  'A':'T',
  'T':'A',
  'C':'G',
  'G':'C'
}

print(bases(input()))
Problem p03086 (python)

Fixed submission:
import re

S=input()
pat = r'[ATCG]+'
parts = re.findall(pat,S)
if len(parts)==0:
  print(0) 
else:
  print(max([len(part) for part in parts]))

Buggy submission (verdict: Runtime Error):
import re

S=input()
pat = r'[ATCG]+'
parts = re.findall(pat,S)
print 0 if len(parts)==0 else max([len(part) for part in parts])

Buggy submission (verdict: Runtime Error):
import re

S=input()
pat = r'[ATCG]+'
parts = re.findall(pat,S)
print(max([len(part) for part in parts]))
Problem p03101 (python)

Fixed submission:
import sys
input = sys.stdin.readline
H,W = map(int,input().rstrip().split())
h,w = map(int,input().rstrip().split())
cells = [[1]*W]*H
cells = cells[h:]
cells = list(zip(*cells))
cells = cells[w:]
print(sum(list(map(sum,list(zip(*cells))))))

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
H,W = map(int,input().rstrip().split())
h,w = map(int,input().rstrip().split())
cells = [[1]*W]*H
cells = cells[h:]
cells = list(zip(*cells))
cells = cells[w:]
cells = list(zip(*cells))
print(int(sum(list(map(sum,[*cells])))))

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
H,W = map(int,input().rstrip().split())
h,w = map(int,input().rstrip().split())
cells = [[1]*W]*H
cells = cells[h:]
cells = list(zip(*cells))
cells = cells[w:]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().rstrip().split())
h,w = map(int,input().rstrip().split())
cells = [[1]*W]*H
cells = cells[h:]
cells = list(zip(*cells))
cells = cells[w:]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().rstrip().split())
h,w = map(int,input().rstrip().split())
cells = [[1]*W]*H
del cells[:h]
cells = list(zip(*cells))
del cells[:w]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
h,w = map(int,input().split())
cells = [[1]*W]*H
del cells[:h]
cells = list(zip(*cells))
del cells[:w]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
h,w = map(int,input().split())
cells = [[1]*W]*H
del cells[:h]
cells = list(zip(*cells))
del cells[:w]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
h,w = map(int,input().split())
cells = [[1]*W]*H
print(cells)
del cells[:h]
print(cells)
cells = list(zip(*cells))
del cells[:w]
cells = list(zip(*cells))
print(sum(list(map(sum,[*cells]))))
Problem p03451 (python)

Fixed submission:
N = int(input())
L1 = [x for x in map(int, input().split())]
L2 = [x for x in map(int, input().split())]
P1 = L1[:]
P2 = L2[:]
for i in range(1, N):
  P1[i] += P1[i-1]
for j in range(N-2, -1, -1):
  P2[j] += P2[j+1]
L3 = [0]*N
for k in range(N):
  L3[k] = P1[k]+P2[k]
print(max(L3))

Buggy submission (verdict: Runtime Error):
N = int(input())
L1 = map(int, input().split())
L2 = map(int, input().split())
P1 = L1[:]
P2 = L2[:]
for i in range(1, N):
  P1[i] += P1[i-1]
for j in range(N-1, -1, -1):
  P2[j] += P2[j+1]
L3 = [0]*N
for k in range(N):
  L3[k] = P1[k]+P2[k]
print(max(L3))
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')
Problem p03059 (python)

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

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(abs,a))
c = [a for a in A if a < 0]

if len(c) % 2 == 0:
    print(sum(b))
else:
    print(sum(b)-min(b)*2)
Problem p03062 (python)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = list(map(abs, A))
C = [a for a in A if a < 0]
if len(C) % 2 == 0:
    print((sum(B)))
else:
    print((sum(B) - min(B)*2))

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = list(map(abs,a))
C = [a for a in A if a < 0]

if len(C) % 2 == 0:
    print((sum(B)))
else:
    print((sum(B)-min(B)*2))

Buggy submission (verdict: Runtime Error):
n = int(input())
A = list(map(int,input().split()))
b = list(map(abs,a))
c = [a for a in A if a < 0]

if len(c) % 2 == 0:
    print(sum(b))
else:
    print(sum(b)-min(b)*2)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
b = list(map(abs,a))
c = list(a for a in A if a < 0)

if len(c) % 2 == 0:
    print(sum(b))
else:
    print(sum(b)-min(b)*2)
Problem p03085 (python)

Fixed submission:
b = input()
if b == "A":
    print("T")
if b == "G":
    print("C")
if b == "C":
    print("G")
if b == "T":
    print("A")

Buggy submission (verdict: Runtime Error):
d = ["A":"T","G":"C","C":"G","T":"A"]
print(d[input()])
Problem p03109 (python)

Fixed submission:
s=input()

if int(s[5:7]) <= 4:
    print('Heisei')
else:
    print('TBD')

Buggy submission (verdict: Runtime Error):
s = input
print("TBD") if int(s[5:7]) =>5 else print("Heisei")
Problem p03136 (python)

Fixed submission:
N =int(input())
L =[int(j) for j in input().split()]
if max(L) < sum(L)-max(L):
    print('Yes')
else:
    print('No')

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

l_max = max(l)
if sum(l) - l_max > l_max:
    print("Yes")
else:
    print("No")
Problem p03145 (python)

Fixed submission:
p,q,r=map(int,input().split())
print(p*q//2)

Buggy submission (verdict: Runtime Error):
p,q = map(int,input().split())
print(p * q / 2)
Problem p03210 (python)

Fixed submission:
old = input()
old = int(old)

if old == 3 or old == 5 or old == 7:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
x = int(input())
if X == 3 or x == 5 or x == 7:
    print('YES')
else:
    print('NO')
Problem p03220 (python)

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

minimum = 1234567890
for i in range(n):
    ti = t - h[i] * 0.006
    if abs(minimum - a) > abs(ti - a):
        minimum = ti
        ans = i + 1
        
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
t,a = map(int,input().split())
h = list(int(input()) for i in range(n))

mi = 1234567890
for i in range(n):
    ti = t - h[i] * 0.006
    if abs(mi - a) > abs(ti - a):
        mi = ti
        ans = i + 1
        
print(ans)
Problem p03260 (python)

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

if a*b%2==0:
  print('No')
else:
  print('Yes')

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

if(a*b%2==0){
  print('NO')
}else{
  print('YES')
}
Problem p03433 (python)

Fixed submission:
n=int(input())
a=int(input())
print('Yes' if n%500<=a else 'No');

Buggy submission (verdict: Runtime Error):
N , A = map(int,input().split())
print('YES') if N % 500 <= A else print('NO')
Problem p03455 (python)

Fixed submission:
def main():
    a, b = [int(_) for _ in input().split()]
    print("Even") if a * b % 2 == 0 else print("Odd")

main()

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

Buggy submission (verdict: Runtime Error):
def main():
    a , b =[int(_) for _ in input.split()]
    print('Even') if a * b % 2 ==0 else print('Odd')
    
main()

Buggy submission (verdict: Runtime Error):
input_a = input()
input_b = input()
a = int(input_a)
b = int(input_b)
c = a * b

if c % 2 == 0:
  print('Even')
else:
  print('Odd')

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

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

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

a=input()
b=input()

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

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

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

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

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

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

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

Buggy submission (verdict: Runtime Error):
print(input.count('1'))

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")
Problem p03693 (python)

Fixed submission:
a,b,c=list(map(int,input().split()))
print('YES') if (100*a+10*b+c)%4==0 else print('NO')

Buggy submission (verdict: Runtime Error):
a,b,c=list(map(int,input().split()))
print('YES') if a*b*c*%4==0 else print('NO')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split)
print('YES') if a * b * c % 4 ==0 else print('No')