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

Fixed submission:
N=int(input())
A=int(input())
tmp = N
while(N >=500):
    tmp = N%500
    N//=500
if(tmp <=A):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
H,W = (int(_) for _ in input().split())                                                                                                                              
grid = [list(str(input())) for i in range(H)] 
dp = [[ -1 for i in range(W)] for j in range(H)]
dp[0][0] = 0 
for i in range(0,H):
    for j in range(0,W):
        if(grid[i][j] =="#" or (i,j) == (0,0)):
            continue
        if(i-1 >=0 and j-1>=0):
            if(dp[i-1][j] >= 0 and dp[i][j-1]>=0):
                dp[i][j]= min(dp[i-1][j]+1,dp[i][j-1] + 1)
            elif(dp[i-1][j] >=0):
                dp[i][j] = dp[i-1][j]+1
            elif(dp[i][j-1] >=0):
                dp[i][j] = dp[i][j-1]+1
        elif(i -1 >= 0 and j -1 < 0): 
            if(dp[i-1][j] >= 0): 
                dp[i][j] = dp[i-1][j]+ 1
        elif(j-1 >= 0 and i-1 < 0): 
            if(dp[i][j-1] >= 0): 
                dp[i][j] = dp[i][j-1] + 1 
cnt=0
dic={}
for i in range(0,H):
    for j in range(0,W):
        if(grid[i][j] == "#" or (i,j) == (0,0)):
            continue
        if(dp[i][j] == -1):
            cnt+=1
        elif(dp[i][j] not in dic):
            dic[dp[i][j]] = 1 
        else:
            cnt+=1
if(dp[H-1][W-1] not in dic or dic[dp[H-1][W-1]] !=1):
    print(-1)
else:
    print(cnt)

Buggy submission (verdict: Runtime Error):
H,W = (int(_) for _ in input().split()) 
grid = [list(str(input())) for i in range(H)] 
dp = [[ -1 for i in range(W)] for j in range(H)]
dp[0][0] = 0
for i in range(0,H):
    for j in range(0,W):
        if(grid[i][j] =="#" or (i,j) == (0,0)):
            continue
        if(i-1 >=0 and j-1>=0):
            if(dp[i-1][j] >= 0 and dp[i][j-1]>=0):
                dp[i][j]= min(dp[i-1][j]+1,dp[i][j-1] + 1)
            elif(dp[i-1][j] >=0):
                dp[i][j] = dp[i-1][j]+1
            elif(dp[i][j-1] >=0):
                dp[i][j] = dp[i][j-1]+1
        elif(i -1 >= 0 and j -1 < 0):
            if(dp[i-1][j] >= 0):
                dp[i][j] = dp[i-1][j]+ 1
        elif(j-1 >= 0 and i-1 < 0):
            if(dp[i][j-1] >= 0):
                dp[i][j] = dp[i][j-1] + 1
cnt=0
dic={}
for i in range(0,H):
    for j in range(0,W):
        if(grid[i][j] == "#" or (i,j) == (0,0) or (i,j) == (H-1,W-1)):
            continue
        if(dp[i][j] == -1):
            cnt+=1
            grid[i][j] ="+"
        elif(dp[i][j] not in dic):
            dic[dp[i][j]] = 1
        else:
            grid[i][j] ="+"
            cnt+=1
if(dp[H-1][W-1] < 0):
    print(-1)
else:
    print(cnt)

Buggy submission (verdict: Runtime Error):
N,A = (int(i) for i in input().split()) 
i = 0
while(N >=500):
    N//=500
if(N <=A):
    print("Yes")
else:
    print("No")
Problem p02780 (python)

Fixed submission:
N,K = map(int,input().split())
p = list(map(int,input().split()))
E = sum(p[0:K])
a = E
for i in range (0,N-K):
  E = E - p[i] + p[i+K]
  if E == max(a,E):
    a = E
    
print((a+K)/2)

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

N,K = map(int,input().split())
p = list(map(int,input().split()))
E = sum(p[0:K])
a = E
for i in range (0,N-K):
  E = E - p[i] + p[i+K]
  if E == max(a,E):
    a = E
    
print((a+K)/2)
Problem p02882 (python)

Fixed submission:
import numpy as np
a,b,x = map(int,input().split())
V = a * a * b
dV = V - x
if x == V:
  print("0")
  
elif x >= V / 2:
  h = dV / V * b * 2
  theta = np.arctan(a / h) * 360 / (2 * np.pi)
  print(90-theta)
  
else:
  h = x / V * a * 2
  theta = np.arctan(h / b) * 360 / (2 * np.pi)
  print(90-theta)

Buggy submission (verdict: Runtime Error):
import numpy as np
a,b,x = map(int,input().split())
V = a * a * b
dV = V - x
#y = max(V,dV)
#h = dV / V * b * 2
#theta = np.arctan(a / h) * 360 / (2 * np.pi)

if x >= V / 2:
  h = dV / V * b * 2
  theta = np.arctan(a / h) * 360 / (2 * np.pi)
  print(90-theta)
else:
  h = x / V * a * 2
  theta = np.arctan(h / b) * 360 / (2 * np.pi)
  print(90-theta)
Problem p02910 (python)

Fixed submission:
s=input()
N=len(s)
a="Yes"

for i in range (0,N):
  if i%2==0:
    if (s[i]!="R") and (s[i]!="U") and (s[i]!="D"):
      a="No"
      break
  else:
    if (s[i]!="L") and (s[i]!="U") and (s[i]!="D"):
      a="No"
      break
print(a)

Buggy submission (verdict: Runtime Error):
s=input()
N=len(s)
a="Yes"

for i in range (0,N):
  if i%2=0:
    if (s[i]!="R") and (s[i]!="U") and (s[i]!="D"):
      a="No"
      break
  else:
    if (s[i]!="L") and (s[i]!="U") and (s[i]!="D"):
      a="No"
      break
print(a)
Problem p02917 (python)

Fixed submission:
import numpy as np
N=int(input())
B=list(map(int,input().split()))
A=np.zeros(N,dtype="int64")

A[0]=B[0]
A[N-1]=B[N-2]

for i in range (1,N-1):
  A[i]=min(B[i-1],B[i])
print(sum(A))

Buggy submission (verdict: Runtime Error):
import numpy as np
N=int(input())
B=list(map(int,input.split()))
A=np.zeros(N,dtype="int64")

A[0]=B[0]
A[N-1]=B[N-2]

for i in range (1,N-1):
  A[i]=min(B[i-1],B[i])
print(sum(A))

Buggy submission (verdict: Runtime Error):
N=int(input())
B=list(map(int,input.split()))
A=[0]*N

A[0]=B[0]
A[N-1]=B[N-2]

for i in range (1,N-1):
  A[i]=min(B[i-1],B[i])
print(sum(A))
Problem p02924 (python)

Fixed submission:
n = int(input())
ans = n * (n - 1) // 2
print(int(ans))

Buggy submission (verdict: Runtime Error):
import numpy as np
a = np.zeros(2,dtype = "int64")

a[0] = int(input())

def func(i):

  if(i == 1): 
    return 1
  return i + func(i - 1)

print(func(a[0]-1))
Problem p02953 (python)

Fixed submission:
import sys
N = int(input())
H = list(map(int,input().split()))
for i in reversed (range(N-1)):
  if H[i] > H[i+1]:
    H[i] = H[i] - 1
    if H[i] > H[i+1]:
      print("No")
      sys.exit()
print("Yes")

Buggy submission (verdict: Runtime Error):
import sys
N=int(input())
H1=list(map(int,input().split()))
H=np.zeros(N,dtype="int64")
for i in range (0,N):
  H[i]=H1[i]
s=0
if N==1:
  print("Yes")
  sys.exit()
  
for i in range (0,N-1):
  if H[i]>H[i+1]:
    s = s + H[i]-H[i+1]
  if s>=2:
    print("No")
    sys.exit()

print("Yes")
Problem p02983 (python)

Fixed submission:
L, R = map(int,input().split())
b = 2018
if R - L >= 2019:
  print(0)
else:
  L = L % 2019
  R = R % 2019
  for i in range(L, R):
    for j in range(i + 1, R + 1):
      if b > (i * j) % 2019:
        b = (i * j) % 2019
  print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
import sys
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = 2018
if R - L >= 2018:
  print("0")
  sys.exit()
else:
  for i in range (L,R):
    for j in range (i+1,R+1):
      x = (i * j) % 2019
      b = min(b,x)
  print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
import sys
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = 2018
if R - L >= 2018:
  print("0")
  sys.exit()
else:
  for i in range (L,R+1):
    for j in range (L+1,R+1):
      x = (i * j) % 2019
      b = min(b,x)
  print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
import sys
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = 2019
if R - L >= 2018:
  print("0")
  sys.exit()
else:
  for i in range (L,R+1):
    for j in range (L+1,R+1):
      x = (i * j) % 2019
      b = min(b,x)
  print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
import sys
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = 2019
if R - L >= 2018:
  print("0")
  sys.exit()
else:
  for i in range (0,R-L+1):
    d = (L + i) % 2019
    a[i] = d
for i in range (0,R-L+1):
  for j in range (i+1,R-L+1):
    x = (a[i] * a[j]) % 2019
    b = min(b,x)
print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
import sys
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = 2019
if R - L >= 2018:
  print("0")
  sys.exit()
else:
  for i in range (0,R-L+1):
    d = (L + i) % 2019
    a[i] = d
  for i in range (0,R-L+1):
    for j in range (i+1,R-L+1):
      x = (a[i] * a[j]) % 2019
      b = min(b,x)
print(b)

Buggy submission (verdict: Runtime Error):
import numpy as np
L,R = map(int,input().split())
a = np.zeros(R-L+1,dtype="int64")
b = []
if R - L >= 2018:
  print("0")
else:
  for i in range (0,R-L+1):
    d = (L + i) % 2019
    a[i] = d
  for i in range (0,R-L+1):
    for j in range (i+1,R-L+1):
      x = (a[i] * a[j]) % 2019
      b.append(x)
print(min(b))

Buggy submission (verdict: Runtime Error):
L,R = map(int,input().split())
a = []
b = []
if R - L >= 2018:
  print("0")
else:
  for i in range (0,R-L+1):
    d = (L + i) % 2019
    a.append(d)
  for i in range (0,R-L+1):
    for j in range (i+1,R-L+1):
      x = (a[i] * a[j]) % 2019
      b.append(x)
print(min(b))
Problem p02767 (python)

Fixed submission:
n=int(input())
Xs=list(map(int,input().split()))
Xs.sort()
a=Xs[0]
b=Xs[-1]
ans=float("inf")
for p in range(a,b+1):
    m=0
    for x in Xs:
        m+=(x-p)**2
    if m<ans:
        ans=m
print(ans)

Buggy submission (verdict: Runtime Error):
import math
n=input()
Xs=list(map(int,input().split()))
Xs.sort()
a=Xs[0]
b=Xs[-1]
ans=math.inf
for p in range(a,b+1):
    m=0
    for x in Xs:
        m+=(x-p)**2
    if m<ans:
        ans=m
print(ans)

Buggy submission (verdict: Runtime Error):
import math
n=input()
Xs=list(map(int,input().split()))
Xs.sort()
a=Xs[0]
b=Xs[-1]
ans=math.inf
for p in range(a,b+1):
    m=0
    for x in Xs:
        m+=(x-p)**2
    if m<ans:
        ans=m
print(ans)

Buggy submission (verdict: Runtime Error):
n=input()
Xs=list(map(int,input().split()))
Xs.sort()
a=Xs[0]
b=Xs[-1]
ans=inf
for p in range(a,b+1):
    m=0
    for x in Xs:
        m+=(x-p)**2
    if m<ans:
        ans=m
print(ans)
Problem p02778 (python)

Fixed submission:
s = input().rstrip()
print('x' * len(s))

Buggy submission (verdict: Runtime Error):
s=len(input())
2 print('x' * len(s))
Problem p02780 (python)

Fixed submission:
N, K = map(int,input().split())
t=list(input().split())
s=[int(n) for n in t]
max=x=sum(s[:K])
for i in range(N-K):
    x+=(s[K+i]-s[i])
    if max<x :
        max=x
print((max+K)/2)

Buggy submission (verdict: Runtime Error):
N, K = map(int,input().split())
max=0
t=list(input().split())
for i in range(N-K+1):
    x=0
    for j in range(K):
        x+=int(s[i+j])
    if max<x :
        max=x
print((max+K)/2)

Buggy submission (verdict: Runtime Error):
max=0
N=int(input())
K=int(input())
t=list(input().split())
s=[int(n) for n in t]
for i in range(N-K+1):
    x=0
    for j in range(K):
        x+=s[i+j]
    if max<x :
        max=x
print((max+K)/2)

Buggy submission (verdict: Runtime Error):
max=0
N=int(input())
K=int(input())
t=list(input().split())
s=[int(n) for n in t]
for i in range(N-K):
    x=0
    for j in range(K):
        x+=s[i+j]
    if max<x :
        max=x
print((max+K)/2)

Buggy submission (verdict: Runtime Error):
max=0
N=int(input())
K=int(input())
t=list(input().split())
s=[int(n) for n in t]
for i in range(N-K):
    x=0
    for j in range(K):
        x+=s[i+j]
    if max<x :
        max=x
print((max+4)/2)
Problem p03360 (python)

Fixed submission:
li=sorted(list(map(int,input().split())))
a=li.pop(-1)
k=int(input())
a=a*(2**k)
for i in li:
  a+=i
print(a)

Buggy submission (verdict: Runtime Error):
li=list(map(int,input().split())).sort()
a=li.pop(-1)
k=int(input())
a=a*(2**k)
for i in li:
  a+=i
print(a)
Problem p02783 (python)

Fixed submission:
H, A = map(int, input().split())
from math import ceil
n = int(ceil(H/A))
print(n)

Buggy submission (verdict: Runtime Error):
h, k = map(int, input().split())
lis = list(map(int, input().split()))
if h >= k:
    lis.sort(reverse=True)
    lis = lis[k:]
else:
    lis = []
    
print(sum(lis))
Problem p02812 (python)

Fixed submission:
n = int(input())
s = str(input())
count = 0
for i in range(n):
    if s[i] == 'a' or s[i] == 'A':
        if i + 1 < n:
            if s[i + 1] == 'b' or s[i + 1] == 'B':
                if i + 2 < n:
                    if s[i + 2] == 'c' or s[i + 2] ==  'C':
                        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = str(input())
count = 0
for i in range(n):
    if s[i] == 'a' or s[i] == 'A':
        if i + 1 <= n:
            if s[i + 1] == 'b' or s[i + 1] == 'B':
                if i + 2 <= n:
                    if s[i + 2] == 'c' or s[i + 2] ==  'C':
                        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = str(input())
count = 0
for i in range(n):
    if s[i] == 'a' or s[i] == 'A':
        if s[i + 1] == 'b' or s[i + 1] == 'B':
            if s[i + 2] == 'c' or s[i + 2] ==  'C':
                count += 1
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = str(input())
count = 0
for i in range(n):
    if s[i] == 'a' or 'A':
        if s[i + 1] == 'b' or 'B':
            if s[i + 2] == 'c' or 'C':
                count += 1
print(count)
Problem p02909 (python)

Fixed submission:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Buggy submission (verdict: Runtime Error):
import math
import heapq
 
n, m = map(int, input().split())
A = list(map(int, input().split()))
A = list(map(lambda x:x*(-1), A))
for i in range(m):
    heapq.heapify(A)
    min = (-1)*((-1)*(heapq.heappop(A))//2)
    heapq.heappush(A, min)
 
 
print(int(sum(A))*(-1))

Buggy submission (verdict: Runtime Error):
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy"):
else:
    print("Sunny")
Problem p02917 (python)

Fixed submission:
N = int(input())
B = list(map(int, input().split()))
A = []
A.append(B[N-2])
for i in reversed(range(1, len(B))):
    if B[i]>=B[i-1]:
        A.append(B[i-1])
    else:
        A.append(B[i])

A.append(B[0])

print(sum(A))

Buggy submission (verdict: Runtime Error):
N = int(input())
B = list(map(int, input().split()))
A = []
A.append(B[N-2])
for i in reversed(range(1, len(B))):
    if B[i]>=B[i-1]:
        A.append(B[i-1])
    else:
        A.append(B[i])

A.append(B[0])
print(A)
print(sum(A))
Problem p02924 (python)

Fixed submission:
N = int(input())

a = list(range(1, N+1))

if N ==1:
    sc = 0
else:
    sc = int((N**2-N)/2)
print(sc)

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

a = list(range(1, N+1))

if N ==1:
    sc = 0
else:
    sc = int((N**2-N)/2)
print(sc)

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

a = list(range(1, N+1))

if N ==1:
    sc = 1
else:
    sc = int((N**2-N)/2)
print(sc)

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

a = list(range(1, N+1))
sc = 0
print((a[-2]+a[0])*(N-1)//2)

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

a = list(range(1, N+1))
sc = 0
print(sum(a)-a[-1])
Problem p02947 (python)

Fixed submission:
N = int(input())
s = [input() for i in [0]*N]
words = {}
cnt = 0
for i in s:
    i = "".join(sorted(i))
    time = words.get(i,0)
    cnt += time
    words[i] = time + 1
print(cnt)

Buggy submission (verdict: Runtime Error):

N = int(input())
s = [input() for _ in range(N)]

word = {}
cnt = 0
for i in s:
    i = sorted(i)
    time = word.get(i, 0)
    cnt += time
    word[i] = time + 1
print(cnt)

Buggy submission (verdict: Runtime Error):
cnt = 0
l_sort = []
for i in range(n):
    if sorted(l[i]) in l_sort:
        cnt += 1
    l_sort.append(sorted(l[i]))

print(cnt)
Problem p02812 (python)

Fixed submission:
N = int(input())
S = str(input())

count = 0
for i in range(N-2):
    if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":
       count+=1
print(count)

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

dfs = df[S]

dfs.str.contains("ABC")
Problem p02909 (python)

Fixed submission:
S = input()
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
if ind == 2 : 
   ind = -1
print( listw[ind+1] )

Buggy submission (verdict: Runtime Error):
S = input()
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
listw = listw.append( "Sunny" )
print( listw[ind+1] )

Buggy submission (verdict: Runtime Error):
S = input()
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
print( listw.append( "Sunny" )[ind+1] )

Buggy submission (verdict: Runtime Error):
S = str( input() )
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
print( listw.append( "Sunny" )[ind+1] )
Problem p02993 (python)

Fixed submission:
S = list( input() )
for i in range( len(S) - 1 ) : 
    if S[i] == S[i+1] : 
       print( "Bad" )
       break
else : 
    print( "Good" )

Buggy submission (verdict: Runtime Error):
S = list( input() )
dif = [ int( S[1]-S[0] ), int( S[2]-S[1] ), int( S[3]-S[2] ) ]
if 0 in dif: 
   print( "Good" )
else : 
   print( "Bad" )

Buggy submission (verdict: Runtime Error):
S = list( input() )
new = [ S[1]-S[0], S[2]-S[1], S[3]-S[2] ]
if 0 in new : 
   print( "Good" )
else : 
   print( "Bad" )
Problem p02999 (python)

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

Buggy submission (verdict: Runtime Error):
X, A = map( int, input().split() )
if X < A :
   print( 0 )
else
    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 = int( x ) for x in input().split()
print( ( A * 3 + P ) // 2 )

Buggy submission (verdict: Runtime Error):
A, P = int( x ) for x in input()
print( ( A * 3 + P ) // 2 )
Problem p03109 (python)

Fixed submission:
y, m, d = map( int, input().split("/") )
if y < 2019 or ( y == 2019 and m <= 4 ) :
   print( "Heisei" )
else : 
   print( "TBD" )

Buggy submission (verdict: Runtime Error):
y, m, d = map( int, input().split("/") )
if m <= 4
   print( "Heisei" )
else : 
   print( "TBD" )

Buggy submission (verdict: Runtime Error):
y, m, d = map( int, input().split("/") )
if y < 2019 or ( y == 2019 and m <= 4 )
   print( "Heisei" )
else : 
   print( "TBD" )
Problem p03145 (python)

Fixed submission:
AB, BC, CA = map( int, input().split() )
print( ( AB * BC ) // 2 )

Buggy submission (verdict: Runtime Error):
AB, BC = map( int, input().split() )
print( ( AB * BC ) // 2 )

Buggy submission (verdict: Runtime Error):
AB, BC = map( int, input().split() )
print( AB * BC // 2 )
Problem p03238 (python)

Fixed submission:
N = int( input() )
if N == 1 : 
   print( "Hello World" )
else : 
   A = int( input() )
   B = int( input() )
   print( A + B )

Buggy submission (verdict: Runtime Error):
N = int( input() )
if N == 1 : 
   print( "Hello World" )
else : 
{
   A = int( input() )
   B = int( input() )
   print( A + B )
}
Problem p03437 (python)

Fixed submission:
X, Y = map( int, input().split() )
if X % Y == 0:
   print( -1 )
else :
   print( X )

Buggy submission (verdict: Runtime Error):
X, Y = map( int, input().split() )
if Y % X == 0 or X % Y == 0
   print( -1 )
else 
   print( X )
Problem p03605 (python)

Fixed submission:
N = str( input() )
if N[0] == "9" or N[1] == "9" :
   print( "Yes" )
else : 
   print( "No" )

Buggy submission (verdict: Runtime Error):
N = str( input() )
if str[0] == "9" or str[1] == "9" :
   print( "Yes" )
else : 
   print( "No" )
Problem p03695 (python)

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

rate = []
anycol = 0
for i in As : 
  if i >= 3200 : 
    anycol += 1 
  else : 
     rate.append( i // 400 )
 
count = len( set(rate) )
 
print( max(count, 1), count+anycol )

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

rate = []
anycol = 0
for i in A : 
  if i >= 3200 : 
    anycol += 1 
  else : 
     rate.append( i // 400 )

count = let( set(rate) )

print( max(count, 1), min(count+anycol, 8) )
Problem p03711 (python)

Fixed submission:
l1 = [1,3,5,7,8,10,12]
l2 = [4,6,9,11]
l3 = [2]
x, y = map( int, input().split() )
if ( x in l1 and y in l1 ) or ( x in l2 and y in l2 ) or ( x in l3 and y in l3 ) : 
   print( "Yes" )
else :
   print( "No" )

Buggy submission (verdict: Runtime Error):
list1 = [1,3,5,7,8,10,12]
list2 = [4,6,9,11]
list3 = [2]
x, y = map( int, input().split() )
if ( x in list1 and y in list1 ) \
　　or ( x in list2 and y in list2 ) \ 
　　or ( x in list3 and y in list3 ) : 
   print( "Yes" )
else :
   print( "No" )

Buggy submission (verdict: Runtime Error):
list1 = [1,3,5,7,8,10,12]
list2 = [4,6,9,11]
list3 = [2]
x, y = map( int, input().split() )
if ( x in list1 and y in list1 ) or ( x in list2 and y in list2 ) 
   or ( x in list3 and y in list3 ) : 
   print( "Yes" )
else :
   print( "No" )
Problem p03737 (python)

Fixed submission:
s1, s2, s3 = map( str, input().split() )
print( s1[0].upper() + s2[0].upper() + s3[0].upper() )

Buggy submission (verdict: Runtime Error):
s1, s2, s3 = map( str, input().split() )
print( s1[0].upper + s2[0].upper + s3[0].upper )
Problem p03777 (python)

Fixed submission:
s = input()
if s == "H H" or s == "D D" : 
   print( "H" ) 
else : 
   print( "D" )

Buggy submission (verdict: Runtime Error):
s = str( input() )
if s == "H H" | s == "D D" : 
   print( "H" ) 
else : 
   print( "D" )

Buggy submission (verdict: Runtime Error):
s = input()
if s == "H H" | s == "D D" : 
   print( "H" ) 
else : 
   print( "D" )

Buggy submission (verdict: Runtime Error):
a, b = map( str, input().split() )
s = a + b
if s == "HH" | s == "DD" : 
   print( "H" ) 
else : 
   print( "D" )
Problem p03813 (python)

Fixed submission:
rate = int( input() )
if rate < 1200 :
  print( "ABC" )
else :
  print( "ARC" )

Buggy submission (verdict: Runtime Error):
rate = input()
if rate < 1200 :
  print( "ABC" )
else :
  print( "ARC" )
Problem p03860 (python)

Fixed submission:
s1, s2, s3 = map( str, input().split() )
print( "A" + s2[0] + "C" )

Buggy submission (verdict: Runtime Error):
s1, s2, s3 =　map( str, input().split() )
print( "A" + list(s2)[0] + "C")

Buggy submission (verdict: Runtime Error):
s1, s2, s3 = map(string, input().split() )

s2p = list( s2 )[0]

print( s1 + s2p + s3 )
Problem p03919 (python)

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Buggy submission (verdict: Runtime Error):
H, W = map( int, input().split() )
s = [ [ map( str, input().split() ) ] for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( i + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Buggy submission (verdict: Runtime Error):
H, W = map( int, input().split() )
s = [ [ map( str, input().split() ) ] for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if "snuke" in s[i][j] : 
           w = chr( i + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Buggy submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    if "snuke" in s : 
        w = abc[ s.index[ "snuke" ] ]
        h = i + 1
        break
print( w + str( h ) )

Buggy submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    for j in range(W) :
        if "snuke" in s : 
           w = abc[ s.index[ "snuke" ] ]
           h = i + 1
           exit()
print( w + str( h ) )

Buggy submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    for j in range(W) :
        if "snuke" in s : 
           w = abc[ s.index[ "snuke" ] ]
           h = i + 1
           break
print( w + str( h ) )