Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if a == 1:
    if b == 2:
        print("3")
    else:
        print("2")
if a == 2:
    if b == 1:
        print("3")
    else:
        print("1")
if a == 3:
    if b == 2:
        print("1")
    else:
        print("2")

Fixed submission:
a = int(input())
b = int(input())
if a == 1:
    if b == 2:
        print("3")
    else:
        print("2")
if a == 2:
    if b == 1:
        print("3")
    else:
        print("1")
if a == 3:
    if b == 2:
        print("1")
    else:
        print("2")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
from fraction import gcd
print(a*b // gcd(a, b))

Fixed submission:
a, b = map(int, input().split())
from fractions import gcd
print(a*b // gcd(a, b))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
from math import gcd
print(a*b // gcd(a, b))

Fixed submission:
a, b = map(int, input().split())
from fractions import gcd
print(a*b // gcd(a, b))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
from math import gcd
print(a*b // gcd(a, b))

Fixed submission:
a, b = map(int, input().split())
from fractions import gcd
print(a*b // gcd(a, b))
Buggy python submission (verdict: Runtime Error):
N = input()
ans = int((N+1) / 2)
print(ans)

Fixed submission:
N = int(input())
ans = int((N+1) / 2)
print(ans)
Buggy python 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))

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

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

Fixed submission:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")
Buggy python 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(int(sum(A)))


Fixed submission:
N = int(input())

print(N**3)

Buggy python 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(sum(A))


Fixed submission:
N = int(input())

print(N**3)

Buggy python 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(sum(A))


Fixed submission:
N = int(input())

print(N**3)
Buggy python 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))


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 python 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)


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 python 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)


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 python submission (verdict: Runtime Error):
N = int(input())

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


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 python submission (verdict: Runtime Error):
N = int(input())

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


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 python 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)


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 python submission (verdict: Time Limit Exceeded):
#計算間に合わなかった泣

n = int(input())
l = list(str(input()) for _ in range(n))
d = [{} for _ in range(n)]

for m, a in enumerate(l):
    for p in range(10):
        d[m][a[p]] = a.count(a[p])
cnt = 0
dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]

for i in d:
    pp=[i==k for k in d]
    kk = [x for x, _ in enumerate(pp) if _]
    d = dellist(d, kk)
    cnt += (len(kk)-1)*len(kk)/2

print(int(cnt))


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 python 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)

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 python submission (verdict: Time Limit Exceeded):
import collections
n = int(input())
l = list(str(input()) for _ in range(n))
d = [{} for _ in range(n)]

for m, a in enumerate(l):
    for p in range(10):
        d[m][a[p]] = a.count(a[p])
cnt = 0
dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
A=["a","b","c","d","e","f","g","h"]
r=[0,4,5]

for i in d:
    pp=[i==k for k in d]
    kk = [x for x, _ in enumerate(pp) if _]
    d = dellist(d, kk)
    cnt += (len(kk)-1)*len(kk)/2
# for i, j in enumerate(d):
#     for k in range(i+1, len(d)):
#         if j == d[k]:
#             cnt += 1

print(int(cnt))


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 python submission (verdict: Time Limit Exceeded):
import collections
n = int(input())
l = list(str(input()) for _ in range(n))
d = [{} for _ in range(n)]

for m, a in enumerate(l):
    for p in range(10):
        d[m][a[p]] = a.count(a[p])
cnt = 0
for i, j in enumerate(d):
    for k in range(i+1, len(d)):
        if j == d[k]:
            cnt += 1

print(cnt)

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 python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))

c = 0
for i in range(n-1):
    if h[i] <= h[i+1]-1:
        h[i+1] = h[i+1]-1
    elif h[i] == h[i+1]:
        continue
    else:
        c = 1
if c == 1:
    print('No')
else:
    print('Yes')

Fixed submission:
a, b, c = map(int, input().split())
d = a-b
if d >= c:
    re = 0
else:
    re = c-d

print(re)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
h = list(map(int, input().split()))
a = 0
for i in range(n-1):
    for j in h[i+1:]:
        if h[i]-j >= 2:
            print('No')
            exit()

print('Yes')


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

c = 0
for i in range(n-1):
    if h[i] <= h[i+1]-1:
        h[i+1] = h[i+1]-1
    elif h[i] == h[i+1]:
        continue
    else:
        c = 1
if c == 1:
    print('No')
else:
    print('Yes')

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
h = list(map(int, input().split()))
a = 0
for i in range(n-1):
    for j in h[i+1:]:
        if h[i]-j >= 2:
            print('No')
            exit()

print('Yes')


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

c = 0
for i in range(n-1):
    if h[i] <= h[i+1]-1:
        h[i+1] = h[i+1]-1
    elif h[i] == h[i+1]:
        continue
    else:
        c = 1
if c == 1:
    print('No')
else:
    print('Yes')

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
h = list(map(int, input().split()))
a = 0
for i in range(n-1):
    for j in h[i+1:]:
        if h[i]-j >= 2:
            a += 1
if a == 0:
    print('Yes')
else:
    print('No')


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

c = 0
for i in range(n-1):
    if h[i] <= h[i+1]-1:
        h[i+1] = h[i+1]-1
    elif h[i] == h[i+1]:
        continue
    else:
        c = 1
if c == 1:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
H, N = map(int, input().split())
#Cost=[]
#for i in range(N):
#  A, B = map(int, input().split())
#  Cost.append([A, B])
Cost=[[int(x) for x in input().split()] for _ in range(N)]
#  Cost.append((A, B, A/B))
#Cost = sorted(Cost, key=lambda row: row[0], reverse=True)
#sortedCost = sorted(Cost, key=lambda row: row[2], reverse=True)
#print(Cost)

DP=[float('inf')]*(H+2)
DP[0]=0
DP[1]=0
for i in range(2,H+2):
    for j in range(N):
      if i-Cost[j][0]>=0:
          DP[i]=min(DP[i], DP[i-Cost[j][0]]+Cost[j][1])
      else:
          DP[i]=min(DP[i], Cost[j][1])

print(DP[H+1])

Fixed submission:
H, N = map(int, input().split())
#Cost=[]
#for i in range(N):
#  A, B = map(int, input().split())
#  Cost.append([A, B])
Cost=[[int(x) for x in input().split()] for _ in range(N)]
#  Cost.append((A, B, A/B))
#Cost = sorted(Cost, key=lambda row: row[0], reverse=True)
#sortedCost = sorted(Cost, key=lambda row: row[2], reverse=True)
#print(Cost)

DP=[float('inf')]*(H+2)
DP[0]=0
DP[1]=0
for i in range(2,H+2):
    for j in range(N):
      if i-Cost[j][0]>=0:
          DP[i]=min(DP[i], DP[i-Cost[j][0]]+Cost[j][1])
      else:
          DP[i]=min(DP[i], Cost[j][1])

print(DP[H+1])

Buggy python submission (verdict: Time Limit Exceeded):
H, N = map(int, input().split())
Cost=[]
for i in range(N):
  A, B = map(int, input().split())
  Cost.append((A, B))
#  Cost.append((A, B, A/B))
#Cost = sorted(Cost, key=lambda row: row[0], reverse=True)
#sortedCost = sorted(Cost, key=lambda row: row[2], reverse=True)

DP=[float('inf')]*(H+2)
DP[0]=0
DP[1]=0
for i in range(2,H+2):
    for j in range(N):
      if i-Cost[j][0]>=0:
          DP[i]=min(DP[i], DP[i-Cost[j][0]]+Cost[j][1])
      else:
          DP[i]=min(DP[i], Cost[j][1])

print(DP[H+1])

Fixed submission:
H, N = map(int, input().split())
#Cost=[]
#for i in range(N):
#  A, B = map(int, input().split())
#  Cost.append([A, B])
Cost=[[int(x) for x in input().split()] for _ in range(N)]
#  Cost.append((A, B, A/B))
#Cost = sorted(Cost, key=lambda row: row[0], reverse=True)
#sortedCost = sorted(Cost, key=lambda row: row[2], reverse=True)
#print(Cost)

DP=[float('inf')]*(H+2)
DP[0]=0
DP[1]=0
for i in range(2,H+2):
    for j in range(N):
      if i-Cost[j][0]>=0:
          DP[i]=min(DP[i], DP[i-Cost[j][0]]+Cost[j][1])
      else:
          DP[i]=min(DP[i], Cost[j][1])

print(DP[H+1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = str(input())

dfs = df[S]

dfs.str.contains("ABC")

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 python submission (verdict: Time Limit Exceeded):
N = int( input() )
A = list( map( int, input().split() ) )
#dp = [ 10**4 for x in range(N) ]
#dp[i] i+1まで数える最短のmonotonically increasing列の位置
 
for i in range(N+1) :
    if i+1 in A : 
#       dp[i]=A.index(i+1)
       A = A[A.index(i+1)+1:]
    else :
       if i == 0: 
          print( -1 )
       else:    
          print(N-i)
       exit()

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

seekfor = 1
crack = 0

for i in range(N) :
    if A[i] == seekfor :
       seekfor += 1
    else : 
       crack += 1
    
if crack == N: 
    print( -1 )
else:    
    print(crack)

Buggy python submission (verdict: Time Limit Exceeded):
N = int( input() )
A = list( map( int, input().split() ) )
#dp = [ 10**4 for x in range(N) ]
#dp[i] i+1まで数える最短のmonotonically increasing列の位置

for i in range(N+1) :
    if i+1 in A : 
#       dp[i]=A.index(i+1)
       A = A[A.index(i+1)+1:]
    else :
       break
if i == 0:
   print( -1 )
else: 
   print( N - i )

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

seekfor = 1
crack = 0

for i in range(N) :
    if A[i] == seekfor :
       seekfor += 1
    else : 
       crack += 1
    
if crack == N: 
    print( -1 )
else:    
    print(crack)

Buggy python submission (verdict: Time Limit Exceeded):
N = int( input() )
A = list( map( int, input().split() ) )
dp = [ 10**4 for x in range(N) ]
#dp[i] i+1まで数える最短のmonotonically increasing列の位置

for i in range(N+1) :
    if i+1 in A : 
       dp[i]=A.index(i+1)
       A = A[A.index(i+1)+1:]
    else :
       break
if i == 0:
   print( -1 )
else: 
   print( N - i )

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

seekfor = 1
crack = 0

for i in range(N) :
    if A[i] == seekfor :
       seekfor += 1
    else : 
       crack += 1
    
if crack == N: 
    print( -1 )
else:    
    print(crack)

Buggy python submission (verdict: Runtime Error):
N = int( input() )
A = list( map( int, input().split() ) )
dp = [ 10**4 for x in range(N) ]
#dp[i] i+1まで数える最短のmonotonically increasing列の位置

for i in range(N+1) :
    if i+1 in A : 
       dp[i]=A.index(i+1)
       A = A[A.index(i+1)+1:]
       print(A, i)
    else :
       break
if i == 0:
   print( -1 )
else: 
   print( N - i )

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

seekfor = 1
crack = 0

for i in range(N) :
    if A[i] == seekfor :
       seekfor += 1
    else : 
       crack += 1
    
if crack == N: 
    print( -1 )
else:    
    print(crack)
Buggy python submission (verdict: Runtime Error):
N = int( input() )

if N % 2 == 1 :
   print(0) 
   exit() 

import math    
ct = 0

M = N // 2
for i in range( math.ceil( math.log(M, 5) ) ) :
   if M >= 5**(i+1) :
      ct += M // ( 5**(i+1) )

print(ct)

Fixed submission:
N = int( input() )

if N % 2 == 1 or N == 0:
   print(0) 
   exit() 

import math    
ct = 0

M = N // 2
for i in range( math.ceil( math.log(M, 5) ) ) :
   if M >= 5**(i+1) :
      ct += M // ( 5**(i+1) )

print(ct)

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

ct = 0
if N % 2 == 1 :
   print(0) 
else :
   for i in range( math.ceil( math.log10(N) ) ) :
       if N >= 10**(i+1) :
#          print( N // ( 10**(i+1) ) ) 
          ct += N // ( 10**(i+1) )

print(ct)

Fixed submission:
N = int( input() )

if N % 2 == 1 or N == 0:
   print(0) 
   exit() 

import math    
ct = 0

M = N // 2
for i in range( math.ceil( math.log(M, 5) ) ) :
   if M >= 5**(i+1) :
      ct += M // ( 5**(i+1) )

print(ct)
Buggy python submission (verdict: Runtime Error):
A, B = map( int, inpuot().split() )
if A < 10 and B < 10 :
   print( A * B )
else : 
   print( -1 )  

Fixed submission:
A, B = map( int, input().split() )
if A < 10 and B < 10 :
   print( A * B )
else : 
   print( -1 )
Buggy python submission (verdict: Runtime Error):
S = input()
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
listw = listw.append( "Sunny" )
print( listw[ind+1] ) 


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

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

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

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

Fixed submission:
S = input()
listw = [ "Sunny", "Cloudy", "Rainy" ]
ind = listw.index( S )
if ind == 2 : 
   ind = -1
print( listw[ind+1] )
Buggy python submission (verdict: Runtime Error):
s = str( input() )
check = [ x == set(s)[0] for x in list(s) ]
if len( set(s) ) == 2 and sum( check ) == 2 :
   print( "Yes" )
else : 
   print( "No" )


Fixed submission:
s = list( str( input() ) )
check = [ x == s[0] for x in s ]
if len( set(s) ) == 2 and sum( check ) == 2 :
   print( "Yes" )
else : 
   print( "No" )
Buggy python 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" )

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 python 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" )

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 python submission (verdict: Runtime Error):
X, A = map( int, input().split() )
if X < A :
   print( 0 )
else
    print( 10 )

Fixed submission:
X, A = map( int, input().split() )
if X < A :
   print( 0 )
else :
    print( 10 )
Buggy python submission (verdict: Runtime Error):
A, P = int( x ) for x in input().split()
print( ( A * 3 + P ) // 2 )

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

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


Fixed submission:
A, P = map( int, input().split() )
print( ( A * 3 + P ) // 2 )
Buggy python submission (verdict: Runtime Error):
K = map( int, input().split() )
S = list( input() )
S[ K - 1 ] = S[ K - 1 ].lower
print( "".join(S) )

Fixed submission:
N, K = map( int, input().split() )
S = list( input() )
S[ K - 1 ] = S[ K - 1 ].lower()
print( "".join(S) )

Buggy python submission (verdict: Runtime Error):
N, K = map( int, input().split() )
S = str( input() )
S[ K - 1 ] = S[ K - 1 ].lower()
print( S )

Fixed submission:
N, K = map( int, input().split() )
S = list( input() )
S[ K - 1 ] = S[ K - 1 ].lower()
print( "".join(S) )

Buggy python submission (verdict: Runtime Error):
N, K = map( int, input().split() )
S = str( input() )
S[ K - 1 ] = S[ K - 1 ].lower
print( S )

Fixed submission:
N, K = map( int, input().split() )
S = list( input() )
S[ K - 1 ] = S[ K - 1 ].lower()
print( "".join(S) )
Buggy python submission (verdict: Runtime Error):
y, m, d = map( int, input().split("/") )
if m <= 4
   print( "Heisei" )
else : 
   print( "TBD" )

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

Buggy python 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" )

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

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

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

Fixed submission:
AB, BC, CA = map( int, input().split() )
print( ( AB * BC ) // 2 )
Buggy python submission (verdict: Runtime Error):
N = int( input() )
if N == 1 : 
   print( "Hello World" )
else : 
{
   A = int( input() )
   B = int( input() )
   print( A + B )
}

Fixed submission:
N = int( input() )
if N == 1 : 
   print( "Hello World" )
else : 
   A = int( input() )
   B = int( input() )
   print( A + B )
Buggy python submission (verdict: Runtime Error):
X, Y = map( int, input().split() )
if Y % X == 0 or X % Y == 0
   print( -1 )
else 
   print( X )

Fixed submission:
X, Y = map( int, input().split() )
if X % Y == 0:
   print( -1 )
else :
   print( X )
Buggy python submission (verdict: Runtime Error):
N = str( input() )
if str[0] == "9" or str[1] == "9" :
   print( "Yes" )
else : 
   print( "No" )
   

Fixed submission:
N = str( input() )
if N[0] == "9" or N[1] == "9" :
   print( "Yes" )
else : 
   print( "No" )
Buggy python 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) )

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 python 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" )

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 python 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" )

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 python submission (verdict: Runtime Error):
s1, s2, s3 = map( str, input().split() )
print( s1[0].upper + s2[0].upper + s3[0].upper ) 

Fixed submission:
s1, s2, s3 = map( str, input().split() )
print( s1[0].upper() + s2[0].upper() + s3[0].upper() )
Buggy python submission (verdict: Runtime Error):
s = str( input() )
if s == "H H" | s == "D D" : 
   print( "H" ) 
else : 
   print( "D" ) 

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

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

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

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

Fixed submission:
s = input()
if s == "H H" or s == "D D" : 
   print( "H" ) 
else : 
   print( "D" )
Buggy python submission (verdict: Runtime Error):
A, B = map( int, input().split() )
if A > B :
   print( "Alice" )
elseif A < B :
   print( "Bob" )
else : 
   print( "Draw" )

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

if A == 1 :
   A = 14
if B == 1 :
   B = 14

if A > B :
   print( "Alice" )
elif A < B :
   print( "Bob" )
else : 
   print( "Draw" )