Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())

cnt = 0
for i in range(2):
    if s[i]==s[t]:
        cnt =+1
print(cnt)


Fixed submission:
s = list(input())
t = list(input())

cnt = 0
for i in range(len(s)):
    if s[i] == t[i]:
        cnt += 1
        continue
print(cnt)

Buggy python submission (verdict: Runtime Error):
s = list(input())
t = list(input())

cnt = 0
for i in range(2)
    if s[i]==s[t]:
        cnt =+1
print(cnt)

Fixed submission:
s = list(input())
t = list(input())

cnt = 0
for i in range(len(s)):
    if s[i] == t[i]:
        cnt += 1
        continue
print(cnt)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input.split())


print(c-(a-b))

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


if c-(a-b) >= 0:
    print(c-(a-b))
else:
    print("0")
Buggy python submission (verdict: Runtime Error):
s = list(map(int,input()))

result = True
for i in range(len(s)-1):
    if a[i] == a[i+1]:
        result = bad
        break
if result == "bad":
    print("Bad")
else:
    print("Good")

Fixed submission:
s = list(map(int,input()))

result = "True"
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        result = "bad"
        break
if result == "bad":
    print("Bad")
else:
    print("Good")
Buggy python submission (verdict: Runtime Error):
if 13 <= A:
    print(B)
elif (6 <= A) and (A<=12):
    print(B/2)
else:
    print(0)

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

if 13 <= A:
    print(B)
elif (6 <= A) and (A<=12):
    print(B//2)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())

int sum = 0

if A > B:
   sum = A+A-1
   print(sum)

if B > A:
   sum = B+B-1
   print(sum)

if B == A:
   sum = B+A
   print(sum)




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

C = 0

if A > B:
   C = A+A-1
   print(C)

if B > A:
   C = B+B-1
   print(C)

if B == A:
   C = B+A
   print(C)
Buggy python submission (verdict: Runtime Error):
n = list(int(input())

cnt = 0

for i in range(len(n)):
    if n[i] == 2:
        cnt += 1
print(cnt)

Fixed submission:
n = list(input())

cnt = 0

for i in range(len(n)):
    if n[i] == "2":
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
d = int(input())

if d == 25
    print("Christmas")
elif d == 24
    print("Christmas Eve")
elif d == 23
    print("Christmas Eve Eve")
elif d == 23
    print("Christmas Eve Eve")


Fixed submission:
d = int(input())

if d == 25:
    print("Christmas")
elif d == 24:
    print("Christmas Eve")
elif d == 23:
    print("Christmas Eve Eve")
elif d == 22:
    print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
S = list(input())

new_S = sorted(s)

if new_S =="abc":
    print("Yes")
else:
    print("No")

   


Fixed submission:
S = str(input())

new_S = sorted(S)
new_S = ''.join(new_S)

if new_S == "abc":
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
D = int(input())


print(min(A+B)+min(C+D))


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


print(min(A,B)+min(C,D))
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())

if A+B <= C
    print("Yes")
else:
    print("No")
     




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

if A+B >= C:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s = list(input())

for i ==2:
   sum+=s[i]
print(sum)

Fixed submission:
s = list(input())

j = []
for ss in s:
     j.append(int(ss))
print(sum(j))
Buggy python submission (verdict: Runtime Error):
R = int(input())
G = int(input())

print(2G-R)



Fixed submission:
R = int(input())
G = int(input())

print(2*G-R)

Buggy python submission (verdict: Runtime Error):
R = int(input())
G = int(input())

input(2G-R)




Fixed submission:
R = int(input())
G = int(input())

print(2*G-R)
Buggy python submission (verdict: Runtime Error):
s = input()

for i in range(len(s)-1):
if s[i] == "A" and s[i+1] == "C":
    print("Yes")
else:
    print("No")
    
 
    
 
    

Fixed submission:
s = input()

for i in range(len(s)-1):
    if s[i] == "A" and s[i+1] == "C":
        print("Yes")
        exit()
print("No")

Buggy python submission (verdict: Runtime Error):
s = input()

for i in range(len(s)-1):
if s[i][i+1] == "AC":
    print("Yes")
else:
    print("No")
    
 
    

Fixed submission:
s = input()

for i in range(len(s)-1):
    if s[i] == "A" and s[i+1] == "C":
        print("Yes")
        exit()
print("No")

Buggy python submission (verdict: Runtime Error):
s = input()

for i in range(len(s)-1)
if s[i][i+1] == "AC":
    print("Yes")
else:
    print("No")
    
 
    

Fixed submission:
s = input()

for i in range(len(s)-1):
    if s[i] == "A" and s[i+1] == "C":
        print("Yes")
        exit()
print("No")
Buggy python submission (verdict: Runtime Error):
S = input()

print(s[:-8])


 
    

Fixed submission:
S = input()

print(S[:-8])
Buggy python submission (verdict: Runtime Error):
S = input()

if S[0] == "Y" and S[1] == "A" and S[2] == "K" and S[3] == "I":
    print("Yes")
else:
    print("No")


Fixed submission:
S = input()

if S[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
S = list(input())

if S[0] == "Y" and S[1] == "A" and S[2] == "K" and S[3] == "I":
    print("Yes")
else:
    print("No")



Fixed submission:
S = input()

if S[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
S = list(input())

if S[0] == "Y" and S[1] == "A" and S[2] == "K" and S[3] == "I":
    print("Yes")
else:
    print("No")


 
    

Fixed submission:
S = input()

if S[:4] == "YAKI":
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = list(int(input()))

if N[0] == 9 or N[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):
s = str(input())
alphabet = ["a","b","c","d","e","f"
,"g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y","z"]

for i in s:
    if i in alphabet:
        alphabet.remove(i)
if len(alphabet)!=:
    print(alphabet[0])
else:
    print("Nome")
 


    

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

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")
Buggy python submission (verdict: Runtime Error):
s,t,u = input().spilt()

print(s[0].upper()+t[0].upper()+u[0].upper())



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

print(s[0].upper()+t[0].upper()+u[0].upper())

Buggy python submission (verdict: Runtime Error):
s,t,u = map(str,input().spilt())

print(s[0].upper()+t[0].upper()+u[0].upper())


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

print(s[0].upper()+t[0].upper()+u[0].upper())

Buggy python submission (verdict: Runtime Error):
s,t,u = map(str,input().spilt())

print(str.upper(s[0])+str.upper(t[0])+str.upper(u[0]))



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

print(s[0].upper()+t[0].upper()+u[0].upper())

Buggy python submission (verdict: Runtime Error):
s,t,u = map(str,input().spilt())

print(str.upper(s[0]+str.upper(t[0]+str.upper(u[0]))



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

print(s[0].upper()+t[0].upper()+u[0].upper())
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,unput().split())

if b-a == c-b:
    print("YES")
else:
    print("NO") 
  



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

if b-a == c-b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())

if a+b>24
    print(a+b-24)
else:
    print(a+b)


Fixed submission:
#A時ちょうどで、
#コンテストがちょうどB時間後に始まる。

#コンテスト開始時間は24時間表記で何時ちょうどでしょうか？

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

if a+b < 24:
    print(a+b)
else:
    print(a+b-24)
Buggy python submission (verdict: Runtime Error):
a,b = map(str,input().split())

if a == "H" and b == "H":
    print("H")
elif a == "H" and b == "D":
    print("D")
elif a == "D" and b == "H":
    print("D")
else a == "D" and b == "D":
    print("H")

Fixed submission:
#AtCoDeerくん
#a = 'H'のとき正直者
#a = 'D'のとき嘘つき
#AtCoDeerくん
#b = 'H'のとき、「TopCoDeerくんは正直者だ」と発言する
#b = 'D'のとき、「TopCoDeerくんは嘘つきだ」と発言する

#TopCoDeerくんが正直者かどうか判定してください。
#a = H b = H →H
#a = H b = D →D
#a = D b = H →D
#a = D b = D →H

a,b = map(str,input().split())

if a == "H" and b == "H":
    print("H")
if a == "H" and b == "D":
    print("D")
if a == "D" and b == "H":
    print("D")
if a == "D" and b == "D":
    print("H")

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

if a == "H" and b == "H":
    print("H")
elif a == "H" and b == "D":
    print("D")
elif a == "D" and b == "H":
    print("D")
else: a == "D" and b == "D":
    print("H")



Fixed submission:
#AtCoDeerくん
#a = 'H'のとき正直者
#a = 'D'のとき嘘つき
#AtCoDeerくん
#b = 'H'のとき、「TopCoDeerくんは正直者だ」と発言する
#b = 'D'のとき、「TopCoDeerくんは嘘つきだ」と発言する

#TopCoDeerくんが正直者かどうか判定してください。
#a = H b = H →H
#a = H b = D →D
#a = D b = H →D
#a = D b = D →H

a,b = map(str,input().split())

if a == "H" and b == "H":
    print("H")
if a == "H" and b == "D":
    print("D")
if a == "D" and b == "H":
    print("D")
if a == "D" and b == "D":
    print("H")

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

if a == "H" and b == "H":
    print("H")
elif a == "H" and b == "D":
    print("D")
elif a == "D" and b == "H":
    print("D")
else: a == "D" and b == "D":
    print("H")

Fixed submission:
#AtCoDeerくん
#a = 'H'のとき正直者
#a = 'D'のとき嘘つき
#AtCoDeerくん
#b = 'H'のとき、「TopCoDeerくんは正直者だ」と発言する
#b = 'D'のとき、「TopCoDeerくんは嘘つきだ」と発言する

#TopCoDeerくんが正直者かどうか判定してください。
#a = H b = H →H
#a = H b = D →D
#a = D b = H →D
#a = D b = D →H

a,b = map(str,input().split())

if a == "H" and b == "H":
    print("H")
if a == "H" and b == "D":
    print("D")
if a == "D" and b == "H":
    print("D")
if a == "D" and b == "D":
    print("H")

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

if a == "H" and b == "H":
    print("H")
elif a == "H" and b == "D":
    print("D")
elif a == "D" and b == "H":
    print("D")
else: a == "D" and b == "D":
    print("H")


Fixed submission:
#AtCoDeerくん
#a = 'H'のとき正直者
#a = 'D'のとき嘘つき
#AtCoDeerくん
#b = 'H'のとき、「TopCoDeerくんは正直者だ」と発言する
#b = 'D'のとき、「TopCoDeerくんは嘘つきだ」と発言する

#TopCoDeerくんが正直者かどうか判定してください。
#a = H b = H →H
#a = H b = D →D
#a = D b = H →D
#a = D b = D →H

a,b = map(str,input().split())

if a == "H" and b == "H":
    print("H")
if a == "H" and b == "D":
    print("D")
if a == "D" and b == "H":
    print("D")
if a == "D" and b == "D":
    print("H")
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int(),input().split())

if a*b == c*d:
    print(a*b)
if a*b =< c*d:
    print(c*d)
if a*b >= c*d:
    print(a*b)




Fixed submission:
#二つの長方形
#縦A、横B A*B
#縦C、横D C*D

a,b,c,d = map(int,input().split())

if a*b == c*d:
    print(a*b)
if a*b < c*d:
    print(c*d)
if a*b > c*d:
    print(a*b)
Buggy python submission (verdict: Runtime Error):
s = list(str(input()))

print(s[0]+s[1]+s[2]+s[3]+s[4])+" "+s[6]+s[7]+s[8]+s[9]+s[10]+s[11]+s[12]+" "+s[14]+s[15]+s[16]+s[17]+s[18])





Fixed submission:
s = input().replace(','," ")
print(s)
Buggy python submission (verdict: Runtime Error):
a,b,c= input().list()

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))



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

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

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

if b == "+":
    print(ing(a)+int(c))
else:
    print(int(a)-int(c))



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

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

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

if b == "+":
    print(a+c)
else:
    print(a-c)



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

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Buggy python submission (verdict: Runtime Error):
int a,str b,int c = input().list()

if b == "+":
    print(a+c)
else:
    print(a-c)



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

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

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

if b == "+":
    print(a+c)
else:
    print(a-c)



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

if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))
Buggy python submission (verdict: Runtime Error):
c = input()

if c == a or c == e or c == i or c == o or c == u:
    print("vowel")
else:
    print("consonant")



Fixed submission:
c = input()

if c == "a" or c == "e" or c == "i" or c == "o" or c == "u":
    print("vowel")
else:
    print("consonant")
Buggy python submission (verdict: Runtime Error):
a,b,x = map(int,input().split())

#if a > x or b < x:
#    print("0")
elif a%x == 0:
    print(b//x-a//x+1)
else:
    print(b//x-a//x)




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

print(a[0]+b[0]+c[0])

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

if a > x or b < x:
    print("0")
elif a%x == 0:
    print(b//x-a//x+1)
else:
    print(b//x-a//x)




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

print(a[0]+b[0]+c[0])

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

if a > x or b < x:
    print("0")
elif a%xx == 0:
    print(b//x-a//x+1)
else:
    print(b//x-a//x)




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

print(a[0]+b[0]+c[0])
Buggy python submission (verdict: Runtime Error):
a,b,c = sorted(map(int,input().split()))

if a+b =c:
    print("Yes")
else:
    print("No")



Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

if a+b =c:
    print("Yes")
else:
    print("No")

Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

int T = 0

if a+b == c:
    T = 1
elif b+c == a:
    T = 1
elif a+c == b:
    T = 1

if T == 1:
    print('YES')
else:
    print('NO')




Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

int T = 0

if a+b == c:
    T = 1
elif b+c == a:
    T = 1
elif a+c == b:
    T = 1

if T == 1:
    print('YES')
else:
    print('NO')




Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

int T = 0

if a+b == c:
    T = 1
elif b+c == a:
    T = 1
elif a+c == b:
    T = 1

if T == 1:
    print("YES")
else:
    print('NO')




Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

T = 0

if a+b = c:
    T = 1
elif b+c = a:
    T = 1
elif a+c = b:
    T = 1

if T = 1:
    print("YES")
else:
    print("NO")




Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

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

if ((a+b+c)%3 == 0):
    print("Yes")
else
    print("No")

    

Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can = can.sort()

if can[0]+can[2] == can[1]:
    print("Yes")
else:
    print("No")

Fixed submission:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b,c = input().split()

int(sum) = 1
if a == b:
    sum +=1
if a == c:
    sum +=1
if b == c:
    sum += 1
print(sum)

Fixed submission:
import collections

pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))

Buggy python submission (verdict: Runtime Error):
pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))



Fixed submission:
import collections

pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))

Buggy python submission (verdict: Runtime Error):
pen = list(map(str,input().split()))

print(collections.Counter(pen))

Fixed submission:
import collections

pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())

print(k*(k-1)**(n-1))

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


print(k*(k-1)**(n-1))
Buggy python submission (verdict: Runtime Error):
S = list(input())

C = list(CODEFESTIVAL2016)

cnt = 0
for i in range(len(C)):
    if S[i] != C[i]:
        cnt += 1
print(cnt)

Fixed submission:
S = list(input())

C = list("CODEFESTIVAL2016")

cnt = 0
for i in range(len(C)):
    if S[i] != C[i]:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
sa = [s for s in input()]
sb = [s for s in input()]
sc = [s for s in input()]

next_turn = "a"
flag = True

while flag:
    if next_turn == "a":
        if len(sa) == 0:
            print("A")
            flag = False
        else:
            next_turn = sa.pop(0)
    elif next_turn == "b":
        if len(sb) == 0:
            print("B")
            flag = False
        else:
            next_turn = sb.pop(0)
    elif next_turn == "c":
        if len(sc) == 0:
            print("C")
            flag = False
        else:
            next_turn = sc.pop(0)
        



Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print((a+b)*h//2)

Buggy python submission (verdict: Runtime Error):
sa = [s for s in input()]
sb = [s fir s in input()]
sc = [s for s in input()]

next_turn = "a"
flag = True

while flag:
    if next_turn == "a":
        if len(sa) == 0:
            print("A")
            flag = False
        else:
            next_turn = sa.pop(0)
    elif next_tunr == "b":
        if len(sb) == 0:
            print("B")
            flag = false
        else:
            next_turn = sb.pop(0)
    elif next_turn == "c":
        if len(sc) ==0:
            print("C")
            flag = False
        else:
            next_turn = sc.pop(0)
        



Fixed submission:
a = int(input())
b = int(input())
h = int(input())

print((a+b)*h//2)
Buggy python submission (verdict: Runtime Error):
N = int(input())

int S = N*(N+1)/2

print(S)

Fixed submission:
N = int(input())

S = N*(N+1)//2

print(S)

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

S = N*(N+1)/2

print(S)

Fixed submission:
N = int(input())

S = N*(N+1)//2

print(S)

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

S = N * (N+1) /2

print(S)


Fixed submission:
N = int(input())

S = N*(N+1)//2

print(S)
Buggy python submission (verdict: Runtime Error):
chars = input()

ans = []
for c in chars:
    if c in ['0','1']:
        ans.append(c)
    elif len(ans) != 0:
        ans.pop(-1)
        
        
p;rint(''.join(ans))




Fixed submission:
s = list(input())

S = []
for i in range(len(s)):
    if s[i] == "0":
        S += s[i]
    elif s[i] == "1":
        S += s[i]
    elif len(S) == 0:
        pass
    else:
        del S[-1]
print("".join(S))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
sum.ab = a + b
sum.bc = b + c
sum.ac = a + c
print(min(sum.ab, min(sum.bc, sum.ac)))

Fixed submission:
a,b,c = map(int, input().split())
sum_ab = a + b
sum_bc = b + c
sum_ac = a + c
print(min(sum_ab, min(sum_bc, sum_ac)))
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if b − a == c − b:
    print("YES")
else:
    print("NO")

Fixed submission:
a, b, c = map(int, input().split())
if b - a == c - b :
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if b−a == c−b:
    print("YES")
else:
    print("NO")

Fixed submission:
a, b, c = map(int, input().split())
if b - a == c - b :
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
S=input()
if S == "Sunny" :
    print("Cloudy")
else if 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):
a,b=map(int(),input().sprit())
print(max(a + b,a - b,a * b))

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

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


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

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


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

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

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

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


Fixed submission:
a,b=map(int,input().split())
print(max(a + b,a - b,a * b))
Buggy python submission (verdict: Runtime Error):
Copy
# -*- coding: utf-8 -*-
 
 
def main():
    # ヒープキューをインポート
    from heapq import heappush, heappop
 
    n, m = map(int, input().split())
    jobs = [[] for _ in range(m)]  # 締め切り別に，報酬を管理
 
    # See:
    # https://www.youtube.com/watch?v=1Z6ofKN03_Y
    for i in range(n):
        ai, bi = map(int, input().split())
 
        # 報酬が振り込まれる日がM日よりも後になる場合は除外
        if ai > m:
            continue
 
        # i件目のアルバイトを遅くてもいつまでに始める必要があるかを計算
        # heappopは最小値を返す．biを-1倍することで，最大値が取り出せる
        deadline = m - ai
        jobs[deadline].append(-bi)
 
    ans = 0
    reward = []
 
    # M-1日に始める必要があるアルバイトのうち，最も報酬の高いものを選択
    # 以降，今日始める必要があるアルバイトまで，順番に調べる
    # ある時点で得られる報酬の大小に着目
    for i in range(m - 1, -1, -1):
        for job in jobs[i]:
            # ヒープキューに，報酬の候補を追加
            heappush(reward, job)
 
        # 条件を満たすもののうち，最大の報酬を選択
        if reward:
            ans += heappop(reward)
 
    # ヒープキューに追加するときに，-1倍した分を元に戻す
    print(-ans)
 
 
if __name__ == '__main__':
    main()

Fixed submission:
def main():
    # ヒープキューをインポート
    from heapq import heappush, heappop
 
    n, m = map(int, input().split())
    jobs = [[] for _ in range(m)]  # 締め切り別に，報酬を管理
 
    # See:
    # https://www.youtube.com/watch?v=1Z6ofKN03_Y
    for i in range(n):
        ai, bi = map(int, input().split())
 
        # 報酬が振り込まれる日がM日よりも後になる場合は除外
        if ai > m:
            continue
 
        # i件目のアルバイトを遅くてもいつまでに始める必要があるかを計算
        # heappopは最小値を返す．biを-1倍することで，最大値が取り出せる
        deadline = m - ai
        jobs[deadline].append(-bi)
 
    ans = 0
    reward = []
 
    # M-1日に始める必要があるアルバイトのうち，最も報酬の高いものを選択
    # 以降，今日始める必要があるアルバイトまで，順番に調べる
    # ある時点で得られる報酬の大小に着目
    for i in range(m - 1, -1, -1):
        for job in jobs[i]:
            # ヒープキューに，報酬の候補を追加
            heappush(reward, job)
 
        # 条件を満たすもののうち，最大の報酬を選択
        if reward:
            ans += heappop(reward)
 
    # ヒープキューに追加するときに，-1倍した分を元に戻す
    print(-ans)
 
 
if __name__ == '__main__':
    main()