Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n, k, q = map(int, input().split())

scores = [k - q] * n

for index in range(q):
    winner = int(input())
    scores[winner] += 1

for participant in range(n):
    print('Yes') if scores[participant] > 0 else print('No')


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

scores = [k - q] * n

for index in range(q):
    winner = int(input())
    scores[winner - 1] += 1

for participant in range(n):
    print('Yes') if scores[participant] > 0 else print('No')
Buggy python submission (verdict: Runtime Error):
import heapq

n, m = map(int, input().split())
goods = map(lambda x: int(x) * -1, input().split())
heapq.heapify(goods)
for i in range(n):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(the_most_expensive / 2)

print(sum(goods) * -1)


Fixed submission:
import heapq
import math

n, m = map(int, input().split())
goods = list(map(lambda x: int(x) * -1, input().split()))
heapq.heapify(goods)
for i in range(m):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(goods, math.ceil(the_most_expensive / 2))

print(sum(goods) * -1)

Buggy python submission (verdict: Runtime Error):
import heapq

n, m = map(int, input().split())
goods = map(lambda x: int(x) * -1, input().split())
heapq.heapify(goods)
for i in range(m):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(the_most_expensive / 2)

print(sum(goods) * -1)


Fixed submission:
import heapq
import math

n, m = map(int, input().split())
goods = list(map(lambda x: int(x) * -1, input().split()))
heapq.heapify(goods)
for i in range(m):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(goods, math.ceil(the_most_expensive / 2))

print(sum(goods) * -1)

Buggy python submission (verdict: Runtime Error):
import heapq

n, m = map(int, input().split())
goods = map(lambda x: int(x) * -1, input().split())
heapq.heapify(goods)
for i in range(m):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(the_most_expensive / 2)

print(sum(goods) * -1)

Fixed submission:
import heapq
import math

n, m = map(int, input().split())
goods = list(map(lambda x: int(x) * -1, input().split()))
heapq.heapify(goods)
for i in range(m):
    the_most_expensive = heapq.heappop(goods)
    heapq.heappush(goods, math.ceil(the_most_expensive / 2))

print(sum(goods) * -1)
Buggy python submission (verdict: Runtime Error):
weather = ["Sunny","Cloudy","Rainy"]
S = input()
today = weather.index(S)
tomorrow = int(today) + 1
print(weather[tomorrow])

Fixed submission:
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
elif S == "Rainy":
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
S = []
ans = 0
for c in input():
    if c != S[-1] & len(S) > 0:
        S.pop()
        ans += 2
    else:
        S.append(c)
print(ans)

Fixed submission:
S = []
ans = 0
for c in input():
    if len(S) > 0 and c != S[-1]:
        S.pop()
        ans += 2
    else:
        S.append(c)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
S = str(input())
l = len(S)
mem = l
i = 0
while (1):
    M = S
    S = S.replace("01", "")
    S = S.replace("10", "")
    if (M == S):
        break

print(mem-len(S))


Fixed submission:
S = []
ans = 0
for c in input():
    if len(S) > 0 and c != S[-1]:
        S.pop()
        ans += 2
    else:
        S.append(c)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
S = str(input())
l = len(S)
mem = l
i = 0
while (i < l-1):
    j = 0
    if (S[i] != S[i + 1]):
        if (i == 0):
            S = S[i + 2:]
        else:
            S = S[:i] + S[i + 2:]
        i = 0
    else:
        i += 1
    l = len(S)

print(mem-len(S))

Fixed submission:
S = []
ans = 0
for c in input():
    if len(S) > 0 and c != S[-1]:
        S.pop()
        ans += 2
    else:
        S.append(c)
print(ans)

Buggy python submission (verdict: Runtime Error):
S = str(input())
l = len(S)
mem = l
i = 0
while (i < l-1):
    j = 0
    if (S[i] != S[i + 1]):
        if (i == 0):
            S = S[i + 2:]
        else:
            S = S[:i] + S[i + 2]
        i = 0
    else:
        i += 1
    l = len(S)

print(mem-len(S))

Fixed submission:
S = []
ans = 0
for c in input():
    if len(S) > 0 and c != S[-1]:
        S.pop()
        ans += 2
    else:
        S.append(c)
print(ans)
Buggy python submission (verdict: Runtime Error):
import bisect

A, B, Q = map(int, input().split())
S = []
for i in range(A):
    S.append(int(input()))
T = []
for i in range(B):
    T.append(int(input()))
X = []
for i in range(Q):
    X.append(int(input()))

for x in X:
    sxi, txi = bisect.bisect_right(S, x), bisect.bisect_right(T, x)
    print(min(abs(s-t)+min(abs(s-x), abs(t-x))
              for s in S[sxi-1:sxi+1] for t in T[txi-1:txi+1]))


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

Buggy python submission (verdict: Runtime Error):
y, m, d = input().split("/")
if y > 2019:
    print("TBD")
elif y == 2019:
    if m > 5:
        print("TBD")
else:
    print("Heisei")

Fixed submission:
y, m, d = map(int, input().split("/"))
if y > 2019:
    print("TBD")
elif y == 2019:
    if m > 4:
        print("TBD")
    else:
        print("Heisei")
else:
    print("Heisei")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c=a+b if b%a=0 b-a
print(c)

Fixed submission:
a, b = map(int, input().split())
c = a+b if b % a == 0 else b-a
print(c)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s_list = [input() for _ in range(int(N))]

new_s = []
for i, s in enumerate(s_list):
    s = list(set(s))
    new_s.append([{char, s_list[i].count(char)} for char in s])
    
match = []
M=[i for i in range(N)]
center = int(N/2)
count = 0
if N%2==0: # 偶数の時
    for i in range(N-1):
        for i in range(center):
            match.append((M[0+i],M[-1-i]))
        M = M[:1] + M[2:] + M[1:2]
else: # 奇数の時
    for i in range(N):
        for i in range(1,center+1):
            match.append((M[i],M[-i+1]))
        M = M[1:] + M[:1] # １つずつずらす
for m in match:
    if new_s[m[0]] == new_s[m[1]]:
        count += 1
print(count)

Fixed submission:
N = int(input())
s_list = [input() for _ in range(int(N))]
import math
ok = {}
count = 0
for s in s_list:
    s = ''.join(sorted(s))
    if s in ok:
        ok[s] += 1 
    else:
        ok[s] = 1

for val in ok:
    prev = (ok[val] - 1)
    if prev != 0:
        count += math.floor(ok[val] * prev / 2)
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s_list = [input() for _ in range(N)]

new_s = []
for i, s in enumerate(s_list):
    new_s.append(set(s))

match = []
new_match = []
M=[i for i in range(N)]
center = int(N/2)

if N%2==0:
    for i in range(N-1):
        for i in range(center):
            match.append((M[0+i],M[-1-i]))
        M = M[:1] + M[2:] + M[1:2]
else:
    for i in range(N):
        for i in range(1,center+1):
            match.append((M[i],M[-i+1]))
        M = M[1:] + M[:1]
for m in match:
    if new_s[m[0]] == new_s[m[1]]:
        new_match.append(m)

a = []
count = 0
for nm in new_match:
    if [{char, s_list.count(char)}for char in list(set(s_list[nm[0]]))] == [{char, s_list.count(char)}for char in list(set(s_list[nm[1]]))]:
        count += 1
print(count)

Fixed submission:
N = int(input())
s_list = [input() for _ in range(int(N))]
import math
ok = {}
count = 0
for s in s_list:
    s = ''.join(sorted(s))
    if s in ok:
        ok[s] += 1 
    else:
        ok[s] = 1

for val in ok:
    prev = (ok[val] - 1)
    if prev != 0:
        count += math.floor(ok[val] * prev / 2)
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s_list = [input() for _ in range(N)]

from collections import Counter
new_s = []
for i, s in enumerate(s_list):
    new_s.append(Counter(sorted(list(s))))

match = []
M=[i for i in range(N)]
center = int(N/2)
count = 0
if N%2==0: # 偶数の時
    for i in range(N-1):
        for i in range(center):
            match.append((M[0+i],M[-1-i]))
        M = M[:1] + M[2:] + M[1:2]
else: # 奇数の時
    for i in range(N):
        for i in range(1,center+1):
            match.append((M[i],M[-i+1]))
        M = M[1:] + M[:1] # １つずつずらす
for m in match:
    if new_s[m[0]] == new_s[m[1]]:
        count += 1
print(count)

Fixed submission:
N = int(input())
s_list = [input() for _ in range(int(N))]
import math
ok = {}
count = 0
for s in s_list:
    s = ''.join(sorted(s))
    if s in ok:
        ok[s] += 1 
    else:
        ok[s] = 1

for val in ok:
    prev = (ok[val] - 1)
    if prev != 0:
        count += math.floor(ok[val] * prev / 2)
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
count = 0
N +=1
for i in range(1, N):
    if len(str(i)) % 2 != 0:
        count += 1
print(count)

Fixed submission:
a, b, c = map(int, input().split())
x = (a - b - c) * -1
if x < 0:
    print(0)
else:
    print(x)
Buggy python submission (verdict: Runtime Error):
count = 0
N +=1
for i in range(1, int(N)):
    if len(str(i)) % 2 != 0:
        count += 1
print(count)

Fixed submission:
N = int(input())
count = 0
N += 1
for i in range(1, N):
    if len(str(i)) % 2 != 0:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
S = int(input())
 
if 1 <= S[2:4] <= 12 and 1 <= S[0:2] <= 12:
    print('AMBIGUOUS') 
elif 1 <= S[2:4] <= 12:
    print('YYMM')
elif 1 <= S[0:2] <= 12:
    print('MMYY')
else:
    print('NA')

Fixed submission:
S = input() 
is_yymm = 1 <= int(S[2:4]) <= 12
is_mmyy = 1 <= int(S[0:2]) <= 12

if is_mmyy and is_yymm:
    print('AMBIGUOUS') 
elif is_yymm:
    print('YYMM')
elif is_mmyy:
    print('MMYY')
else:
    print('NA')

Buggy python submission (verdict: Runtime Error):
S = map(int, input())
 
if 1 <= S[2:4] <= 12 and 1 <= S[0:2] <= 12:
    print('AMBIGUOUS') 
elif 1 <= S[2:4] <= 12:
    print('YYMM')
elif 1 <= S[0:2] <= 12:
    print('MMYY')
else:
    print('NA')

Fixed submission:
S = input() 
is_yymm = 1 <= int(S[2:4]) <= 12
is_mmyy = 1 <= int(S[0:2]) <= 12

if is_mmyy and is_yymm:
    print('AMBIGUOUS') 
elif is_yymm:
    print('YYMM')
elif is_mmyy:
    print('MMYY')
else:
    print('NA')

Buggy python submission (verdict: Runtime Error):
S = input()
 
if S[2:3] > 12 and S[:2] == '00':
  print('NA')
else:
  if S[2:3] > 12:
    print('YYMM')
  elif S[:1] == '00':
    print('MMYY')
  else:
    print('AMBIGUOUS') 

Fixed submission:
S = input() 
is_yymm = 1 <= int(S[2:4]) <= 12
is_mmyy = 1 <= int(S[0:2]) <= 12

if is_mmyy and is_yymm:
    print('AMBIGUOUS') 
elif is_yymm:
    print('YYMM')
elif is_mmyy:
    print('MMYY')
else:
    print('NA')

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

if S[2:3] > 12 and S[:1] == '00':
  print('NA')
else:
  if S[2:3] > 12:
    print('YYMM')
  elif S[:1] == '00':
    print('MMYY')
  else:
    print('AMBIGUOUS') 

Fixed submission:
S = input() 
is_yymm = 1 <= int(S[2:4]) <= 12
is_mmyy = 1 <= int(S[0:2]) <= 12

if is_mmyy and is_yymm:
    print('AMBIGUOUS') 
elif is_yymm:
    print('YYMM')
elif is_mmyy:
    print('MMYY')
else:
    print('NA')
Buggy python submission (verdict: Runtime Error):
a, b, t = input().split() 
print(t / a * b)

Fixed submission:
a, b, t = input().split() 
print(int(t) // int(a) * int(b))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
cnt = []
for i in range(N):
  left = S[0:i]
  right = S[i+1:int(N)]
  cnt.append(left.count('W') + right.count('E'))
print(min(cnt))

Fixed submission:
N = int(input())
S = input()
E = S.count('E')
W = N - E
result = N
l = 0
r = E
for i in S:
  if i == 'E':
    r-=1
    result = min(result, l+r)
  elif i == 'W':
    result = min(result, l+r)
    l+=1

print(result)
Buggy python submission (verdict: Runtime Error):
a,b=int(input())
import math
print(int(math.ceil(a+b)))

Fixed submission:
a,b=map(int, input().split())
import math
print(int(math.ceil((a+b)/2)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))
cnt = {}
for i in range(N):
  if a[i] in cnt.keys():
	  cnt[a[i]] += 1
  else:
      cnt[a[i]] = 1

ans = 0
for i in cnt:
  if cnt[i] > int(i):
      ans += cnt[i] - int(i)
  elif int(i) > cnt[i]:
      ans += cnt[i]

print(ans)

Fixed submission:
from collections import Counter
N = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)

ans = 0
for i in cnt:
  if cnt[i] > int(i):
      ans += cnt[i] - int(i)
  elif int(i) > cnt[i]:
      ans += cnt[i]

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))

count = {}
for i in range(N):
  if a[i] in count.keys():
	  count[a[i]] += 1
  else:
      count[a[i]] = 1

del_cnt = 0
for num in count:
  if num < count[num]:
    del_cnt += (count[num] - num)
  elif num > count[num]:
    del_cnt += count[num]

print(del_cnt)

Fixed submission:
from collections import Counter
N = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)

ans = 0
for i in cnt:
  if cnt[i] > int(i):
      ans += cnt[i] - int(i)
  elif int(i) > cnt[i]:
      ans += cnt[i]

print(ans)
Buggy python submission (verdict: Runtime Error):
abcd=[int(i) for i in input()]
sums=sum(abcd)
dif=sums-7
op =['+', '+', '+']
if sums==7:
  pass
elif sums == 11:
  indx = abcd.index(2)
  op[indx-1] = '-'
elif 18 >= dif > 11:
  indx = abcd.index(dif/2)
  op[indx-1] = '-'
elif dif > 18:
  indxs = [i for i, x in enumerate(abcd) if x == dif/4]
  for i, x in enumerate(abcd):
    if x == dif/4:
	    op[i-1] = '-'
  
print('{}{}{}{}{}{}{}=7'.format(abcd[0], op[0], abcd[1], op[1], abcd[2], op[2], abcd[3]))


Fixed submission:
abcd=[int(i) for i in input()]
a=abcd[0]
b=abcd[1]
c=abcd[2]
d=abcd[3]

if a+b+c+d == 7:
  print('{}+{}+{}+{}=7'.format(a,b,c,d))
elif a+b+c-d == 7:
  print('{}+{}+{}-{}=7'.format(a,b,c,d))
elif a+b-c+d == 7:
  print('{}+{}-{}+{}=7'.format(a,b,c,d))
elif a-b+c+d == 7:
  print('{}-{}+{}+{}=7'.format(a,b,c,d))
elif a+b-c-d == 7:
  print('{}+{}-{}-{}=7'.format(a,b,c,d))
elif a-b-c+d == 7:
  print('{}-{}-{}+{}=7'.format(a,b,c,d))
elif a-b+c-d == 7:
  print('{}-{}+{}-{}=7'.format(a,b,c,d))
elif a-b-c-d == 7:
  print('{}-{}-{}-{}=7'.format(a,b,c,d))
else:
  pass
Buggy python submission (verdict: Runtime Error):
x = list(input())
i = 0
while i < len(x) - 2:
    if  i % 2 == 0:
        if x[i] in ["L", "U", "D"]:
            edetector = True
        else:
            edetector = False
    else:
        if x[i] in ["R", "U", "D"]:
            odetector = True
        else:
            odetector = False
    i += 1

if edetector and odetector:
    print("Yes")
else:
    print("No")


Fixed submission:
x = list(input())
i = 0
edetector = True
odetector = True
while i < len(x):
    if  i % 2 == 0:
        if not x[i] in ["R", "U", "D"]:
            edetector = False
    else:
        if not x[i] in ["L", "U", "D"]:
            odetector = False
    i += 1

if edetector and odetector:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
x = list(input())
i = 0
while i < len(x) - 1:
    if  i % 2 == 0:
        if x[i] in ["L", "U", "D"]:
            edetector = True 
        else:
            edetector = False
    else:
        if x[i] in ["R", "U", "D"]:
            odetector = True 
        else:
            odetector = False
    i += 1
if edetector and odetector:
    print("Yes")
else:
    print("No")


Fixed submission:
x = list(input())
i = 0
edetector = True
odetector = True
while i < len(x):
    if  i % 2 == 0:
        if not x[i] in ["R", "U", "D"]:
            edetector = False
    else:
        if not x[i] in ["L", "U", "D"]:
            odetector = False
    i += 1

if edetector and odetector:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    for n in range(len(plist)):
        if n != i-1:
            plist[n] -= 1

for p in plist:
    if p > 0:
        print("Yes")
    else:
        print("No")


Fixed submission:
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
x = input().split()
plist = list(range(1, int(x[0])+1))
pointdict = {}
y = []
i = 1
while i < int(x[0]) + 1:
    pointdict[i] = int(x[1])
    i += 1

l = 0
while l < int(x[2]):
    ans = input()
    y.append(ans)
    l += 1

for i in y:
    for e in plist:
        if e != int(i):
            pointdict[e] -= 1

for p in pointdict:
    if pointdict[p] > 0:
        print("Yes")
    else:
        print("No")


Fixed submission:
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Runtime Error):
x = input().split()
pointdict = {}
y = []
for i in x[0]:
    pointdict[i] = x[1]

for i in x[2]:
    ans = input()
    y.append(ans)

for i in y:
    for e in x[0]:
        if e != i:
            pointdict[e] -= 1

for p in pointdict:
    if pointdict[p] is not 0:
        print("Yes")
    else:
        print("No")


Fixed submission:
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
import math
input = list(map(int,input().split()))
A = input[0]
B = input[1]
C = input[2]
D = input[3]

betweenAandB = B-A+1

cA = math.ceil(A/C)
cB = int(B/C)
cDiv = cB - cA + 1

dA = math.ceil(A/D)
dB = int(B/D)
dDiv = dB - dA + 1

GCD = math.gcd(C,D)
LCM = C*D/GCD

lcmA = math.ceil(A/LCM)
lcmB = int(B/LCM)
lcmDiv = max(lcmA, lcmB) - min(lcmA, lcmB) + 1

ans = betweenAandB - cDiv - dDiv + lcmDiv
print(ans)


Fixed submission:
N = input()
pre = 10
count = 0
for x in N:
    if x == pre:
        print("Bad")
        count = 1
        break
    pre = x
if count == 0:
    print("Good")
Buggy python submission (verdict: Runtime Error):
import math
input = list(map(int,input().split()))
A = input[0]
B = input[1]
C = input[2]
D = input[3]

betweenAandB = B-A+1

cA = math.ceil(A/C)
cB = int(B/C)
cDiv = cB - cA + 1

dA = math.ceil(A/D)
dB = int(B/D)
dDiv = dB - dA + 1

GCD = math.gcd(C,D)
LCM = C*D/GCD

lcmA = math.ceil(A/LCM)
lcmB = int(B/LCM)
lcmDiv = max(lcmA, lcmB) - min(lcmA, lcmB) + 1

ans = betweenAandB - cDiv - dDiv + lcmDiv
print(ans)


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

def gcd(x, y):
    while y != 0:
        (x, y) = (y, x % y)
    return x

betweenAandB = B-A+1

cA = (A-1)//C
cB = B//C
cDiv = cB - cA

dA = (A-1)//D
dB = B//D
dDiv = dB - dA

GCD = gcd(C,D)
LCM = C*D//GCD

lcmA = (A-1)//LCM
lcmB = B//LCM
lcmDiv = lcmB - lcmA

ans = betweenAandB - cDiv - dDiv + lcmDiv
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
input = list(map(int,input().split()))
A = input[0]
B = input[1]
C = input[2]
D = input[3]

betweenAandB = B-A+1

cA = math.ceil(A/C)
cB = int(B/C)
cDiv = cB - cA + 1

dA = math.ceil(A/D)
dB = int(B/D)
dDiv = dB - dA + 1

GCD = math.gcd(C,D)
LCM = C*D/GCD

lcmA = math.ceil(A/LCM)
lcmB = int(B/LCM)
lcmDiv = max(lcmA, lcmB) - min(lcmA, lcmB) + 1

ans = betweenAandB - cDiv - dDiv + lcmDiv
print(betweenAandB)
print(cDiv)
print(dDiv)
print(lcmDiv)
print(ans)


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

def gcd(x, y):
    while y != 0:
        (x, y) = (y, x % y)
    return x

betweenAandB = B-A+1

cA = (A-1)//C
cB = B//C
cDiv = cB - cA

dA = (A-1)//D
dB = B//D
dDiv = dB - dA

GCD = gcd(C,D)
LCM = C*D//GCD

lcmA = (A-1)//LCM
lcmB = B//LCM
lcmDiv = lcmB - lcmA

ans = betweenAandB - cDiv - dDiv + lcmDiv
print(ans)
Buggy python submission (verdict: Runtime Error):
whether = input()
if whether == Sunny:
  print('Cloudy')
elif whether == Cloudy:
  print('Rainy')
elif:
  print('Sunny')

Fixed submission:
whether = input()
if whether == 'Sunny':
    print('Cloudy')
elif whether == 'Cloudy':
    print('Rainy')
elif whether == 'Rainy':
    print('Sunny')

Buggy python submission (verdict: Runtime Error):
whether = input()
if whether == Sunny:
  print('Cloudy')
elif whether == Cloudy:
  print('Rainy')
elif:
  print(Sunny)

Fixed submission:
whether = input()
if whether == 'Sunny':
    print('Cloudy')
elif whether == 'Cloudy':
    print('Rainy')
elif whether == 'Rainy':
    print('Sunny')

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):
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):
S = input()
if S == "Sunny":
  print("Cloudy")
else if S == "Cloudy":
  print("Rainy")
else if S == "Rainy":
  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):
S = list(map(int, input().split()))
Sodd = S.Slice[::2]
Seven = S.Slice[1::2]
if "L" in Sodd:
  print("No")
elif "R" in Seven:
  print("No")
else:
  Print("Yes")

Fixed submission:
S = list(input())

Sodd = S[::2]
Seven = S[1::2]

if "L" in Sodd:
  print("No")
elif "R" in Seven:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
s = list(input())
def easy_step(s) :
    s_even = s[::2]
    s_odd = [1::2]
    if ("L" in s_odd) or ("R" in s_even) :
        print("No")
    else :
        print("Yes")
easy_step(s)

Fixed submission:
def easy_step(s) :
    s_odd = s[::2]
    s_even = s[1::2]
    if ("L" in s_odd) or ("R" in s_even) :
        print("No")
    else :
        print("Yes")
s = list(input())
easy_step(s)

Buggy python submission (verdict: Runtime Error):
s = list(input())
def easy_step(s) :
    s_odd = s[::2]
    s_even = [1::2]
    if ("L" in s_odd) or ("R" in s_even) :
        print("No")
    else :
        print("Yes")
easy_step(s)

Fixed submission:
def easy_step(s) :
    s_odd = s[::2]
    s_even = s[1::2]
    if ("L" in s_odd) or ("R" in s_even) :
        print("No")
    else :
        print("Yes")
s = list(input())
easy_step(s)
Buggy python submission (verdict: Runtime Error):
#Sunny
#Cloudy
#Rainy

tennki = input()
if tennki="Sunny":print("Cloudy")
elif tennki="Cloudy":print("Rainy")
else print("Sunny")


Fixed submission:
#一日ごとに晴れ(Sunny)、くもり(Cloudy)、雨(Rainy)

tennki = input()
if tennki=="Sunny":print("Cloudy")
elif tennki=="Cloudy":print("Rainy")
else:print("Sunny")
Buggy python submission (verdict: Runtime Error):
input_a = input().split()
kazu = int(input_a[0]) + 1
suuji_kosuu = int(input_a[1])

input_b = input().split()

for i in range(kazu,10000):
    t = 0
    for j in range(suuji_kosuu):
        if input_b[j] in str(i):
            break
        else:
            t = t+1
            continue
    if t == suuji_kosuu:
        print(i)
        break

Fixed submission:
# coding: utf-8
# Your code here!

input_list = input().split()
sort_list = (int(input_list[0]),int(input_list[1]),int(input_list[2]))

tuple_a = (5,5,7)
tuple_b = (5,7,5)
tuple_c = (7,5,5)

if sort_list==tuple_a or sort_list==tuple_b or sort_list==tuple_c:
    print("YES")
else:
    print("NO")