Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
tmp = 0
if abs(A-B) > 1:
    tmp = max(A,B)
    print(tmp*2-1)
else abs(A-B) == 1:
    print(A + B)

Fixed submission:
A, B = map(int, input().split())
if abs(A-B) > 1:
    tmp = max(A,B)
    print(tmp*2-1)
else:
    print(A + B)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
if abs(A-B) > 1:
    tmp = max(A,B)
    print(tmp*2-1)
else abs(A-B) == 1:
    print(A + B)

Fixed submission:
A, B = map(int, input().split())
if abs(A-B) > 1:
    tmp = max(A,B)
    print(tmp*2-1)
else:
    print(A + B)
Buggy python submission (verdict: Runtime Error):
for _ in range(6):
    a.append(int(input()))
for i in range(6):
    for j in a[i+1:]:
        if abs(a[i]-j) > k:
            print(":(")
            exit()
print("Yay!")

Fixed submission:
a = []
for _ in range(5):
    a.append(int(input()))
k = int(input())
for i in range(5):
    for j in a[i+1:]:
        if abs(a[i]-j) > k:
            print(":(")
            exit()
print("Yay!")
Buggy python submission (verdict: Runtime Error):
inp = []
tmp = 10
ans = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)

Fixed submission:
inp = []
tmp = 10
ans = 0
temp = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)

Buggy python submission (verdict: Runtime Error):
inp = []
tmp = 9
ans = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)


Fixed submission:
inp = []
tmp = 10
ans = 0
temp = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)

Buggy python submission (verdict: Runtime Error):
inp = []
tmp = 9
ans = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)


Fixed submission:
inp = []
tmp = 10
ans = 0
temp = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)

Buggy python submission (verdict: Runtime Error):
inp = []
tmp = 9
ans = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i

last = inp.pop(temp)
print(last)
for j in inp:
    print(ans)
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)

Fixed submission:
inp = []
tmp = 10
ans = 0
temp = 0
for _ in range(5):
    inp.append(input())
for i in range(5):
    if tmp > int(inp[i][-1]) and int(inp[i][-1]) != 0:
        tmp = int(inp[i][-1])
        temp = i
last = inp.pop(temp)
for j in inp:
    if j[-1] == "0":
        ans += int(j)
    else:
        ans += int(j[:-1]+ "0") + 10
ans += int(last)
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
for i in range(len(S)):
    if S[i] == "A" or "C" or "G" or "T":
        for j in range(i+1,len(S)):
            if S[j] == "A" or "C" or "G" or "T":
                continue
            else:
                tmp = j-i
                break
print(tmp)

Fixed submission:
S = input()
ans = 0
acgt = ["A","C","G","T"]
for i in range(len(S)):
    tmp = 0
    if S[i] in acgt:
        tmp += 1
        for j in range(i+1,len(S)):
            if S[j] in acgt:
                tmp += 1
                continue
            else:
                ans = max(ans,tmp)
                break
        ans = max(ans,tmp)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
q =[]
for i in range(Q):
    q.append(list(map(int, input().split())))
for i,j in q:
    tmp = 0
    for k in range(i-1,j):
        if S[k] == "A":
            if k+1<j and S[k+1] == "C":
                tmp += 1
    else:
        print(tmp)

Fixed submission:
N, Q = map(int, input().split())
S = input()
q =[]
temp = [0] * (N+1)
tmp = 0
for i in range(1,N):
    if S[i-1] == "A":
        if S[i] == "C":
            tmp +=1
    temp[i+1] = tmp
for j in range(Q):
    inp = input().split()
    print(temp[int(inp[1])] - temp[int(inp[0])])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
q =[]
for i in range(Q):
    q.append(list(map(int, input().split())))
for i,j in q:
    tmp = S[i-1:j].replace("G","").replace("T","")
    print(tmp.count("AC"))

Fixed submission:
N, Q = map(int, input().split())
S = input()
q =[]
temp = [0] * (N+1)
tmp = 0
for i in range(1,N):
    if S[i-1] == "A":
        if S[i] == "C":
            tmp +=1
    temp[i+1] = tmp
for j in range(Q):
    inp = input().split()
    print(temp[int(inp[1])] - temp[int(inp[0])])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
q =[]
for i in range(Q):
    q.append(list(map(int, input().split())))
for i,j in q:
    print(S[i-1:j].count("AC"))

Fixed submission:
N, Q = map(int, input().split())
S = input()
q =[]
temp = [0] * (N+1)
tmp = 0
for i in range(1,N):
    if S[i-1] == "A":
        if S[i] == "C":
            tmp +=1
    temp[i+1] = tmp
for j in range(Q):
    inp = input().split()
    print(temp[int(inp[1])] - temp[int(inp[0])])
Buggy python submission (verdict: Runtime Error):
A, B, K =map(int, input().split())
tmp = []
for i in range(2,min(A,B)+1):
    if A%i == 0 and B%i == 0:
        tmp.append(i)
tmp.sort(reverse=True)
print(tmp[K-1])

Fixed submission:
A, B, K =map(int, input().split())
tmp = []
try:
    for i in range(2,min(A,B)+1):
        if A%i == 0 and B%i == 0:
            tmp.append(i)
    tmp.sort(reverse=True)
    print(tmp[K-1])
except:
    print(1)

Buggy python submission (verdict: Runtime Error):
A, B, K =map(int, input().split())
tmp = []
for i in range(2,min(A,B)+1):
    if A%i == 0 and B%i == 0:
        emp.append(i)
tmp.sort(reverse=True)
print(tmp[K-1])

Fixed submission:
A, B, K =map(int, input().split())
tmp = []
try:
    for i in range(2,min(A,B)+1):
        if A%i == 0 and B%i == 0:
            tmp.append(i)
    tmp.sort(reverse=True)
    print(tmp[K-1])
except:
    print(1)
Buggy python submission (verdict: Time Limit Exceeded):
import re
S = input()
N = len(S)
for _ in range(N//2):
    S = re.sub("01|10","",S)
else:
  print(N-len(S))

Fixed submission:
S = input()
N = len(S)
print(2*min(S.count("0"),S.count("1")))
Buggy python submission (verdict: Runtime Error):
a = int(input())
if a =< 1000:
    b = a//1000
else:
    b = a//1000 + 1
print(b*1000 - a)

Fixed submission:
a = int(input())
if a == 1000:
    b = 1
elif a %1000 == 0:
    b = a//1000
else:
    b = a//1000 + 1
print(b*1000 - a)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!
x,n = map(int, input().split())
if n > 0:
    p = list(map(int , input().split()))
else:
    p  = []
a = list(set(list(range(1,101))) - set(p))
values = []
for i in a:
    values = values +  [[abs(x-i), i]]
values.sort(key=lambda x: x[0])
mins = values[0][0]
b = []
for i in values:
    if i[0] > mins:
        break
    b += [i[1]]
b.sort()
print(b[0])


Fixed submission:
# coding: utf-8
# Your code here!
x,n = map(int, input().split())
if n > 0:
    p = list(map(int , input().split()))
else:
    p  = []
a = list(set(list(range(-100,102))) - set(p))
values = []
for i in a:
    values = values +  [[abs(x-i), i]]
values.sort(key=lambda x: x[0])
mins = values[0][0]
b = []
for i in values:
    if i[0] > mins:
        break
    b += [i[1]]
b.sort()
print(b[0])
Buggy python submission (verdict: Runtime Error):
a = int(input())
v = int(input())
b = int(input())
w = int(input())
t = int(input())
a += t * v;
b += t * w;
if (a < b):
  print("NO")
else:
  print("YES")

Fixed submission:
s = input()
print(s[:3])
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    n = int(input())
    s = []
    for i in range(n):
        d = input()
        if not (d in s):
            s += [d]
    print(len(s))

if __name__ == "__main__":
	resolve()

Fixed submission:
def resolve():
    import sys
    input = lambda: sys.stdin.readline().rstrip()
    r = [0] * int(input())
    print(len({input() for _ in r}))

if __name__ == "__main__":
	resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    n = int(input())
    s = []
    for i in range(n):
        d = input()
        if not (d in s):
            s += [d]
    print(len(s))
resolve()

Fixed submission:
def resolve():
    import sys
    input = lambda: sys.stdin.readline().rstrip()
    r = [0] * int(input())
    print(len({input() for _ in r}))

if __name__ == "__main__":
	resolve()
Buggy python submission (verdict: Runtime Error):
def ispalindrome(s):
    h = len(s) / 2
    for a, b in zip(s[:h], reversed(s[h+1:])):
        if a != b: return False
    return True
s = input()
n = len(s)
if ispalindrome(s) and ispalindrome(s[0:int((n+1)/2)-1]) and ispalindrome(s[int((n+3)/2)-1:n-1]):
    print("Yes")
else:
    print("No")

Fixed submission:
def k(string): return True if string==string[::-1] else False
s = input()
n = len(s)
if k(s) and k(s[:int((n-1)/2)]) and k(s[int((n+3)/2)-1:]):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
print(((input())/3)**3)

Fixed submission:
print(((int(input()))/3)**3)
Buggy python submission (verdict: Runtime Error):
a = list(map(int,ipnut().split()))
a = set(a)
if len(a)==2:
  print("Yes")
else:
  print("No")

Fixed submission:
def resolve():
    s = set(map(int,input().split()))
    if len(s) == 2:
        print("Yes")
    else:
        print("No")
resolve()
Buggy python submission (verdict: Runtime Error):
def resolve():
    import collections
    n = int(input())
    c = list(collections.Counter([int(input()) for _ in range(n)]).most_common())
    s = []
    m = c[0][0]
    for i in c:
        if c !=m:
            break
        s.append(i[0])
    s.sort()
    print("\n".join(s))
resolve()

Fixed submission:
def resolve():
    import collections
    n = int(input())
    c = list(collections.Counter([input() for _ in range(n)]).most_common())
    s = []
    m = c[0][1]
    for i in c:
        if i[1] !=m:
            break
        s.append(i[0])
    s.sort()
    print("\n".join(s))
resolve()
Buggy python submission (verdict: Runtime Error):
a,b=map(int,ipnut().split())
print(str(min(int(a),int(b)))*max(int(a),int(b)))

Fixed submission:
a,b=map(int,input().split())
print(str(min(a,b))*max(a,b))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s1 = []
t1 = []
for in range(n):
  d = map(in,input().split())
  s1.append(d[0])
  t1.append(d[1])
print(sum(t1[s1.index(input()):]))

Fixed submission:
n = int(input())
s1 = []
t1 = []
for i in range(n):
  d =list( map(str,input().split()))
  s1.append(d[0])
  t1.append(int(d[1]))
print(sum(t1[s1.index(input())+1:]))
Buggy python submission (verdict: Runtime Error):
s,t=map(int,input().split())
print(t+s)

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


Fixed submission:
a,b,k=map(int,input().split())
if a>k:
  print(str(a-k) + " " + str(b))
else:
  if b-(k-a) < 0:
    print("0 0")
  else:
  	print(str(0) +" " +str(b-(k-a)))

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

Fixed submission:
a,b,k=map(int,input().split())
if a>k:
  print(str(a-k) + " " + str(b))
else:
  if b-(k-a) < 0:
    print("0 0")
  else:
  	print(str(0) +" " +str(b-(k-a)))
Buggy python submission (verdict: Runtime Error):
m,d = map(int,input().split())
m2,d2 = ap(int,input().split())
if(m!=m2):
  print(1)
else:
  print(0)

Fixed submission:
m,d = map(int,input().split())
m2,d2 = map(int,input().split())
if(m!=m2):
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
rot = int(input())
s = input()
g = (chr((ord(c) - ord('A') + rot) % 26 + ord('A')) for c in s)
print(g)

Fixed submission:
s = input()
if s=="SUN":
  print(7)
elif s=="MON":
  print(6)
elif s=="TUE":
  print(5)
elif s=="WED":
  print(4)
elif s=="THU":
  print(3)
elif s=="FRI":
  print(2)
elif s=="SAT":
  print(1)

Buggy python submission (verdict: Runtime Error):
s = input()
if s=="SUN":
  print(7)
elif s=="MON":
  print(6)
elif s=="TUE":
  print(5)
else s=="WED":
  print(4)
else s=="THU":
  print(3)
else s=="FRI":
  print(2)
else s=="SAT":
  print(1)

Fixed submission:
s = input()
if s=="SUN":
  print(7)
elif s=="MON":
  print(6)
elif s=="TUE":
  print(5)
elif s=="WED":
  print(4)
elif s=="THU":
  print(3)
elif s=="FRI":
  print(2)
elif s=="SAT":
  print(1)
Buggy python submission (verdict: Runtime Error):
import math
n=input()
print(math.ceil(n/2)/n)

Fixed submission:
import math
n=int(input())
print(math.ceil(n/2)/n)
Buggy python submission (verdict: Runtime Error):
asdf={"Sunny":0,"Cloudy":1,"Rainy":2}
a=asdf[input()]
a+=1
if a>2:
  a=0
print([k for k, v in d.items() if v == a][0])

Fixed submission:
asdf={"Sunny":0,"Cloudy":1,"Rainy":2}
a=asdf[input()]
a+=1
if a>2:
  a=0
print([k for k, v in asdf.items() if v == a][0])
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=map(int,input().split())
asdf =  0
for i in range(n):
  asdf += 1/a[i]
print(1/asdf)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
asdf =  0
for i in range(n):
  asdf += 1/a[i]
print(1/asdf)
Buggy python submission (verdict: Runtime Error):
a,b=map(nit,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):
n,a,b = map(nt,input().split())
print(min(a*n,b))

Fixed submission:
n,a,b = map(int,input().split())
print(min(a*n,b))
Buggy python submission (verdict: Runtime Error):
s=input()
asdf=True
deta=tuple(s)
if len(data)==2:
  print("No")
else:
  if s.count(data[0])==2:
    print("Yes")
  else:
    print("No")


Fixed submission:
s = ''.join(sorted(input()))
if(s[0]==s[1] and s[2] == s[3] and s[1] != s[3]):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n=int(input())
p=list(map(int,input().split()))
uuum = 0
for i in range(n-2):
  aaa = [p[i],p[i+1],p[i+2]]
  aaa.sort()
  if aaa[1]==p[i+1]:
    uuum+=1
print(uuum)


Fixed submission:
s = ''.join(sorted(input()))
if(s[0]==s[1] and s[2] == s[3] and s[1] != s[3]):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s=input()
s.sort()
if s[0]==s[1]and s[2]==s[3]:
  print("Yes")
else:
  print("No")

Fixed submission:
s = ''.join(sorted(input()))
if(s[0]==s[1] and s[2] == s[3] and s[1] != s[3]):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
a.sort()
print(sum(a[0:1])

Fixed submission:
a = list(map(int,input().split()))
a.sort()
print(sum(a[0:2]))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
txt = input()
txt[b] = txt[b].lower()
print(txt)


Fixed submission:
a,b = map(int,input().split())
txt = list(input())
txt[b - 1] = txt[b - 1].lower()
print("".join(txt))

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
txt = input()
txt[b] = txt[b].lower
print(txt)

Fixed submission:
a,b = map(int,input().split())
txt = list(input())
txt[b - 1] = txt[b - 1].lower()
print("".join(txt))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if (a<b&&b<c)||(b<a&&c<b):
  print("Yes")
else:
  print("No")

Fixed submission:
a,b,c = map(int,input().split())
if (a<c and c<b) or (c<a and b<c):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
s = [a,b,c,d,e]
kk = "Yay!"
for z in range(lan(s)):
  ss = s[(z+1):]
  for y in ss:
    if s[z] - y > k :
      kk=":("
      
print(kk)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
inp=[a,b,c,d,e]
i=0;
j=0;
kek=true
while i<5:
  j=i
  while j<5:
    if inp[j]-inp[i]>k:
      kek=false
      
if kek:
  print "Yay!"
else:
    print ":("  

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
inp=[a,b,c,d,e]
i=0;
j=0;
kek=true
while i<5:
  j=i
  while j<5:
    if inp[j]-inp[i]>k:
      kek=false
      
if kek:
  print "Yay!"
else:
    print ":("  

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
inp=[a,b,c,d,e]
i=0;
j=0;
kek=true
while i<5:
  j=i
  while j<5:
    if inp[j]-inp[i]>k:
      kek=false
      
print "Yay!" if kek else print ":("    

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
inp=[a,b,c,d,e]
i=0;
j=0;
kek=true
while i<5:
  j=i
  while j<5:
    if inp[j]-inp[i]>k:
      kek=false
      
print("Yay!") if kek else print(":(")      

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
d=input()
e=input()
k=input()
inp=[a,b,c,d,e]
i=0;
j=0;
kek=true
while i<5:
  j=i
  while j<5:
    if inp[j]-inp[i]>k:
      kek=false
      
print("Yay!") if kek else print(":(")      


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if (e-a)> k:
  print(":(")
else:
  print("Yay!")
Buggy python submission (verdict: Runtime Error):
agct = ["A":"T","G":"C","T":"A","C":"G"]
print(agct[input()])

Fixed submission:
b = input()
aa = {"A":"T", "T":"A", "G":"C", "C":"G"}
print(aa[b])

Buggy python submission (verdict: Runtime Error):
b = input()
aa = {"A":"T","T":"A","G":"C","C","G"}
print(aa[b])

Fixed submission:
b = input()
aa = {"A":"T", "T":"A", "G":"C", "C":"G"}
print(aa[b])
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input())
if isinstance(A / B, int):
  print(A + B)
else:
  print(B - A)


Fixed submission:
a,b=map(int,input().split())
print(a+b if b%a==0 else b-a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = map(int,input().split())
if max(l) < sum(l-[max(l)]):
  print("Yes")
else:
  print("No")

Fixed submission:
n = input()
l = map(int,input().split())
ld = sorted(l, reverse=True)
m = ld[0]
h = sum(ld[1:])
if m < h:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = list(map(int,input().split()))
if n.sorted() == [1,4,7,9]:
  print("YES")
else:
  print("NO")

Fixed submission:
n = list(map(int,input().split()))
if sorted(n) == [1,4,7,9]:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
PM = []
for i in range(N):
  PM = input().split()
  P = str(PM[0]).zfill(6)
  M = str(PM[1]).zfill(6)
  print(P + M)

Fixed submission:
X,Y=map(int,input().split())
print(X+Y//2)

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split)
print((a+b)/2)

Fixed submission:
X,Y=map(int,input().split())
print(X+Y//2)

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
print((a+b)/2)

Fixed submission:
X,Y=map(int,input().split())
print(X+Y//2)
Buggy python submission (verdict: Runtime Error):
a = input()
if a == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)

Fixed submission:
if input() == "1":
  print("Hello World")
else:
  print(int(input()) + int(input()))
Buggy python submission (verdict: Runtime Error):
a={"1":"9","9":"1"}
t=input()
n=""
for i is range(3):
  n+=a[t[i]]
print(n)

Fixed submission:
a = {"1":"9","9":"1"}
z = input()
m = ""
for i in z:
  m += a[i]

print(m)

Buggy python submission (verdict: Runtime Error):
a = {"1":9,"9":1}
z = input()
m = ""
for i in z:
  m += a[i]

print(m)

Fixed submission:
a = {"1":"9","9":"1"}
z = input()
m = ""
for i in z:
  m += a[i]

print(m)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%2==0or b%2==0:
  print("NO")
else:
  print("YES")

Fixed submission:
a, b = map(int, input().split())
print("Yes" if a*b%2==1 else "No")

Buggy python submission (verdict: Runtime Error):
a,b=m(int,input().split())
if a%2==0or b%2==0:
  print("NO")
else:
  print("YES")

Fixed submission:
a, b = map(int, input().split())
print("Yes" if a*b%2==1 else "No")
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
print(n%k

Fixed submission:
a,b = map(int,input().split())
if a % b == 0:
  print(0)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
n = 0
s = input()
for ss in s:
  if ss="+":
    n = n+1
  else:
    n = n-1
print(n)

Fixed submission:
n = {"++++":4,"+++-":2,"++--":0,"+---":-2,"----":-4}
s = "".join(sorted(input()))
print(n[s])

Buggy python submission (verdict: Runtime Error):
a=input()
z=0
for i in range(4):
   z-=1 if a[i]=='-'else z+=1

Fixed submission:
n = {"++++":4,"+++-":2,"++--":0,"+---":-2,"----":-4}
s = "".join(sorted(input()))
print(n[s])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a<8 and b8:
  print("Yay!")
else:
  print(":)")


Fixed submission:
a,b = map(int,input().split())
if a<9and b<9:
  print("Yay!")
else:
  print(":(")

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a<8 && b<8:
  print("Yay!")
else:
  print(":)")

Fixed submission:
a,b = map(int,input().split())
if a<9and b<9:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
print("ABC" if input()<1000 else "ABD")

Fixed submission:
a=int(input())
if a<1000:
  print("ABC")
else:
  print("ABD")
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
if (A * B) % 2 == 0:
  print("Even")
else:
  plint("Odd")

Fixed submission:
A,B = map(int, input().split())
if (A * B) % 2 == 0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
if (A * b) % 2 == 0:
  print("Even")
else:
  plint("Odd")

Fixed submission:
A,B = map(int, input().split())
if (A * B) % 2 == 0:
  print("Even")
else:
  print("Odd")