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

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


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

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

b = input()


if int(a) % 2 == 0 or int(b) % 2 == 0:
    print('Even')
    
else:
    print('Odd')
Problem p03470 (python)

Fixed submission:
n = int(input())
d_list = [int(input()) for i in range(n)]
d_list.sort(reverse = True)
count = 1

for i in range(1, n):
    if d_list[i] < d_list[i-1]:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
d_list = list(map(int, input().split()))
d_list.sort(reverse = True)
count = 1

for i in range(1, n):
    if d_list[i] < d_list[i-1]:
        count += 1
print(count)
Problem p03353 (python)

Fixed submission:
def substring():
    a = input()
    K = int(input())
    atra = set()
    
    for i in range(len(a)):
        for j in range(i + K + 1):
            if i >= j:
                continue
            atra.add(a[i:j])
    atra = sorted(atra)
    print(atra[K - 1])
    
if __name__ == '__main__':
    substring()

Buggy submission (verdict: Runtime Error):
def substring():
    sub = []
    words = input()
    num = int(input())
    for i in range(len(words)):
        for j in range(len(words)):
            word = words[i:j+1]
            if word not in sub:
                sub.append(word)
    sub.sort()
    del sub[0]
    print(sub[num-1])
    
if __name__ == '__main__':
    substring()
Problem p03359 (python)

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

takahashi = a 

if a > b:
    takahashi -= 1
print(takahashi)

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

for i in range(K):
    if 2*A > (B + C):
        A = A * 2
    elif 2*B > (A + C):
        B = B * 2
    elif 2*C > (B + A):
        C = C * 2
    elif A == B == C:
        A = A * 2

print(A+B+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, b = map(int, input().split())

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

Fixed submission:
S = input()

a = S[0]
b = ''
cnt = 0

for st in S[1:]:
  b += st
  
  if a == b:
    continue
  else:
    cnt += 1
    a = b
    b = ''

if cnt > 0:
  cnt += 1

print(cnt)

Buggy submission (verdict: Runtime Error):
N,K = (int(i) for i in input().split())
S = input()

a = [S]
res = []

for i in range(K):
  res = []
  
  for k in a:
    Ss = k[::-1]
    SSs = k + Ss
    a = []
  
    for j in range(len(S)):
      a.append(SSs[j:len(S)+j])
      res.append(SSs[j:len(S)+j])
  
print(min(res))
Problem p03644 (python)

Fixed submission:
a = int(input())
b = range(1, a + 1)
res = 1
max_cnt = 0

for index, bb in enumerate(b):
  cnt = 0
  while True:
    if bb % 2 == 0:
      bb /= 2
      cnt += 1
    else:
      break
  if cnt > max_cnt:
    max_cnt = cnt
    res = index + 1
    
print(res)

Buggy submission (verdict: Runtime Error):
a = input()
b = range(1, a + 1)
res = 0
max_cnt = 0

for bb in b:
  cnt = 0
  bb_org = bb
  while True:
    if bb % 2 == 0:
      bb /= 2
      cnt += 1
    else:
      break
  if cnt > max_cnt:
    max_cnt = cnt
    res = bb_org
    
print(res)

Buggy submission (verdict: Runtime Error):
a = input()
b = range(1, a + 1)
res = 0
max_cnt = 0

for index, bb in enumerate(b):
  cnt = 0
  while True:
    if bb % 2 == 0:
      bb /= 2
      cnt += 1
    else:
      break
  if cnt > max_cnt:
    max_cnt = cnt
    res = index + 1
    
print(res)
Problem p03029 (python)

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

num1 =  ( int(n[0]) * 3 + int(n[1])) // 2

print(num1)

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

num1 =  ( int(n[0]) * 3 + int(n[1]) ) // 2

print(num1)

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

num1 =  ( n[0] * 3 + n[1] ) // 2

print(num1)
Problem p02982 (python)

Fixed submission:
import numpy as np


n,d=map(int,input().split())
x=[]
cnt=0
X=[]
for i in range(n):
    x=input().split()
    x=[int(i) for i in x]
    X.append(x)


for i in range(n,0,-1):
    for j in range(i-1,0,-1):
        a=np.array(X[i-1])
        b=np.array(X[j-1])
        u=b-a
        u=np.linalg.norm(u)
        if(int(u)==u):
            cnt+=1

        
print(cnt)

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


n,d=map(int,input().split())
x=[]
X=[]
cnn=0
for i in range(n):
    x=input().split()
    x=[int(i) for i in x]
    X.append(x)

for i in range(n-1):
    for j in range(n-i,n,1):
        a=np.array(X[i])
        b=np.array(X[i+1])
        u=b-a
        if u==int(u):
            cnn+=1
print(cnn)
Problem p03493 (python)

Fixed submission:
temp=input()
cnt=0
for i in temp:
  if i=='1':
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
cnt=0
b=1
N=int(input())
A=input().split()

A=[int(A[j]) for j in range(N)]

while b==1:
  for i in range(N):
    if A[i]%2==0:
      A[i]=A[i]/2
    else:
      b=0
      break
  if b==1:
    cnt+=1     
  else:
    break
print(cnt)
Problem p02922 (python)

Fixed submission:
import math
A, B = list(map(int, input().split()))
 
print(math.ceil((B-1)/(A-1)))

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

for x in range(20):
	if (A-1)*x + 1 >= B:
      print(x)
      break

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

for x in range(10):
	if (A-1)*x + 1 >= B:
      print(x)
      break

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

for x in range(10):
	if (A-1)*x + 1 == B:
      print(x)
      break
Problem p02982 (python)

Fixed submission:
import math
N, D = list(map(int, input().split()))
X = []
for i in range(N):
  X.append(list(map(int, input().split())))

count = 0
for a in range(N):
  for b in range(a+1, N):
    sumX = 0
    for c in range(D):
      sumX += (X[a][c]-X[b][c])**2
    if math.sqrt(sumX)%1 == 0:
      count += 1
print(count)

Buggy submission (verdict: Runtime Error):
import math
N, D = list(map(int, input().split()))
X = []
for i in range(N):
  X.append(list(map(int, input().split())))

count = 0
for a in range(N):
  for b in range(a+1, N):
  sumX = 0
    for c in range(D):
      sumX += (X[a][c]-X[b][c])**2
  if math.sqrt(sumX)%1 == 0:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
import math
N, D = list(map(int, input().split()))
X = []
for i in range(N):
  X.append(list(map(int, input().split())))

count = 0
for a in range(N):
  for b in range(a+1, N):
  sumX = 0
    for c in range(D):
      sumX += (X[a][c]-X[b][c])**2
    if math.sqrt(sumX)%1 == 0:
      count += 1
print(count)
Problem p03076 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())

X = [A, B, C, D, E]
Y = [[x, 10-x%10] for x in X]
acc = 0
for y in Y:
    if y[1] == 10:
        acc += y[0]
    else:
        acc += y[0] + y[1]
Z = [10-a%10 for a in X if (10-a%10) < 10]
if Z:
    acc -= max(Z)
print(acc)

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

X = [A, B, C, D, E]
Y = [[x, 10-x%10] for x in X]
acc = 0
for y in Y:
    if y[1] == 10:
        acc += y[0]
    else:
        acc += y[0] + y[1]
Z = [10-a%10 for a in X if (10-a%10) < 10]
acc -= max(Z)
print(acc)
Problem p03943 (python)

Fixed submission:
c_list = list(map(int, input().split()))
c_list.sort()

if c_list[0] + c_list[1] == c_list[2]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
c_list = list(map(int, input().split()))
c_list.sort()
if sort[0] + sort[1] == sort[2]:
  print('Yes')
else:
  print('No')
Problem p02936 (python)

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

tree = {i:[] for i in range(1, n + 1)}
for _ in range(1, n):
    a, b = map(int, input().split())
    tree[a].append(b)
    tree[b].append(a)

cnt = [0]*n
for _ in range(q):
    p, x = map(int, input().split())
    cnt[p-1] += x

check = [0]*n

tmp = [1]
while len(tmp) != 0:
    tmp2 = tmp
    tmp = []
    for oya in tmp2:
        check[int(oya)-1] = 1
        for ko in tree[oya]:
            if check[ko-1] == 0:
                cnt[ko-1] += cnt[oya-1]
                tmp.append(ko)


print(" ".join(map(str, cnt)))

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

tree = {i:[] for i in range(1, n + 1)}
for _ in range(1, n):
    a, b = map(int, input().split())
    tree[a].append(b)
    tree[b].append(a)

tmp = [1]
while len(tmp) != 0:
    tmp2 = tmp
    tmp.clear()
    for bbb in tmp2:
        tree[bbb].remove(bbb)
        tmp.extend(tree[bbb])


cnt = [list(map(int, input().split())) for _ in range(q)]

ans = [0]*n
for p, x in cnt:
    tmp = [p]
    while len(tmp) != 0:
        for i in tmp:
            ans[i-1] += x
        tmp2 = tmp
        tmp.clear()
        for aaa in tmp2:
            tmp.extend(tree[aaa])
    print(ans)

print(" ".join(map(str, ans)))
Problem p02960 (python)

Fixed submission:
s=input()
l=len(s)

mod=10**9+7

dp=[[0 for j in range(13)] for i in range(l)]

if s[0] =="?":
    dp[0] = [1]*10+[0]*3
else:
    dp[0][int(s[0])] =1

for i in range(1, l):
 if s[i]=='?':
   for j in range(10):
     for k in range(13):
       dp[i][(k*10+j)%13]+=dp[i-1][k]%mod
 else:
   for k in range(13):
     dp[i][(k*10+int(s[i]))%13]+=dp[i-1][k]%mod
print(dp[-1][5]%mod)

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

s = input()[::-1]

dp = np.zeros((len(s),13))

if s[0] =="?":
    dp[0] = [1]*10+[0]*3
else:
    dp[0][int(s[0])] =1

L1 = range(1, len(s))

mod = 1
for i in L1:
    if s[i] == "?":
        mod = (mod*10)%13
        mod_list = ((mod*i)%13 for i in range(10))
        for j in mod_list:
            dp[i, :] += np.roll(dp[i - 1, :], j)
        dp[i, :] %= (10**9+7)
    else:
        mod = (mod*10)%13
        dp[i, :] += np.roll(dp[i - 1, :], (mod * int(s[i]))%13)

print(int(dp[-1][5])%(10**9+7), aaa)

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

s = input()[::-1]

dp = np.zeros((len(s),13), dtype="uint64")

if s[0] =="?":
    dp[0] = [1]*10+[0]*3
else:
    dp[0][int(s[0])] =1

L1 = range(1, len(s))

for i in L1:
    if s[i] == "?":
        mod = pow(10, i, 13)
        mod_list = ((mod*i)%13 for i in range(10))
        for j in mod_list:
            dp[i, :] += np.roll(dp[i - 1, :], j)
        dp[i, :] %= (10**9+7)
    else:
        mod = (pow(10, i, 13)*int(s[i]))%13
        dp[i, :] += np.roll(dp[i - 1, :], mod)

print(int(dp[-1][5])%(10**9+7))
Problem p03001 (python)

Fixed submission:
W, H, x, y = [int(i) for i in input().split()] 

if W/2 == x and H/2 == y:
    print(W*H/2, 1)
else:
    print(W*H/2, 0)

Buggy submission (verdict: Runtime Error):
W, H, x, y = [int(i) for i in input().split()] 

if W/x == 2 and H/y == 2:
    print(W*H/2, 1)
else:
    print(W*H/2, 0)
Problem p03005 (python)

Fixed submission:
N, K = (int(i) for i in input().split())

if K==1:
    ans=0
else:
    ans=N-K

print(ans)

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

if K=1:
    ans=0
else:
    ans=N-K
print(ans)
Problem p03029 (python)

Fixed submission:
A, P = (int(i) for i in input().split())
  
N = (A*3+P%2)//2+P//2

print(N)

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

N = (A*3+P%2)//2+P//2

print(N)

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

N = (A*3+P%2)//2+P//2

print(N)

Buggy submission (verdict: Runtime Error):
A = input()
P = input()

N = (A*3+P%2)//2+P//2

print(N)
Problem p03031 (python)

Fixed submission:
N, M = (int(i) for i in input().split())
  
dict_rel = dict()
for i in range(M):
  dict_rel[i+1] = [int(j) for j in input().split()][1:]
list_cond = [int(i) for i in input().split()]

#print(dict_rel)
#print(list_cond)

list_pattern = [[] for j in range(2**N)]

for i in range(len(list_pattern)):
  b = bin(i)[2:].zfill(N)
  list_pattern[i] = [int(k) for k in b]

#print(list_pattern)

num_full = 0
for pattern in list_pattern:
  flg = True
  for light in dict_rel.keys():
    num_on = 0
    for i in dict_rel[light]:
      if pattern[i-1] == 1:
        num_on += 1
    if list_cond[light-1] != num_on%2:
      flg = False
      #break
  if flg == True:
    num_full += 1

print(num_full)

Buggy submission (verdict: Runtime Error):
N, M = (int(i) for i in input().split())
  
dict_rel = dict()
for i in range(M):
  dict_rel[i+1] = [int(j) for j in input().split()][1:]
list_cond = [int(i) for i in input().split()]

#print(dict_rel)
#print(list_cond)

list_pattern = list()

for i in range(N):
  for j in [0,1]:
    list_pattern.append([i, j])

#print(list_pattern)
#print(list_pattern)

num_full = 0
for pattern in list_pattern:
  flg = True
  for light in dict_rel.keys():
    num_on = 0
    for i in range(len(dict_rel[light])):
      if pattern[i] == 1:
        num_on += 1
    if list_cond[light-1] != num_on%2:
      flg = False
      break
  if flg == True:
    num_full += 1

print(num_full)
Problem p02921 (python)

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

ans = 0

if S[0] == T[0] :
	ans += 1

if S[1] == T[1] :
	ans += 1

if S[2] == T[2] :
	ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
S = input().split()
T = input().split()

ans = 0

if S[0] == T[0] :
	ans += 1

elif S[1] == T[1] :
	ans += 1

elif S[2] == T[2] :
	ans += 1

print(ans)

Buggy submission (verdict: Runtime Error):
S = input().split()
T = input().split()

ans = 0

for i in range(3) :
	if S[i] == T[i] :
		ans += 1

print(ans)
Problem p02922 (python)

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

ans = 0

if B == 1 :
	print(0)

elif B <= A :
	print(1)

elif (B-A)%(A-1) <= 0 :
	ans = (B-A)//(A-1)+1
	print(ans)
elif (B-A)%(A-1) >= 1 :
	ans = (B-A)//(A-1)+2
	print(ans)

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

ans = 0

if B = 1
print(0)

elif B <= A :
	print(1)

elif (B-A)%(A-1) <= 0 :
	ans = (B-A)//(A-1)+1
	print(ans)
elif (B-A)%(A-1) >= 1 :
	ans = (B-A)//(A-1)+2
	print(ans)
Problem p02945 (python)

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

Buggy submission (verdict: Runtime Error):
print(max(a+b,a-b,a*b))

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
 
print(max(int(a+b,a-b,a*b)))

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
 
print(max(int(A+B,A-B,A*B)))
Problem p02952 (python)

Fixed submission:
n = int(input())
 
if  n <= 9:
    print(n)
elif 10 <= n <= 99:
    print(9)
elif 100 <= n <= 999:
    print(n-99+9)
elif 1000 <= n <= 9999:
    print(909)
elif 10000 <= n <= 99999:
    print(n-9999+909)
elif n == 100000:
    print(90909)

Buggy submission (verdict: Runtime Error):
N = int(input())
s = str(len(N))
 
if s = 1 :
	print(N)
elif s = 2 :
	print(9)
elif s = 3 :
	print(9 + N -99)
elif s = 4 :
	print(909)
elif s = 5 :
	print(909 + N - 9999)
elif s = 6 :
	print(90909)

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

if N < 10 :
	print(N)
elif 10 <= N <= 99 :
	print(9)
elif 100 <= N <= 999 :
	print(9 + N -99)
elif 1000 <= N <= 9999 :
	print(909)
elif 10000 <= N <= 99999 :
	print(909 + N - 9999)
elif N = 100000 :
	print(90909)

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

if N < 10 :
	print(N)
elif 10 <= N <= 99 :
	print(9)
elif 100 <= N <= 999 :
	print(9 + N -99)
elif 1000 <= N <= 9999 :
	print(909)
elif 10000 <= N <= 99999 :
	print(909 + N - 9999)
elif N = 100000 :
	print(90909)

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

if s = 1 :
	print(N)
elif s = 2 :
	print(9)
elif s = 3 :
	print(9 + N -99)
elif s = 4 :
	print(909)
elif s = 5 :
	print(909 + N - 9999)
elif s = 6 :
	print(90909)

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

if s = 1 :
	print(N)
elif s = 2 :
	print(9)
elif s = 3 :
	print(9 + N -99)
elif s = 4 :
	print(909)
elif s = 5 :
	print(909 + N - 9999)
elif s = 6 :
	print(90909)

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

if s = 1 :
	print(N)
if s = 2 :
	print(9)
if s = 3 :
	print(9 + N -99)
if s = 4 :
	print(909)
if s = 5 :
	print(909 + N - 9999)
if s = 6 :
	print(90909)

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

if ans = 1:
	print(N)

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

if N <= 9
	print(N)

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

if 1 <= N <= 9
	print(N)
Problem p02957 (python)

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

if (A+B)%2 == 1 :
	print('IMPOSSIBLE')
else :
	print((A+B)//2)

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

for i in range(n):
	if a[i] >= b[i]:
		c += b[i]
	else:
		c += a[i]
		c += min(a[i+1],b[i]-a[i])
		if a[i+1] >= b[i]-a[i]:
			a[i+1] = a[i+1] - (b[i] - a[i])
		else:
			a[i+1] = 0
print(c)

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

if (A+B)%0 :
	print((A+B)/2)
else :
	print('IMPOSSIBLE')
Problem p02958 (python)

Fixed submission:
N = int(input())
p = list(map(int,input().split()))
 
ans = 0
 
for i in range(N):
    if p[i] != (i+1) :
        ans += 1
 
if ans == 0:
    print('YES')
elif ans == 2:
      print('YES')
else :
    print('NO')

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

ans = 0

for i in range(N):
	if p[N] == (N+1) :
		ans += 1

if ans == N or N-2:
	print('YES')
else :
	print('NO')

Buggy submission (verdict: Runtime Error):
N = int(input())
p = list(map(int,input().split()))
 
ans = 0
q =p.sorted(0
 
for i in range(N):
	if p[i] != q[i] :
		ans += 1
 
if ans == 0:
	print('Yes')
elif ans == 2:
  	print('Yes')
else :
	print('No')

Buggy submission (verdict: Runtime Error):
N = int(input())
p = list(map(int,input().split()))
 
ans = 0
 
for i in range(N+1):
	if p[i] != (i+1) :
		ans += 1
 
if ans == 0:
	print('Yes')
elif ans == 2:
  	print('Yes')
else :
	print('No')

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

ans = 0

for i in range(N-1):
	if p[i] == i :
		ans += 1

if ans == N or N-2:
	print('Yes')
else :
	priint('No')

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

ans = 0

for i in range(N):
	if p[i] == i :
		ans += 1

if ans == N or N-2:
	print('Yes')
else :
	priint('No')
Problem p02993 (python)

Fixed submission:
S = input()
 
if S[0]==S[1] or S[1]==S[2] or S[2]==S[3] :
	print('Bad')
else:
	print('Good')

Buggy submission (verdict: Runtime Error):
S = map(int,input())
 
if S[0]==S[1] or S[1]==S[2] or S[2]==S[3] :
	print('Bad')
else:
	print('Good')

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

if S[0]==S[1] or S[1]==S[2] or S[2]==S[3] or S[3]==S[4] :
	print('Bad')
else:
	print('Good')

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

if S[0]=S[1] or S[1]=S[2] or S[2]=S[3] or S[3]=S[4] :
	print('Bad')
else:
	print('Good')

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

for i in range(4) :
	if S[i-1] == S[i] :
		print('Bad')
	break :
	else: 
		print('Good')
Problem p03035 (python)

Fixed submission:
a,b = map(int,input().split())
 
if a <= 5 :
  print(0)
elif a <= 12 :
  print(int(b//2))
else :
  print(b)

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split
 
if a <= 5 :
  print(0)
elif a <= 12 :
  print(int(b//2))
else :
  print(b)

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

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

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

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

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

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

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

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

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

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

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

if abs(A-B) >= 2 :
	print(max([A,B])*2-1)
elif abs(A-B) == 1 :
	print(A+B)
else :
	print(A*2)

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

if abs(A-B) >= 2 :
	print(A*2-1)
elif abs(A-B) = 1 :
	print(max([A,B])+min([A,B]))
else :
	print(A*2)

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

if abs(A-B) >= 2 :
	print(A*2-1)
elif abs(A-B) = 1 :
	print(max([A,B])+min([A,B]))
else :
	print(A*2)
Problem p03085 (python)

Fixed submission:
b = str(input())

if b == "A" :
	print("T")
elif b == "T" :
	print("A")
elif b == "C" :
	print("G")
elif b == "G" :
	print("C")

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

if b == A :
	print("T")
elif b == T :
	print("A")
elif b == C :
	print("G")
elif b == G :
	print("C")

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

if b == A :
	print("T")
elif b == T :
	print("A")
if b == C :
	print("G")
elif b == G :
	print("C")

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

if b = A :
	print("T")
elif b = T :
	print("A")
if b = C :
	print("G")
elif b = G :
	print("C")

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

if b = A:
	print("T")
elif b = T:
	print("A")
if b = C:
	print("G")
elif b = G:
	print("C")
Problem p03109 (python)

Fixed submission:
s = input()

if s <= "2019/04/30":
    print("Heisei")
else:
    print("TBD")

Buggy submission (verdict: Runtime Error):
S = input().split("/")

if int(S[5]) < 5 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = input().split("/")

if S[5] < 5 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = input().split("/")
 
if int(S[5]) < 5 and int(S[4]) == 0 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = input().split("/")
 
if int(S[5]) < 5 and int(s[4]) ==0 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = input().split("/")

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

Buggy submission (verdict: Runtime Error):
S = input().split("/")

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

Buggy submission (verdict: Runtime Error):
S = input().sprint("/")

if int(S[5]) < 5 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = input().split("/")

if int(S[5]) < 5 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
S = int(input().split("/"))

if S[5] < 5 :
	print('Heisei')
else :
	print('TBD')

Buggy submission (verdict: Runtime Error):
import datetime

S = input().datetime

if S <= 2019/04/30 :
	print("Heisei")
else :
	print("TBD")

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

if S <= 2019/04/30 :
	print("Heisei")
else :
	print("TBD")
Problem p03125 (python)

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

if B%A == 0 :
	print(A+B)
else :
	print(B-A)

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

if B%A = 0 :
	print(int(A+B)
else :
	print(int(B-A))

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

if B%A = 0 :
	print(A+B)
else :
	print(B-A)
Problem p03136 (python)

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

if sum(L[:-1]) > L[-1] :
	print('Yes')
else:
	print('No')

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

if sum(L[:-1]) > L[:-1] :
	print('Yes')
else:
	print('No')

print(L)
Problem p03773 (python)

Fixed submission:
lst = input().split(" ")
A =int(lst[0])
B =int(lst[1])
print((A+B)%24)

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