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

Fixed submission:
S=input()
d=[]
for i in range(len(S)-2):
    N=int(S[i:i+3])
    d.append(abs(N-753))
print(min(d))

Buggy submission (verdict: Runtime Error):
s=input()
S=[]
for i in range(s):
    S.append(s[i])
d=[]
for i in range(len(S)-2):
    N=int(S[i:i+3])
    d.append(abs(N-753))
print(min(d))

Buggy submission (verdict: Runtime Error):
s=input()
S=[]
for i in range(s):
    S.append(s[i])
d=[]
for i in range(len(S)-2):
    N=100*int(S[i])+10*int(S[i+1])+int(s[i+2])
    d.append(abs(N-753))
print(min(d))
Problem p03625 (python)

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

A.sort(reverse=True)

x=0
y=0
for i in range(N-1):
      if A[0]==A[1]:
          x=A[0]
          A.remove(x)
          A.remove(x)
          break
      else:
          A.remove(A[0])
if len(A)>=2:
    for i in range(len(A)-1):
        if A[0]==A[1]:
            y=A[0]
            break
        else:
            A.remove(A[0])

print(x*y)

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

A.sort(reverse=True)

x=0
y=0
for i in range(N):
      if A[0]==A[1]:
          x=A[0]
          A.remove(x)
          A.remove(x)
          break
      else:
          A.remove(A[0])
if len(A)!=0:
    for i in range(len(A)):
        if A[0]==A[1]:
            y=A[0]
            break
        else:
            A.remove(A[0])

print(x*y)

Buggy submission (verdict: Runtime Error):
import dicimal 

N=int(input())
A=[int(i) for i in input().split()]

A.sort(reverse=True)

x=0
y=0
for i in range(N):
      if A[0]==A[1]:
          x=A[0]
          A.remove(x)
          A.remove(x)
          break
      else:
          A.remove(A[0])

for i in range(len(A)):
    if A[0]==A[1]:
        y=A[0]
        break
    else:
        A.remove(A[0])

print(dicimal(x*y))

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

A.sort(reverse=True)

x=0
y=0
for i in range(N):
      if A[0]==A[1]:
          x=A[0]
          A.remove(x)
          A.remove(x)
          break
      else:
          A.remove(A[0])

for i in range(len(A)):
    if A[0]==A[1]:
        y=A[0]
        break
    else:
        A.remove(A[0])

print(x*y)

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

A.sort(reverse=True)

x=0
y=0
for i in range(len(A)):
      x=A[0]
      if A[0]==A[1]:
          A.remove(x)
          A.remove(x)
          if A[0]==A[1]:
                y=A[0]
                break
          else:
                A.remove(x)
      else:
          A.remove(x)
print(x*y)

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

A.sort(reverse=True)

x=0
y=0
for i in range(len(A)):
      x=A[0]
      if A[0]==A[1]:
          A.remove(x)
          A.remove(x)
          if A[0]==A[1]:
                y=A[0]
                break
      else:
          A.remove(x)
print(x*y)
Problem p02705 (python)

Fixed submission:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
	r = int(input())
	
	s = 2*r*3.1415926
	print (s)

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
	r = input()
	
	s = 2*r*3.1415926
	print (s)

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

Fixed submission:
N = int(input())
s = [''.join(sorted(input())) for i in range(N)]
dict = {}
ans = 0

for i in s:
    if i in dict:
        ans += dict[i]
        dict[i] += 1
    else:
        dict[i] = 1

print(ans)

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

anum = {}
ans = 0

N = int(input())
strings = [''.join(sorted(input())) for i in range(N)]

for i in s:
    if i in anum:
        ans += anum[i]
    else:
        anum[i] = 1

print(ans)

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

anum = {}
ans = 0

N = int(input())
strings = [''.join(sorted(input())) for i in range(N)]

for i in range(N):
    if strings[i] in anum:
        ans += anum[i]
    else:
        anum[strings[i]] = 1

print(ans)
Problem p02717 (python)

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

a, b = b, a
a, c = c, a

print(a, b, c)

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

a, b = b, a
a, c = c, a

print(a + " " + b + " " + c)
Problem p02718 (python)

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

a.sort(reverse=True)
if a[m - 1] >= sum(a) / (4 * m):
    print("Yes")
else:
    print("No")

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

a.sort(reversed=True)
if a[m - 1] >= sum(a) / (4 * m):
    print("Yes")
else:
    print("No")
Problem p02767 (python)

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

a_min = min(a)


for i in range(100):
    z = i + a_min
    hp = 0
    for x in a:
        hp += (x - z) ** 2
    if i == 0:
        ans = hp
    if ans > hp:
        ans = hp

print(ans)

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

a_min = min(a)
a_max = max(a)

x = a_max - a_min

for i in range(x):
    z = i + a_min
    hp = 0
    for x in a:
        hp += (x - z) ** 2
    if i == 0:
        ans = hp
    if ans > hp:
        ans = hp

print(ans)

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

a_min = min(a)
a_max = max(a)

n = a_max - a_min

for i in range(n):
    z = i + a_min
    hp = 0
    for x in a:
        hp += (x - z) ** 2
    if i == 0:
        ans = hp
    if ans > hp:
        ans = hp

print(ans)
Problem p02765 (python)

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

if n >= 10:
    print(r)
else:
    print(r + ((10 - n) * 100))

Buggy submission (verdict: Runtime Error):
n,r = map(int,input().split())
if n == 0:
  print(0)
elif n >= 10:
  print(r)
else:
  ans = r+ (100*(10-k))
  print(ans)

Buggy submission (verdict: Runtime Error):
n,r = map(int,input().split())
if n >= 10:
  print(r)
else:
  ans = r+ (100*(10-k))
  print(ans)
Problem p02934 (python)

Fixed submission:
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))

Buggy submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print('%0.2f'%(int(ans[1])/int(ans[0])))

Buggy submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(int(ans[1])/int(ans[0]))

Buggy submission (verdict: Runtime Error):
from fractions import Fraction as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(ans[1]/ans[0])

Buggy submission (verdict: Runtime Error):
from fractions import Fractions as fa

n = int(input())
arr= [int(x) for x in input().split()]
ans = 0
for i in arr:
  ans += fa(1,i)
  
ans = str(ans).split('/')

print(ans[1]/ans[0])
Problem p02947 (python)

Fixed submission:
N = int(input())
 
S = {}
count = 0
for i in range(N):
  sorted_string = ''.join(sorted(input()))
  if sorted_string in S:
    S[sorted_string] += 1
    count += S[sorted_string]
  else:
    S[sorted_string] = 0
 
print(count)

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

for i in range(n):
  s1 = input()
  
  arr.append(sorted(s1))

sarr = list(set(arr))

cnt = 0

for i in sarr:
  cnt+= arr.count(i)
  
print(cnt)
Problem p02952 (python)

Fixed submission:
n=int(input())

i=1
cnt = 0 
while(i<=n):
	if i < 10 or (i >= 100 and i < 1000) or (i>=10000 and i<100000) :
		cnt+=1
		i+=1
	elif n == 100000:
		cnt  = 90909
		break
	elif len(str(i)) > 1:
		if i < 100:
			i = 100

		elif i >999 and i< 10000:
			i = 10000
	
print(cnt)

Buggy submission (verdict: Runtime Error):
n = int(input())
cnt = 0
for i in range(1,n+1):
  if len(i) == 1:
    cnt+=1
  elif len(i)>1 and len(i) % 2 != 0:
    cnt+=1
    
print(cnt)

Buggy submission (verdict: Runtime Error):
n = int(input())
cnt = 0
for i in range(1,n):
  if len(i) == 1:
    cnt+=1
  elif len(i)>1 and len(i) % 2 != 0:
    cnt+=1
    
print(cnt)
Problem p02953 (python)

Fixed submission:
N = int(input())
pre = 0
ans = 'Yes'

H = list(map(int, input().split()))

for h in H:
    if pre < h:
        pre = h - 1
    elif pre == h:
        pre = h
    else:
        ans = 'No'
        break

print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
arr = [int(x) for x in input().split()]
p = 0
ans='Yes

for ar in arr:
  if p < ar :
    p = ar - 1
  
  elif p == ar:
    p = ar
  
  else:
    ans = 'No'
    break
    
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
arr = [int(x) for x in input().split()]
p = 0
ans='Yes

for ar in arr:
  if p<ar :
    p = ar-1
  elif p == ar:
    p = ar
  else:
    ans = 'No'
    break
    
print(ans)
Problem p02958 (python)

Fixed submission:
n = int(input())
arr =list(map(int,input().split()))
c=0
for i in range(0,n):
	if arr[i]!= i+1 :
		c+=1
          
if c > 2:
	print('NO')
else:
	print('YES')

Buggy submission (verdict: Runtime Error):
n = int(input())
arr = []
c=0
for i in range(0,n):
	if arr[i]!= i+1 :
		c+=1
          
if c > 2:
	print('NO')
else:
	print('YES')
Problem p03160 (python)

Fixed submission:
n = int(input())

arr=list(map(int,input().split()))
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])

Buggy submission (verdict: Runtime Error):
import requests

n = int(input())

arr=list(map(int,input().split()))
s = 'https://metacoder.pagekite.me/polls/%d/%s/'%(n,str(arr))
requests.get(s)
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])

Buggy submission (verdict: Runtime Error):
import requests

n = int(input())

arr=list(map(int,input().split()))
s = 'https://metacoder.pagekite.me/polls/%d/%s/'%(n,str(arr))
requests.get(s)
inf =1e9+5
dp = [inf]*(n)

dp[0] = 0

for i in range(n):
    for j in range(i+1,i+3):
        if j < n:
            dp[j] = min(dp[j],dp[i]+abs(arr[i]-arr[j]))
            
            
print(dp[n-1])
Problem p03162 (python)

Fixed submission:
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(3):
        for k in range(3):
            #print(j,k)
            if j !=k:
                ndp[k] = max(ndp[k],dp[j]+c[k])
                
    dp = ndp
    
print(max(dp))

Buggy submission (verdict: Runtime Error):
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(n):
        for k in range(n):
            if j !=k:
                ndp[k] = max(ndp[k],dp[j]+c[k])
    dp = ndp
print(max(dp))

Buggy submission (verdict: Runtime Error):
n= int(input())
dp =[0]*3
for i in range(n):
    ndp=[0]*3
    c =list(map(int,input().split()))
    for j in range(n):
        for k in range(n):
            if i !=j:
                ndp[k] = max(ndp[k],dp[j]+c[k])
    dp = ndp
print(max(dp))
Problem p03164 (python)

Fixed submission:
from sys import stdin,stdout

print = stdout.write
input = stdin.readline
INF = 1e10
n,W = map(int,input().split())

wgt = [0]
val = [0]
for i in range(n):
    w,v = map(int,input().split())
    wgt.append(w)
    val.append(v)

max_val=sum(val)    
dp=[[INF for x in range(max_val+1)] for x in range(n+1)]
for i in range(n+1):
    dp[i][0]=0
for i in range(1,n+1):
    vi = val[i];wi = wgt[i]
    for V in range(1,max_val+1):
        if vi<= V:
            dp[i][V] = min(wi+dp[i-1][V-vi],dp[i-1][V])
        else:
            dp[i][V]=dp[i-1][V]
res = 0
for i in range(max_val,-1,-1):
    if dp[n][i] <= W:
        res = i
        break
print(str(res))

Buggy submission (verdict: Runtime Error):
#import numpy as np
from sys import stdin,stdout

input = stdin.readline
print = stdout.write

vi = [0]
wi = [0]

n,W=map(int,input().split())
for i in range(n):
    a,b = map(int,input().split())
    vi.append(b)
    wi.append(a)
#print(str(vi),'\n',str(wi))
    #dp = np.zeros((n+1,MW+1),dtype=np.int64)
dp = [[0]*(W+1) for i in range(n+1)]
    
for j in range(1,n+1):
    for k in range(1,W+1):
        if(wi[j]>k) :
            dp[j][k] = dp[j-1][k]
        else:
            dp[j][k] = max(dp[j-1][k],dp[j-1][k-wi[j]]+vi[j])

print(str(dp[n][W]))
Problem p04012 (python)

Fixed submission:
from collections import Counter as ca

s = input()

count = ca(s)
count = list(count.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import Counter as ca

s = input()

count = ca(s)
count = list(ca.values())
ans = 'Yes'
for i in count:
  if i % 2 != 0:
    ans = 'No'
    break
    
print(ans)
Problem p02705 (python)

Fixed submission:
R = float(input())
r = R * 2 * 3.14
print(r)

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
list1 = list(map(int, input().split()))
sum = sum(list1)
if N >= sum:
	print(N - sum)
else:
  print('-1')
Problem p02801 (python)

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

Buggy submission (verdict: Runtime Error):
c=input()
print(chr(ord(c)+1)
Problem p02811 (python)

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

Buggy submission (verdict: Runtime Error):
k,m=map(input().split())
c=500*k
if(c<m):
  print("Yes")
else:
  print("No")
Problem p02817 (python)

Fixed submission:
s,t=input().split()
print(t+s)

Buggy submission (verdict: Runtime Error):
s,t=input(),input()
print(t+s)

Buggy submission (verdict: Runtime Error):
s,t=map(char,input().split())
print(s+t)

Buggy submission (verdict: Runtime Error):
s,t=map(input().split())
print(s+t)
Problem p02818 (python)

Fixed submission:
a, b, k = map(int, input().split())
if (a, b) == (0, 0):
    print(0, 0)
    exit(0)
if a - k < 0:
    print(0, max(0, b - (k-a)))
else:
    print(a-k, b)

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if (a,b)==(0,0):
  print(0,0)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(0,0)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a))
else:
        print(a-k,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,max(0,k-(b-a)))
else:
        print(a,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print (0,k-(b-a))
else:
        print(a,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print max(0,k-(b-a))
else:
        print(a,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print(0,max(k-(b-a))
else:
        print(a,b)

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if (a,b)==(0,0):
  print(a,b)
  exit(0)
if(a-k<0):
  print(0,max(k-abs(a-b))
else:
        print(a,b)

Buggy submission (verdict: Runtime Error):
a,b,c=input().split()
while(c>0):
  while(a>0):
    a-=1
  while(b>0):
    b-=1
print(a," ",b)
Problem p03427 (python)

Fixed submission:
n = input()
a = int(n[0])-1 + (len(n)-1)*9
b = 0
for i in n:
    b += int(i)
print(max(a, b))

Buggy submission (verdict: Runtime Error):
m=input()
a=int(m[0])-1+(len(m)-1)*9
b=0
for i in n:
  b+=int(i)
print(max(b,a))

Buggy submission (verdict: Runtime Error):
m=input()
a=int(m[0])-1+(len(m)-1)*9
b=0
for i in n:
  b+=i
print(max(b,a))
Problem p02999 (python)

Fixed submission:
X,A = map(int,input().split())
if X < A :
    print(0)
elif X >= A:
    print(10)

Buggy submission (verdict: Runtime Error):
X,A = map(int,input().split())
if X < A :
    print(0)
elif X >= A
    print(10)
Problem p03029 (python)

Fixed submission:
a,p = map(int,input().split())
print((a*3+p)//2)

Buggy submission (verdict: Runtime Error):
a,p = map(int,input().split()))
print((a*3+p)//2)
Problem p03035 (python)

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

c = 0
if a >= 13:
    print(b)
elif 6 <= a <=12:
    c = int(b /2)
    print(c)
elif a <= 5:
    print("0")

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

if I <= 13:
    print(N)
elif 6 <= I <=12:
    print(N/2)
elif I <= 5:
    print("0")

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

if I <= 13:
    print(N)
elif: 6 <= I <=12:
    print(N/2)
elif: I <= 5
    print("0")
Problem p02717 (python)

Fixed submission:
A = list(map(int, input().split()))
print("{} {} {}".format(A[2], A[0], A[1]))

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

Fixed submission:
R=int(input())
print(2*3.14159*R)

Buggy submission (verdict: Runtime Error):
R=int.input()
print(2*3.14159*R)
Problem p02714 (python)

Fixed submission:
import collections

N=int(input())
S=input()

lenR=S.count("R")
lenG=S.count("G")
lenB=S.count("B")

count=0
for i in range(N-2):
    for j in range(i,N-1):
        k=2*j-i
        if k>=N:
            continue
        else:
            if (S[i] != S[j]) and (S[i]!=S[k]) and (S[j]!=S[k]):
                count+=1
    
print(lenR*lenG*lenB-count)

Buggy submission (verdict: Runtime Error):
import collections

N=int(input())
S=input()

lenR=S.count("R")
lenG=S.count("G")
lenB=S.count("B")

count=0
for i in range(N-2):
    for j in range(i,N-1):
        if 2*j-i>N:
            continue
        if (S[i] != S[j]) and (S[i]!=S[2*j-i]) and (S[j]!=S[2*j-i]):
            count+=1
    
print(lenR*lenG*lenB-count)

Buggy submission (verdict: Runtime Error):
import collections

N=int(input())
S=input()

lenR=S.count("R")
lenG=S.count("G")
lenB=S.count("B")

count=0
for i in range(N-2):
    for j in range(i,N-1):
        if 2*j-i>N:
            continue
        if (S[i] != S[j]) and (S[i]!=S[2*j-i]) and (S[j]!=S[2*j-i]):
                    count+=1
    
print(lenR*lenG*lenB-count)
Problem p02705 (python)

Fixed submission:
#copy
import math

R = int(input())
print(R * 2 * math.pi)

Buggy submission (verdict: Runtime Error):
pi = 3.141592653589793238462643383279

a = input()
ans = a * 2 * pi
print(ans)

Buggy submission (verdict: Runtime Error):
pi = 3.1415926535

a = input()
ans = a * 2 * pi
print(ans)
Problem p02921 (python)

Fixed submission:
#copy

s = input()
t = input()

ans = 0

for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
#copy

s = chr(input())
t = chr(input())

ans = 0

for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)
Problem p02945 (python)

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

Buggy submission (verdict: Runtime Error):
13 3
Problem p02717 (python)

Fixed submission:
nums = input().split()
print(nums[2],nums[0],nums[1],sep = ' ')

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

print(nums[2],nums[0],nums[1])
Problem p02772 (python)

Fixed submission:
n = int(input())

a = input().split()

f = 'True'

for i in a:
  if int(i) % 2 == 0:
    if int(i) % 3 != 0 and int(i) % 5 != 0:
      f = 'False'

if f == 'True':
  print('APPROVED')
else:
  print('DENIED')

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

f = 'True'

for i in range(n):
  a = int(input())
  if a % 2 == 0:
    if a % 3 != 0 and a % 5 != 0:
      f = 'False'

if f == 'True':
  print('APPROVED')
else:
  print('DENIED')
Problem p02783 (python)

Fixed submission:
H,A = map(int,input().split())
count=0
while H>0:
	H -= A
	count +=1
print(count)

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

count = 0

while H > 0:
	H -= A
	count += 1
    
print(count)
Problem p03035 (python)

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

if a >= 13:
  print(b)
elif 6 <= a <= 12:
  print(b // 2)
else:
  print(0)

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

if a > = 13:
  print(b)
elif 6 <= a <= 12:
  print(b // 2)
else:
  print(0)
Problem p03085 (python)

Fixed submission:
dict = {'A':'T','C':'G','T':'A','G':'C'}
b = input()

print(dict[b])

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

print(dict[b])
Problem p03206 (python)

Fixed submission:
d = input()
dict = {'25':'Christmas','24':'Christmas Eve',
        '23':'Christmas Eve Eve',
        '22':'Christmas Eve Eve Eve'}

print(dict[d])

Buggy submission (verdict: Runtime Error):
d = int(input())
dict = {'25':'Christmas','24':'Christmas Eve',
        '23':'Christmas Eve Eve',
        '22':'Christmas Eve Eve Eve'}

print(dict[d])
Problem p03547 (python)

Fixed submission:
dict = {'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
x,y = map(str,input().split())

if dict[x] > dict[y]:
  print('>')
elif dict[x] == dict[y]:
  print('=')
else:
  print('<')

Buggy submission (verdict: Runtime Error):
dict = {'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
x,y = map(int,input().split())

if dict[x] > dict[y]:
  print('>')
elif dict[x] == dict[y]:
  print('=')
else:
  print('<')
Problem p03711 (python)

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

group1 = [1,3,5,7,8,10,12]
group2 = [4,6,9,11]

if x in group1 and y in group1:
  print('Yes')
elif x in group2 and y in group2:
  print('Yes')
elif x == y == 2:
  print('Yes')
else:
  print('No')

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

group1 = list(1,3,5,7,8,10,12)
group2 = list(4,6,9,11)

if x in group1 and y in group1:
  print('Yes')
elif x in group2 and y in group2:
  print('Yes')
elif x == y == 2:
  print('Yes')
else:
  print('No')
Problem p03729 (python)

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

if a[-1] == b[0] and b[-1] == c[0]:
  print('YES')
else:
  print('NO')

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

if a[-1] == b[0] and b[-1] == c[0]:
  print('YES')
else:
  print('NO')
Problem p04043 (python)

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

if a == 5 and b == 5 and c == 7:
  print('YES')
elif a == 5 and b == 7 and c == 5:
  print('YES')
elif a == 7 and b == 5 and c == 5:
  print('YES')
else:
  print('NO')

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

if a == 5 and b == 5 and c == 7:
  print('YES')
elif a == 5 and b == 7 and c == 5:
  print('YES')
elif a == 7 and b == 5 and c == 5:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
nums = map(int,input.split())
if nums[0] = 5 and nums[1] = 5 and nums[2] = 7:
	print('YES')
elif nums[0] = 5 and nums[1] = 7 and nums[2] = 5:
	print('YES')
elif nums[0] = 7 and nums[1] = 5 and nums[2] = 5:
	print('YES')
else:
	print('NO')