Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02761 (python)

Fixed submission:
import sys
N,M = map(int, input().split())
num = ['B'] * N
for _ in range(M):
    s,c = map(int, input().split())
    if num[s-1] != 'B' and num[s-1] != c:
        num.append('No')
    else:
        num[s-1] = c

if N == 1 and num[0] == 'B':
    num[0] = 0
    
if N > 1 and num[0] == 'B':
    num[0] = 1

if 'No' in num:
    print(-1)
    sys.exit()
elif N > 1 and num[0] == 0:
    print(-1)
    sys.exit()
    
for i in range(1,N):
    if num[i] == 'B':
        num[i] = 0

for i in range(N):
    num[i] = str(num[i])

print(''.join(num))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
num = ['a'] * N
for i in range(M):
    s, c = map(int, input().split())
    if num[s-1] == 'a':
        num[s-1] = str(c)
    elif num[s-1] == str(c):
        continue
    else:
        num.append('B')

if M == 0 and N != 1:
    num[0] = 1
elif M == 0 and N == 1:
    num[0] = 0
elif num[0] == 'a' and M != 0:
    num[0] = '1'

for i in range(1,N):
    if num[i] == 'a':
        num[i] = '0'

if num[-1] == 'B':
    print(-1)
elif N == 1:
    print(''.join(num) if num[-1] != 'B' else -1)
elif num[0] == '0':
    print(-1)
else:
    print(''.join(num) if num[-1] != 'B' else -1)

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
num = ['a'] * N
for i in range(M):
    s, c = map(int, input().split())
    if num[s-1] == 'a':
        num[s-1] = str(c)
    elif num[s-1] == str(c):
        continue
    else:
        num.append('B')

if M == 0 and N != 1:
    num[0] = 1
elif M == 0 and N == 1:
    num[0] = 0
if num[0] == 'a' and M != 0:
    num[0] = '1'

for i in range(1,N):
    if num[i] == 'a':
        num[i] = '0'

if num[-1] == 'B':
    print(-1)
elif N == 1:
    print(''.join(num) if num[-1] != 'B' else -1)
elif num[0] == '0':
    print(-1)
else:
    print(''.join(num) if num[-1] != 'B' else -1)
Problem p02783 (python)

Fixed submission:
h,a = map(int, input().split())
counter = 0

while h > 0:
    h -= a
    counter += 1
    
print(counter)

Buggy submission (verdict: Runtime Error):
h = int(input())
a = int(input())
counter = 0

while h > 0:
    h -= a
    counter += 1
    
print(counter)
Problem p02791 (python)

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

counter = 0
min_num = 1000000

for i in range(N):
    if lst_p[i] <= min_num:
        counter += 1
        min_num = lst_p[i]
    else:
        continue
print(counter)

Buggy submission (verdict: Runtime Error):
N = int(input())
p = 0
minnum = 200001
counter = 0

for i in range(N):
  p = int(input())
  if p < minnum:
    counter += 1
    minnum = p

print(counter)
Problem p02934 (python)

Fixed submission:
n = input()
lst_A = map(int, input().split())
lst_A_inv = [1/x for x in lst_A]
print(1/sum(lst_A_inv))

Buggy submission (verdict: Runtime Error):
N = int(input())
lst_A = [1/int(input()) for i in range(N)]
#print('lst_A:', lst_A)
print(1/sum(lst_A))

Buggy submission (verdict: Runtime Error):
#Resistors in Parallel
N = int(input())
lst_A = [1/int(input()) for i in range(N)]

print(1/sum(lst_A))

Buggy submission (verdict: Runtime Error):
N = input()
lst_A = [1/int(input()) for i in range(N)]

print(1/sum(lst_A))
Problem p03238 (python)

Fixed submission:
N = input()
if N == '1':
    print('Hello World')
else:
    A,B = [int(input()) for _ in range(2)]
    print(A+B)

Buggy submission (verdict: Runtime Error):
N = input()
if N == '1':
    print('Hello World')
A,B = [int(input()) for _ in range(2)]
print(A+B)
Problem p03555 (python)

Fixed submission:
C1 = input()
C2 = input()
C1_r = C1[2] + C1[1] + C1[0]
print('YES' if C1_r == C2 else 'NO')

Buggy submission (verdict: Runtime Error):
C1 = input()
C2 = input()
C1_r = C1[2] + C1[1] + C1[0]
C1_r
print('YES' iC1 = input()

Buggy submission (verdict: Runtime Error):
C1,C2 = input().split()
C1_reverse = C1[2] + C1[1] + C[0]
print('YES' if C1_reverse == C2 else 'NO')
Problem p02843 (python)

Fixed submission:
import itertools
import sys
X = int(input())
A = [i for i in range(100, 106)]
num = int(X/100)
if X < 100: print(0)
elif X > 105*num: print(0)
else:
    for comb in itertools.combinations_with_replacement(A, num):
        if X == sum(comb):
            print(1)
            sys.exit()
    print(0)

Buggy submission (verdict: Runtime Error):
import itertools
X = int(input())
A = [i for i in range(100, 106)]
num = int(X/100)
if X < 100: print(0)
elif X > 105*num: print(0)
else:
    for comb in itertools.combinations_with_replacement(A, num):
        if X == sum(comb):
            print(1)
            sys.exit()
    print(0)
Problem p02911 (python)

Fixed submission:
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]

victory_cnt = [0] * N 

for i in range(Q):
    victory_cnt[A[i]-1] += 1

for v in victory_cnt:
    if (Q-v) >= K:
        print('No')
    else:
        print('Yes')

Buggy submission (verdict: Runtime Error):
import numpy as np


N, K, Q = map(int, input().split())
A = np.array([int(input()) for i in range(Q)])

initial_arr = np.ones(N) * K

for i in range(Q):
    tmp = np.ones(N)
    tmp[A[i]-1] = 0
    initial_arr = initial_arr - tmp

for i in initial_arr:
    if i > 0:
        print('Yes')
    else:
        print('No')
Problem p02923 (python)

Fixed submission:
import numpy as np


N = int(input())
A = np.array(input().split(), dtype=np.int32)

left_idx = np.arange(N)
# 自身が左以下ならば0に
left_idx[1:][A[:-1] >= A[1:]] = 0
np.maximum.accumulate(left_idx, out=left_idx)

answer = (np.arange(N) - left_idx).max()
print(answer)

Buggy submission (verdict: Runtime Error):
import numpy as np


N = int(input())
H_list = list(map(int, input().split()))

res_list = []

for i in range(N-1):
    num = i
    pos = (N-1) - num

    if H_list[num] >= H_list[num+1]:
        res_list.append(1)
    else:
        res_list.append(0)

res_arr = np.array(res_list)
offset = 1
res_diff = res_arr[1:] - res_arr[:-1]
pos1to0 = np.where(res_diff == -1)[0] + offset
pos0to1 = np.where(res_diff == +1)[0] + offset
tarr = pos1to0 - pos0to1
if len(tarr) != 0:
    if res_arr[-1] == 0:
        pos0to1 = np.append([0], pos0to1)
        len11 = tarr.max()
    else:
        len11 = pos0to1[0] - pos1to0[0] + 1
        
    print(len11)
else:
    print(0)

Buggy submission (verdict: Runtime Error):
import numpy as np


N = int(input())
H_list = list(map(int, input().split()))

res_list = []

for i in reversed(range(N-1)):
    tmp_res = 0
    num = i
    pos = (N-1) - num

    if H_list[num] >= H_list[num+1]:
        res_list.append(1)
    else:
        res_list.append(0)

res_arr = np.array(res_list)
offset = 1
res_diff = res_arr[1:] - res_arr[:-1]
pos1to0 = np.where(res_diff == -1)[0] + offset
pos0to1 = np.where(res_diff == +1)[0] + offset
pos0to1 = np.append([0], pos0to1)
tarr = pos1to0 - pos0to1
if len(tarr) != 0:
    len11 = tarr.max()
    print(len11)
else:
    print(0)
Problem p02953 (python)

Fixed submission:
import sys
N = int(input())
H = list(map(int, input().split()))
if N == 1:
    print('Yes')
else:
    for i in reversed(range(N-1)):
        if H[i] -H[i+1] > 1: print('No');sys.exit()
        elif H[i] - H[i+1] == 1: H[i] -= 1
        else: continue
    print('Yes')

Buggy submission (verdict: Runtime Error):
import sys
N = int(input())
H = list(map(int, input().split()))
if N == 1:
    print('Yes')
else:
    for i in range(1, N):
        if H[i] -H[i+1] > 1: print('No');sys.exit()
        elif H[i] - H[i+1] == 1: H[i] -= 1
        else: continue
    print('Yes')
Problem p02993 (python)

Fixed submission:
from sys import exit

S = input()

for i in range(len(S)):
    if i > 0:
        if S[i-1] == S[i]:
            print('Bad')
            exit()

print('Good')

Buggy submission (verdict: Runtime Error):
from sys import exit

S = input()

for i in range(len(S)+1):
    if i > 1:
        if S[i-1] == S[i]:
            print('Bad')
            exit()

print('Good')
Problem p03324 (python)

Fixed submission:
D, N = map(int, input().split())
if N == 100:
    N += 1
print(N * 100**D)

Buggy submission (verdict: Runtime Error):
import sys


D, N = map(int, input().split())

cnt = 0
if D == 0:
    print(N)
else:
    for n in range(1, 10e10):
        val = n/100**D
        if val.is_integer():
            cnt += 1
            if cnt == N:
                print(n)
                sys.exit()
Problem p03407 (python)

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

if A+B >= C:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
A, B, C = map(int, input())

if A+B >= C:
    print('Yes')
else:
    print('No')
Problem p03433 (python)

Fixed submission:
n = int(input())
a = int(input())

if n % 500 <= a:
    print("Yes")
else:
    print("No")

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

if N % 500 <= A:
    print("Yes")
else:
    print("No")
Problem p03544 (python)

Fixed submission:
N = int(input())
L_forward = 2
L_backward = 1
if N == 1:
    print(L_backward)
else:
    for i in range(2, N+1):
        L = L_forward + L_backward
        L_forward = L_backward
        L_backward = L
    print(L)

Buggy submission (verdict: Runtime Error):
N = int(input())
L_forward = 2
L_backward = 1
for i in range(2, N+1):
    L = L_forward + L_backward
    L_forward = L_backward
    L_backward = L
print(L)
Problem p03644 (python)

Fixed submission:
N = int(input())

tnum = 0
iter_num = 0

for i in range(N):
    res = 0
    num = i+1
    while num % 2 == 0:
        num /= 2
        res += 1
    if iter_num <= res:
        iter_num = res
        tnum = i+1

print(tnum)

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

tnum = 0
iter_num = 0

for i in range(N):
    res = 0
    num = i+1
    while num % 2 == 0:
        num /= 2
        res += 1
    if iter_num < res:
        iter_num = res
        tnum = i+1

print(tnum)
Problem p03711 (python)

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

first_group = [1, 3, 5, 7, 8, 10, 12]
second_group = [4, 6, 9, 11]

if x == 2 or y == 2:
    print('No')
elif x in first_group and y in second_group:
    print('No')
elif x in second_group and y in first_group:
    print('No')
else:
    print('Yes')

Buggy submission (verdict: Runtime Error):
x, y = map(int, input())

first_group = [1, 3, 5, 7, 8, 10, 12]
second_group = [4, 6, 9, 11]

if (x in first_group and y in first_group) or \
    (x in second_group and y in second_group) or \
    (x == 2 and y == 2):
    print('Yes')
else:
    print('No')
Problem p02765 (python)

Fixed submission:
N, R = (int(x) for x in input().split())
 
if N < 10:
  N = R + 100 * (10 - N) 
  print(N)
  
else:
  N = R
  print(N)

Buggy submission (verdict: Runtime Error):
N, R = int(input().split())
 
if N < 10:
  N = R + 100 * (10 - N) 
  print(N)
  
else:
  N = R
  print(N)

Buggy submission (verdict: Runtime Error):
N, R = int(input( , ))
 
if N < 10:
  N = R + 100 * (10 - N) 
  print(N)
  
else:
  N = R
  print(N)

Buggy submission (verdict: Runtime Error):
N = int(input())
R = int(input())
 
if N < 10:
  n = R + 100 * (10 - N) 
  print(n)
  
if N >= 10:
  n = R
  print(n)

Buggy submission (verdict: Runtime Error):
N = int(input())
R = int(input())
 
if N < 10:
  N = R + 100 * (10 - N) 
  print(N)
  
if N >= 10:
  N = R
  print(N)

Buggy submission (verdict: Runtime Error):
N = int(input())
R = int(input())
 
if N < 10:
  N = R + 100 * (10 - N) 
  print(n)
  
if N >= 10:
  N = R
  print(N)

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

if N < 10:
  N = 100 * (10 - N) 
  print(N)
  
if N > 10:
  N = R
  print(N)
Problem p02812 (python)

Fixed submission:
n = int(input())
s = input()
ans = 0
for i in range(n - 2):
  if s[i : i + 3] == "ABC":
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
s = input()
ans = 0
for i in range(n - 2):
  if s[i:i + 3] == "ABC":
    ++ans
print(ans)
Problem p03470 (python)

Fixed submission:
N = int(input())
D = []

for _ in range(N):
  D.append(int(input()))
print(len(set(D)))

Buggy submission (verdict: Runtime Error):
N = int(input())
    D = []

    for _ in range(N):
        D.append(int(input()))

    print(len(set(D)))
Problem p03493 (python)

Fixed submission:
count=0
a,b,c=input()
if a=="1":
	count+=1
if b=="1":
	count+=1
if c=="1":
	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
count=0
int a,b,c=map(int,input().split())
if a>0:
	count+=1
if b>0:
	count+=1
if c>0:
	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
count=0
int a,b,c=int(input())
if a>0:
	count+=1
if b>0:
	count+=1
if v>0:
	count+=1
print(count)
Problem p02882 (python)

Fixed submission:
a, b, x = map(int, input().split())
import numpy as np
if b*a*a/2>x:
  print(np.arctan(a*b*b/2/x)*180/np.pi)
else:
  y=2*x/(a*a) - b
  z = b-y
  print(np.arctan(z/a)*180/np.pi)

Buggy submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
print(np.arctan(a*b*b/2/x)*180/np.pi)

Buggy submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
np.arctan(a*b*b/2/x)*180/np.pi
Problem p02888 (python)

Fixed submission:
from bisect import bisect_left

N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)

Buggy submission (verdict: Runtime Error):
N = int(input())
L = list(map(int, input().split()))

L.sort()
result = 0
for i in range(N - 2):
    for j in range(i + 1, N - 1):
        result += bisect_left(L, L[i] + L[j]) - j - 1
print(result)
Problem p02898 (python)

Fixed submission:
import numpy as np
K = list(map(int, input().split()))[1]
h = list(map(int, input().split()))
print(sum(np.array(h)>=K))

Buggy submission (verdict: Runtime Error):
import numpy as np
K = list(map(int, input().split()))[1]
h = list(map(int, input().split()))
print(sum(np.array(h)>=K)
Problem p03964 (python)

Fixed submission:
N = int(input())
x, y = 1, 1
for i in range(N):
  a, b = map(int, input().split())
  mul = max((x+a-1)//a, (y+b-1)//b)
  x = mul*a
  y = mul*b
print(x+y)

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())
ans1 = 1
ans2 = 1
for _ in range(N):
  i1, i2 = list(map(int, input().split()))
  n = max(np.ceil(ans1/i1), np.ceil(ans2/i2))
  ans1 = i1 * n
  ans2 = i2 * n
print(int(ans1+ans2))
Problem p02783 (python)

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

if n[0] % n[1] != 0:
  t = 1

print(n[0] // n[1] + t)

Buggy submission (verdict: Runtime Error):
import fractions

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

print(fractions.ceil(h,a))
Problem p02802 (python)

Fixed submission:
n,m = list(map(int,input().split()))
ac = 0
wa = 0
y = {i:0 for i in range(1,n+1)}
z = {i:0 for i in range(1,n+1)}

for _ in range(m):
  p,s = input().split()
  p = int(p)
  if not y[p] and s == 'WA':
    z[p] += 1
  elif not y[p] and s == 'AC':
    ac += 1
    y[p] += 1

for i in range(1,n+1):
  if y[i]:
    wa += z[i]

print(ac,wa)

Buggy submission (verdict: Runtime Error):
n,m = list(map(int,input().split()))
ac = 0
wa = 0
y = [0] * n
z = [0] * n

for _ in range(m):
  p,s = input().split()
  p = int(p)
  if not y[p] and s == 'WA':
    z[p] += 1
  elif not y[p] and s == 'AC':
    ac += 1
    y[p] += 1

for i in range(m):
  if y[i]:
    wa += z[i]

print(ac,wa)
Problem p02823 (python)

Fixed submission:
n = list(map(int,input().split()))
ans = 0
if (n[2] - n[1]) % 2 == 0:
  ans = (n[2] - n[1]) // 2
else:
  ans = min(n[0] - n[2] + 1, n[1] - 1 + 1)
  ans += abs(n[2] - n[1] - 1) // 2

print(ans)

Buggy submission (verdict: Runtime Error):
n = list(map(int,input().split()))
ans = 0
if n[1] % 2 == 0 and n[2] % 2 == 0:
  ans = n[2] - n[1]
  print(ans//2)
else:
  if n[0] - n[2] < n[1] - 1:
    ans = n - n[1]
  else:
    ans = n[2] - 1
  print(ans)
Problem p02848 (python)

Fixed submission:
n = int(input())
s = list(input())
l = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
a = []

for i in s:
  t = l.index(i)+n
  if t < 26:
    a.append(l[t])
  else:
    a.append(l[t-26])

print("".join(a))

Buggy submission (verdict: Runtime Error):
import codecs

n = input()
s = input()

codecs.decode(s,'rot'+ n)
Problem p02953 (python)

Fixed submission:
n = input()
l = list(map(int, input().split()))
m = 0
a = "Yes"
for i in l:
    if i < m-1:
        a = "No"
        break
    m = max(m, i)
print(a)

Buggy submission (verdict: Runtime Error):
kazu = int(input())
suji = input().split()

l_si_i = [int(s) for s in suji]

for i in range(kazu):
    if i == 0:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        elif l_si_i[i+1] - l_si_i[i] == -1:
            l_si_i[i] = l_si_i[i] - 1
            continue
        else:
            continue

    elif i > 0 and kazu - i != 1:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        elif l_si_i[i+1] - l_si_i[i] == -1:
            if l_si_i[i] - l_si_i[i-1] >= 0:
                l_si_i[i] = l_si_i[i] - 1
            else:
                print('No')
                exit()
        else:
            continue
    elif kazu - i == 1:
        if l_si_i[i] - l_si_i[i-1] >= 0:
            l_si_i[i] = l_si_i[i] - 1
        else:
            print('No')
            exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
kazu = int(input())
suji = input().split()

l_si_i = [int(s) for s in suji]

if kazu == 1:
    print('Yes')
    exit()

for i in range(kazu):
    if kazu - i == 1:
        print('Yes')
    if i == 0:
        if l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        else:
            continue
    else:
        if l_si_i[i+1] - l_si_i[i] == 0:
            continue
        elif l_si_i[i+1] - l_si_i[i] == 1:
            l_si_i[i+1] = l_si_i[i+1] - 1
            continue
        elif l_si_i[i+1] - l_si_i[i] == -1:
            if l_si_i[i] - l_si_i[i-1] <= 0:
                print('No')
                exit()
            else:
                continue
        elif l_si_i[i+1] - l_si_i[i] < -1:
            print('No')
            exit()
        else:
            continue
Problem p02957 (python)

Fixed submission:
a = list(map(int, input().split()))
b = a[0] + a[1]
if b%2 == 0:
  print(int(b/2))
else:
  print('IMPOSSIBLE')

Buggy submission (verdict: Runtime Error):
i = int(input())
l = list(map(int, input().split()))
s = sorted(l)
f = 0

for n in range(i):
    if l[n] == n+1:
        continue
    else:
        f = f + 1
        continue
print(f)
if f == 2:
    print('YES')
elif f == 0:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
a = input().split()
b = a[0] + a[1]
if b%2 == 0:
  print(b/2)
else:
  print('IMPOSSIBLE')
Problem p02993 (python)

Fixed submission:
char_list = list(input())
for i in range(4):
    
    if i == 3:
        print('Good')
        break
    
    if char_list[i] == char_list[i+1] and i < 3:
        print('Bad')
        break

Buggy submission (verdict: Runtime Error):
char_list = list(str)
for i in range(4):
    
    if i == 3:
        print('Good')
        break
    
    if char_list[i] == char_list[i+1] and i < 3:
        print('Bad')
        break
Problem p03316 (python)

Fixed submission:
n = int(input())
n_s = []
for c in str(n):
    n_s.append(c)
n_l = [int(s) for s in n_s]
c = 0
for i in n_l:
    c = i + c

if n % c == 0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
n =  int(input())
n_s = [*str(n)]
n_l = [int(s) for s in n_s]
c = 0
for i in n_l:
    c = i + c

if n % c == 0:
    print('Yes')
else:
    print('No')
Problem p02772 (python)

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
count=0
for i in range (a):
 if b[i]%2==0 and b[i]%3!=0 and b[i]%5!=0:
  count=0
  break
 else:count=1
if count==1:
 print("APPROVED")
else: print("DENIED")

Buggy submission (verdict: Runtime Error):
a=int(input())
b=map(int,input().split())
count=0
for i in range (a):
	if b[i]%2==0:
		if b[i]%3==0 or b[i]%5==0:
			count=1
		else:count=0
	else:count=1
if count=1:
	print("APPROVED")
else: print("DENIED")
Problem p02783 (python)

Fixed submission:
import math
a, b = map(int, input().split()) 
print(math.ceil(a/b))

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input().split())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
C=list(input())
count= 0
for i in range (B):
	count=count+int(C[i])
if count<=A:
	print("Yes")
else: print("No")
Problem p02784 (python)

Fixed submission:
A,B=map(int,input().split())
C=list(input().split())
count= 0
for i in range (B):
	count=count+int(C[i])
if count>=A:
	print("Yes")
else: print("No")

Buggy submission (verdict: Runtime Error):
A,B=map(int, input().split())
C=list(int(input()))
count= 0
for i in range (B):
	count=count+C[i]
if count<=A:
	print("Yes")
else: print("No")
Problem p02811 (python)

Fixed submission:
a,b = map(int,input().split())
c = a*500
if c>=b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = a*500
if c>=b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = int(input()) * 500
b = int(input())
if a>=b:
  print("Yes")
else:
  print("No")
Problem p02817 (python)

Fixed submission:
S,T =input().split()
print(T+S)

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)

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

Buggy submission (verdict: Runtime Error):
S,T=.input().split()
print(TS)

Buggy submission (verdict: Runtime Error):
S,T =.input().split()
print("T"+"S")

Buggy submission (verdict: Runtime Error):
S,T = .input().split()
print("T+S")

Buggy submission (verdict: Runtime Error):
S,T = .input().split()
print(T+S)
Problem p02818 (python)

Fixed submission:
a,b,k=map(int,input().split())
if k<=a:
	A=a-k
	B=b
elif k>=a and k-a<=b:
	A=0
	B=b+a-k
else:A=B=0
print(A,B)

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

Buggy submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
for i in range (k):
	if a>0:
		a-=1
    break
	elif b>0:
		b-=1
print(a,b)
Problem p02898 (python)

Fixed submission:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=1
print(str(count))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
      	count+=count
print(str(count))

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
height=list(input())
count=0
for i in range (a):
  	 if height[i]>=b:
      	count+=count
print(str(count))
Problem p02765 (python)

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

if a >=10:
  c=int(b)
  print(c)
else:
  c=int(b+1000-100*a)
  print(c)

Buggy submission (verdict: Runtime Error):
a b=int(input().split())
if a < 10:
  print(b)
else:
  print(b-1000+100*a)

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a < 10:
  print(b)
else:
  print(b-1000+100*a)

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a < 10:
  print(b)
else:
  print(b+1000-100*a)

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a < 10:
  c = int(b-1000+199*a)
else:
  c = int(b)
print(c)

Buggy submission (verdict: Runtime Error):
a,b=int(input().split())
if a < 10 :
  c = int(b-1000+100*a)
else:
  c = b
ptint(c)