Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum(map(int, N))
print(["No", "Yes"][int(N)%S==0])

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum([int(x) for x in N])
print("Yes" if int(N)%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum(int(x) for x in N)
N = int(N)
print("Yes" if N%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum(int(x) for x in N)
print("Yes" if int(N)%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys
input = sys.stdin.readline

N = input()
S = sum(int(x) for x in N)
print("Yes" if int(N)%S==0 else "No")

Fixed submission:
# coding: utf-8
N= input()
S = sum(map(int, N))
print("Yes" if int(N)%S==0 else "No")
Buggy python submission (verdict: Runtime Error):
# 写経

n = int(input())
s = input()


cnt = s[1:].count("E")
ans = cnt
for i in range(1, n):
    if s[i-1] == "W":
        cnt_e += 1
    if s[i] == "E":
        cnt_e -= 1
    ans = min(ans, cnt)


print(ans)


Fixed submission:
# 写経

n = int(input())
s = input()


cnt = s[1:].count("E")
ans = cnt
for i in range(1, n):
    if s[i-1] == "W":
        cnt += 1
    if s[i] == "E":
        cnt -= 1
    ans = min(ans, cnt)


print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter


n = int(input())
s = "z" + input() + "z"


ans = float("INF")
for i in range(1, n+1):
    leader = s[i]
    w = list(s[1:i])
    e = list(s[i+1::])
    cnt_w2e = Counter(w)
    cnt_e2w = Counter(e)
    change = cnt_w2e["W"] + cnt_e2w["E"]
    ans = min(change, ans)
print(ans)


Fixed submission:
# 写経

n = int(input())
s = input()


cnt = s[1:].count("E")
ans = cnt
for i in range(1, n):
    if s[i-1] == "W":
        cnt += 1
    if s[i] == "E":
        cnt -= 1
    ans = min(ans, cnt)


print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
k = int(input())


ans_set = set()
for i in range(len(s)):
    c = s[i]
    ans_set.add(c)
    for j in range(i + 1, len(s)):
        c += s[j]
        ans_set.add(c)


ans_lst = list(ans_set)
ans_lst.sort()
ans = ans_lst[k-1]


print(ans)

Fixed submission:
s = input()
k = int(input())


ans_set = set()
for i in range(len(s)):
    c = s[i]
    ans_set.add(c)
    for j in range(i + 1, len(s)):
        c += s[j]
        if len(c) > k:
            break
        ans_set.add(c)


ans_lst = list(ans_set)
ans_lst.sort()
ans = ans_lst[k-1]


print(ans)
Buggy python submission (verdict: Runtime Error):

A, B, C, D = map(int, input().split())
print("Balanced" if A+B == C+D else "Left" if 

Fixed submission:
#coding: utf-8
A, B, C, D = map(int, input().split())
print("Balanced" if A+B == C+D else ["Left","Right"][A+B < C+D])
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
N = int(input())
L0 = 2
L1 = 1
for _ in range(N-1):
    L = L0 + L1
    L0 = L1
    L1 = L
print(L)

Fixed submission:
# coding: utf-8
N = int(input())
L0 = 2
L1 = 1

if N == 1:
    print(L1)
else:
    for _ in range(N-1):
        L = L0 + L1
        L0 = L1
        L1 = L
    print(L)
Buggy python submission (verdict: Time Limit Exceeded):
# def binary_search(lst):
#     pass


import bisect


n = int(input())
lst_A = list(map(int, input().split()))
lst_B = list(map(int, input().split()))
lst_C = list(map(int, input().split()))
lst_A.sort()
lst_B.sort()
lst_C.sort()


ans = 0
for b in lst_B:
    ia = bisect.bisect_left(lst_A, b)
    ic = bisect.bisect_right(lst_C, b)
    na = len(lst_A[:ia])
    nc = len(lst_C[ic:])
    ans += na * nc


print(ans)

Fixed submission:
import bisect


n = int(input())
lst_A = list(map(int, input().split()))
lst_B = list(map(int, input().split()))
lst_C = list(map(int, input().split()))
lst_A.sort()
lst_B.sort()
lst_C.sort()


ans = 0
for b in lst_B:
    na = bisect.bisect_left(lst_A, b)
    nc = n - bisect.bisect_right(lst_C, b)
    ans += na * nc


print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from itertools import product


n = int(input())
lst_A = list(map(int, input().split()))
lst_B = list(map(int, input().split()))
lst_C = list(map(int, input().split()))


lst_ABC = list(product(lst_A, lst_B, lst_C))
ans = sum(1 for a, b, c in lst_ABC if a < b < c)
print(ans)

Fixed submission:
import bisect


n = int(input())
lst_A = list(map(int, input().split()))
lst_B = list(map(int, input().split()))
lst_C = list(map(int, input().split()))
lst_A.sort()
lst_B.sort()
lst_C.sort()


ans = 0
for b in lst_B:
    na = bisect.bisect_left(lst_A, b)
    nc = n - bisect.bisect_right(lst_C, b)
    ans += na * nc


print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5 + 2)
lst_a.sort()


for a in lst_a:
    lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 != 0)


print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lst_number = [int(input()) for _ in range(N)]
set_number = set(lst_number)
cnt_number = Counter(lst_number)
ans = 0


for key in set_number:
    if cnt_number[key] % 2 == 1:
        ans += 1


print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5 + 2)
lst_a.sort()


for a in lst_a:
    lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 == 1)


print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lst_number = [int(input()) for _ in range(N)]
set_number = set(lst_number)
cnt_number = Counter(lst_number)
ans = 0


for key in set_number:
    if cnt_number[key] % 2 == 1:
        ans += 1


print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_a = [int(input()) for _ in range(N)]
lst_ans = [0] * (10**5)
lst_a.sort()


for a in lst_a:
    lst_ans[a] += 1
ans = sum(1 for i in lst_ans if i % 2 == 1)


print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lst_number = [int(input()) for _ in range(N)]
set_number = set(lst_number)
cnt_number = Counter(lst_number)
ans = 0


for key in set_number:
    if cnt_number[key] % 2 == 1:
        ans += 1


print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_A = list(map(int, input().split()))
lst_rod_num = [0] * (N + 1)
a, b = 0, 0
lst_ans = []


for a in lst_A:
    lst_rod_num[a] += 1


cnt = 0
for i in range(N, -1, -1):
    if cnt == 2:
        a = lst_ans[0]
        b = lst_ans[1]
        break
    if lst_rod_num[i] >= 2:
        lst_ans.append(i)
        cnt += 1
ans = a * b


print(ans)

Fixed submission:
N = int(input())
lst_A = list(map(int, input().split()))
lst_A.sort(reverse=True)
cur_a = -1
lst_ans = []


for i, a in enumerate(lst_A):
    if cur_a == a:
        lst_ans.append(a)
        cur_a = -1
        if len(lst_ans) == 2:
            break
    else:
        cur_a = a


ans = lst_ans[0] * lst_ans[1] if len(lst_ans) else 0
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_A = list(map(int, input().split()))
lst_rod_num = [0] * (N + 1)
a, b = 0, 0
lst_ans = []


for a in lst_A:
    lst_rod_num[a] += 1


cnt = 0
for i in range(N - 1, -1, -1):
    if lst_rod_num[i] >= 2:
        lst_ans.append(i)
        cnt += 1
    if cnt == 2:
        a = lst_ans[0]
        b = lst_ans[1]
        break
ans = a * b


print(ans)

Fixed submission:
N = int(input())
lst_A = list(map(int, input().split()))
lst_A.sort(reverse=True)
cur_a = -1
lst_ans = []


for i, a in enumerate(lst_A):
    if cur_a == a:
        lst_ans.append(a)
        cur_a = -1
        if len(lst_ans) == 2:
            break
    else:
        cur_a = a


ans = lst_ans[0] * lst_ans[1] if len(lst_ans) else 0
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
lst_A = list(map(int, input().split()))
lst_rod_num = [0] * (N + 1)
a, b = 0, 0
lst_ans = []


for a in lst_A:
    lst_rod_num[a] += 1


cnt = 0
for i in range(N, -1, -1):
    if lst_rod_num[i] >= 2:
        lst_ans.append(i)
        cnt += 1
    if cnt == 2:
        a = lst_ans[0]
        b = lst_ans[1]
        break
ans = a * b


print(ans)

Fixed submission:
N = int(input())
lst_A = list(map(int, input().split()))
lst_A.sort(reverse=True)
cur_a = -1
lst_ans = []


for i, a in enumerate(lst_A):
    if cur_a == a:
        lst_ans.append(a)
        cur_a = -1
        if len(lst_ans) == 2:
            break
    else:
        cur_a = a


ans = lst_ans[0] * lst_ans[1] if len(lst_ans) else 0
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst_a = list(map(int, input().split()))
total = sum(lst_a)
ans = float("INF")


for i in range(N - 1):
    x = sum(lst_a[:i+1])
    y = total - x
    ans = min(ans, abs(x - y))


print(ans)

Fixed submission:
N = int(input())
lst_a = list(map(int, input().split()))
total = sum(lst_a)
x = 0
ans = float("INF")


for i in range(N - 1):
    x += lst_a[i]
    y = total - x
    ans = min(ans, abs(x - y))


print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst_a = list(map(int, input().split()))
ans = float("INF")


for i in range(N - 1):
    x = sum(lst_a[:i+1])
    y = sum(lst_a[i+1:])
    ans = min(ans, abs(x - y))


print(ans)

Fixed submission:
N = int(input())
lst_a = list(map(int, input().split()))
total = sum(lst_a)
x = 0
ans = float("INF")


for i in range(N - 1):
    x += lst_a[i]
    y = total - x
    ans = min(ans, abs(x - y))


print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst_a = list(map(int, input().split()))
ans = float("INF")


for i in range(N - 1):
    x = sum(lst_a[:i+1])
    y = sum(lst_a[i+1:])
    ans = min(ans, abs(x - y))


print(ans)

Fixed submission:
N = int(input())
lst_a = list(map(int, input().split()))
total = sum(lst_a)
x = 0
ans = float("INF")


for i in range(N - 1):
    x += lst_a[i]
    y = total - x
    ans = min(ans, abs(x - y))


print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations

N, P = map(int, input().split())
lst_A = list(map(int, input().split()))

ans = 0
for i in range(N+1):
    combi = list(combinations(lst_A, i))
    # print(combi)
    for tpl in combi:
        mod = sum(tpl)%2
        if mod == P:
            ans += 1

print(ans)


Fixed submission:
N, P = map(int, input().split())
lst_A = list(map(int, input().split()))
lst_odd_even = [x%2 for x in lst_A]

if 1 in lst_odd_even:
    ans = 2 ** (N-1)
else:
    if P == 0:
        ans = 2 ** N
    else:
        ans = 0

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# https://atcoder.jp/contests/abc063/submissions/5323989 参照

def func(idx, points, N, lst_s, dp):
    # base case
    if idx == N:
        if points % 10 == 0:
            return 0
        else:
            return points
    
    # check memo
    ref = dp.get((idx, points))
    if ref:
        return dp[(idx, points)]
    
    # recursive
    f1 = func(idx + 1, points, N, lst_s, dp)
    f2 = func(idx + 1, points + lst_s[idx], N, lst_s, dp)
    ret = max(f1, f2)
    dp[(idx, points)] = ret

    return ret


N = int(input())
lst_s = [int(input()) for _ in range(N)]
dp = {}
ans = func(0, 0, N, lst_s, dp)
print(ans)

Fixed submission:
N = int(input())
lst_s = [int(input()) for _ in range(N)]
lst_s.sort()
max_grade = sum(lst_s)
ans = 0


if max_grade % 10 != 0:
    ans = max_grade
else:
    for s in lst_s:
        tmp_grade = max_grade - s
        if tmp_grade % 10 != 0:
            ans = max(ans, tmp_grade)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# https://atcoder.jp/contests/abc063/submissions/5323989 参照

def func(idx, points, N, lst_s, dp):
    # base case
    if idx == N:
        if points % 10 == 0:
            return 0
        else:
            return points
    
    # check memo
    if dp.get((idx, points)):
        return dp[(idx, points)]
    
    # recursive
    ret = max(
        func(idx = idx + 1, points = points, N = N, lst_s = lst_s, dp = dp), 
        func(idx = idx + 1, points = points + lst_s[idx], N = N, lst_s = lst_s, dp = dp)
        )
    dp[(idx, points)] = ret

    return ret


N = int(input())
lst_s = [int(input()) for _ in range(N)]
dp = {}
ans = func(0, 0, N, lst_s, dp)
print(ans)

Fixed submission:
N = int(input())
lst_s = [int(input()) for _ in range(N)]
lst_s.sort()
max_grade = sum(lst_s)
ans = 0


if max_grade % 10 != 0:
    ans = max_grade
else:
    for s in lst_s:
        tmp_grade = max_grade - s
        if tmp_grade % 10 != 0:
            ans = max(ans, tmp_grade)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# https://atcoder.jp/contests/abc063/submissions/5323989 参照

def func(idx, points, N, lst_s, dp):
    # base case
    if idx == N:
        if points % 10 == 0:
            return 0
        else:
            return points
    
    # check memo
    if dp.get((idx, points)):
        return dp[(idx, points)]
    
    # recursive
    f1 = func(idx + 1, points, N, lst_s, dp)
    f2 = func(idx + 1, points + lst_s[idx], N, lst_s, dp)
    ret = max(f1, f2)
    dp[(idx, points)] = ret

    return ret


N = int(input())
lst_s = [int(input()) for _ in range(N)]
dp = {}
ans = func(0, 0, N, lst_s, dp)
print(ans)

Fixed submission:
N = int(input())
lst_s = [int(input()) for _ in range(N)]
lst_s.sort()
max_grade = sum(lst_s)
ans = 0


if max_grade % 10 != 0:
    ans = max_grade
else:
    for s in lst_s:
        tmp_grade = max_grade - s
        if tmp_grade % 10 != 0:
            ans = max(ans, tmp_grade)

print(ans)
Buggy python submission (verdict: Runtime Error):
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)


if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = pow(2, N//2, mod)
    else:
        ans = 0
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = pow(2, N//2, mod)

print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)
ans = 0

if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = pow(2, N//2, mod)
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = pow(2, N//2, mod)


print(ans)

Buggy python submission (verdict: Runtime Error):
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)


if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = 2 ** (N // 2) % mod
    else:
        ans = 0
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = 2 ** (N // 2) % mod

print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)
ans = 0

if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = pow(2, N//2, mod)
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = pow(2, N//2, mod)


print(ans)

Buggy python submission (verdict: Runtime Error):
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)


if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = pow(2, N//2) % mod
    else:
        ans = 0
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = pow(2, N//2) % mod

print(ans)

Fixed submission:
from collections import Counter


N = int(input())
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)
ans = 0

if N % 2:
    if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
        ans = pow(2, N//2, mod)
else:
    if all(countA[i] == 2 for i in range(1, N, 2)):
        ans = pow(2, N//2, mod)


print(ans)
Buggy python submission (verdict: Runtime Error):
 coding: utf-8
H, W = map(int, input().split())

for _ in range(H):
    l = input()
    print(l, l, sep="\n")


Fixed submission:
# coding: utf-8
H, W = map(int, input().split())

for _ in range(H):
    l = input()
    print(l)
    print(l)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
a, b, x = map(int, input().split())
cnt = 0
n = b - a + 1
for i in range(n):
    if (a+i)%x==0:
        cnt += 1
print(cnt)

Fixed submission:
# coding: utf-8
a, b, x = map(int, input().split())
f_a = (a-1)//x + 1 if a>=1 else 0
f_b = b//x + 1
print(f_b - f_a)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
W, H, N = map(int, input().split())
min_x, max_x = 0, W
min_y, max_y = 0, H

for i in range(N):
    x, y, a = map(int, input().split())
    if a == 1:
        if max_x <= x:
            min_x, max_x = 0, 0
        elif min_x <= x:
            min_x = x
    elif a == 2:
        if min_x >= x:
            min_x, max_x = 0, 0
        elif x <= max_x:
            max_x = x
    elif a == 3:
        if max_y <= y:
            min_y, max_y = 0, 0
        elif min_y <= y:
            min_y = y
    else:
        if y <= min_y:
            min_y, max_y = 0, 0
        elif y <= max_y:
            max_y = T
diff_x = max_x - min_x
diff_y = max_y - min_y
print(diff_x * diff_y)


Fixed submission:
# coding: utf-8
W, H, N = map(int, input().split())
min_x, max_x = 0, W
min_y, max_y = 0, H

for i in range(N):
    x, y, a = map(int, input().split())
    if a == 1:
        if max_x <= x:
            min_x, max_x = 0, 0
        elif min_x <= x:
            min_x = x
    elif a == 2:
        if min_x >= x:
            min_x, max_x = 0, 0
        elif x <= max_x:
            max_x = x
    elif a == 3:
        if max_y <= y:
            min_y, max_y = 0, 0
        elif min_y <= y:
            min_y = y
    else:
        if y <= min_y:
            min_y, max_y = 0, 0
        elif y <= max_y:
            max_y = y
diff_x = max_x - min_x
diff_y = max_y - min_y
print(diff_x * diff_y)
Buggy python submission (verdict: Runtime Error):
X = input()
cnt_S, cnt_T = 0, 0

for c in range(X):
    if c == "S":
        cnt_S += 1
    else:
        if cnt_S:
            cnt_S -= 1
        else:
            cnt_T += 1
print(cnt_S, cnt_T)

Fixed submission:
# coding: utf-8
X = input()
tmp = " "
cnt = 0
for x in X:
    if x == "S":
        tmp += x
        cnt += 1
    elif x == "T" and tmp[-1]=="S":
            cnt -= 1
            tmp = tmp[0:len(tmp)-1]
    else:
        tmp += x
        cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
n_S, n_T = 0, 0

if c in input():
    if c == "S":
        n_S += 1
    else:
        if n_S:
            n_S -= 1
        else:
            T += 1
print(n_S + n_T)


Fixed submission:
# coding: utf-8
X = input()
tmp = " "
cnt = 0
for x in X:
    if x == "S":
        tmp += x
        cnt += 1
    elif x == "T" and tmp[-1]=="S":
            cnt -= 1
            tmp = tmp[0:len(tmp)-1]
    else:
        tmp += x
        cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
X = input()
tmp = ""
for x in X:
    tmp += x
    tmp = tmp.replace("ST","")
print(len(tmp))

Fixed submission:
# coding: utf-8
X = input()
tmp = " "
cnt = 0
for x in X:
    if x == "S":
        tmp += x
        cnt += 1
    elif x == "T" and tmp[-1]=="S":
            cnt -= 1
            tmp = tmp[0:len(tmp)-1]
    else:
        tmp += x
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
#coding: utf-8
s = input()
print(["NO", "YES"][s.count("5")==2 * s.count("7")==1]


Fixed submission:
#coding: utf-8
li = list(map(int, input().split()))
print("YES" if li.count(5)==2 and li.count(7)==1 else "NO")
Buggy python submission (verdict: Runtime Error):
if 500 * k >= x:
  print('Yse')
else:
  print('No')

Fixed submission:
k, x = map(int,input().split())
if k*500 >= x:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s, t = input().split
print(t + s)

Fixed submission:
s, t = input().split()
print(t + s)
Buggy python submission (verdict: Runtime Error):
k,x=map(int,input().split())
print([num in range(x-k+1,x)])

Fixed submission:
k,x=map(int,input().split())
print(*[num for num in range(x-k+1,x+k)])
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(max(0,c-a+b)

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

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

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

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

Fixed submission:
a,b,c=sorted(map(int,input().split()))
print(c-a)
Buggy python submission (verdict: Runtime Error):
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i]-m.count(l[i]) for i in range(len(l))))))

Fixed submission:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
b, c = map(int, input().split())
# 文字列の入力
s = input()
# 出力
print("{} {}".format(a+b+c, s))

Fixed submission:
s=input()
print(s[0]+str((len(s)-2))+s[-1])

Buggy python submission (verdict: Runtime Error):
s=Input()
print(s[0]+str(len(s)-2)+s[-1])

Fixed submission:
s=input()
print(s[0]+str((len(s)-2))+s[-1])
Buggy python submission (verdict: Runtime Error):
list=sorted[input()]
print(*list,sep="")

Fixed submission:
n,l=map(int,input().split())
s=sorted([input() for i in range(n)])
print("".join(s))
Buggy python submission (verdict: Runtime Error):
import sys
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

cur = a[0]
for x in a[1:]:
    g = math.gcd(cur, x)
    if (cur // 2) % g != (x // 2) % g:
        print(0)
        sys.exit(0)
    else:
        cur = cur // g * x
    if cur > m * 2:
        print(0)
        sys.exit(0)

print((m + cur // 2) // cur)


Fixed submission:
import sys

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

n, m = map(int, input().split())
a = list(map(int, input().split()))

cur = a[0]
for x in a[1:]:
    g = gcd(cur, x)
    if (cur // 2) % g != (x // 2) % g:
        print(0)
        sys.exit(0)
    else:
        cur = cur // g * x
    if cur > m * 2:
        print(0)
        sys.exit(0)

print((m + cur // 2) // cur)
Buggy python submission (verdict: Runtime Error):
import sys

a = sys.argv[1]
b = sys.argv[2]
c = sys.argv[3]

d = a + b +c

if d < 22;
	print("win")
else;
	print("bust")

Fixed submission:
a, b, c= map(int, input().split())
if a+b+c <= 21:
  print("win")
else:
  print("bust")