Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(len(a)+1):
  if x>0 and x>a[i]:
    x-=a[i]
    c+=1
  else:
    print(c)
    break

Fixed submission:
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(n):
  if n>=i and x>=a[i]:
    x-=a[i]
    c+=1
    if n==c and x==0:
      print(n)
    if n==c and x!=0:
      print(n-1)
  else:
    print(c)
    break

Buggy python submission (verdict: Runtime Error):
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(len(a)+1):
  if x>0 and x>=a[i]:
    x-=a[i]
    c+=1
  else:
    print(c)
    break

Fixed submission:
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(n):
  if n>=i and x>=a[i]:
    x-=a[i]
    c+=1
    if n==c and x==0:
      print(n)
    if n==c and x!=0:
      print(n-1)
  else:
    print(c)
    break

Buggy python submission (verdict: Runtime Error):
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(len(a)+1):
  if x>0:
    x-=a[i]
    c+=1
  else:
    print(c)
    break

Fixed submission:
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(n):
  if n>=i and x>=a[i]:
    x-=a[i]
    c+=1
    if n==c and x==0:
      print(n)
    if n==c and x!=0:
      print(n-1)
  else:
    print(c)
    break

Buggy python submission (verdict: Runtime Error):
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(len(a)+1):
  if x>0:
    x-=a[i]
    c+=1
  else:
    print(c)


Fixed submission:
n,x=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(n):
  if n>=i and x>=a[i]:
    x-=a[i]
    c+=1
    if n==c and x==0:
      print(n)
    if n==c and x!=0:
      print(n-1)
  else:
    print(c)
    break
Buggy python submission (verdict: Runtime Error):
item=list(map(int,input().split())).sorted()
print(item)

Fixed submission:
item=list(map(int,input().split()))
item.sort()
times=0
while sum(item)/3!=item[0]:
  if item[1]==item[2]:
    item[0]+=2
    times+=1
    item.sort()
  else:
    item[0]+=1
    item[1]+=1
    times+=1
    item.sort()
print(times)
Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n % 500 < a:
    print("YES")
else:
    print("NO")

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a:
    print("YES")
else:
    print("NO")

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a:
    print('YES')
else:
    print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a:
  print('YES')
else:
  print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a;
    print('YES')
else
    print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n= int(input())
a = int(input())
if n%500 < a:
    print('YES')
else
    print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a:
  print('YES')
else
  print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = map(int, input())
a = map(int, input())
if n%500 < a:
    print('YES')
else
    print('NO')

Fixed submission:
n = int(input())
a = int(input())
if n % 500 <= a:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
print(input().replace(s[3],'8'))

Fixed submission:
s=input()
print(s.replace('2017','2018'))

Buggy python submission (verdict: Runtime Error):
s=input()
s[3]='8'
print(s)

Fixed submission:
s=input()
print(s.replace('2017','2018'))

Buggy python submission (verdict: Runtime Error):
s = input()
s[3]=7
print(s)

Fixed submission:
s=input()
print(s.replace('2017','2018'))
Buggy python submission (verdict: Runtime Error):
n,y = int(input())
for a in range(n+1):
  for b in range(n+1-b):
    if a*10000+b*5000+(n-a-b)*1000==n:
      print str(a)+" "+str(b)+" "+ str(n-a-b)
print "-1 -1 -1"

Fixed submission:
n,y = map(int, input().split())
for a in range(n+1):
  for b in range(n+1-a):
    if a*10000+b*5000+(n-a-b)*1000==y:
      print(str(a)+" "+str(b)+" "+ str(n-a-b))
      exit()
print("-1 -1 -1")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=[input() for i in range(n)]
cnt=0
for i in set(a):
  _cnt = a.count(i)
  if _cnt>=2:
    cnt+=int(_cnt/2)
print(n-cnt*2)

Fixed submission:
from collections import Counter
n=int(input())
a=[input() for _ in range(n)]
cnt=Counter(a)
ans=0
for i in cnt.values():
  if i%2:
    ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(math.inf):
  if 2**i < n:
    continue
  else:
    print(2**(i-1))
    break

Fixed submission:
n=int(input())
for i in range(99):
  if 2**i <= n:
    continue
  else:
    print(2**(i-1))
    break

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(math.inf):
  if 2**i < n:
    continue
  else:
    print(2**(i-1))

Fixed submission:
n=int(input())
for i in range(99):
  if 2**i <= n:
    continue
  else:
    print(2**(i-1))
    break

Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(math.inf):
  if n%2==0:
    print(n)
    break
  else:
    n=n/2

Fixed submission:
n=int(input())
for i in range(99):
  if 2**i <= n:
    continue
  else:
    print(2**(i-1))
    break

Buggy python submission (verdict: Runtime Error):
a=int(input())
cnt=0
for i in range(math.inf):
  if a%2==0:
    cnt+=1
    a/=2
  else:
    print(cnt)
    break

Fixed submission:
n=int(input())
for i in range(99):
  if 2**i <= n:
    continue
  else:
    print(2**(i-1))
    break

Buggy python submission (verdict: Runtime Error):
a=int(input())
cnt=0
for i in range(math.inf):
  if a%2==0:
    cnt+=1
    a/=2
  else:
    print(cnt)
 


Fixed submission:
n=int(input())
for i in range(99):
  if 2**i <= n:
    continue
  else:
    print(2**(i-1))
    break
Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
  if i>s:
    continue
  for j in range(k+1):
    if i+j>s:
      continue
    for l in range(k+1):
      if i+j+l==s:
        cnt+=1
print(cnt)

Fixed submission:
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
  if i>s:
    continue
  for j in range(k+1):
    if i+j>s:
      continue
    l=s-i-j
    if 0<=l<=k:
      cnt+=1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
  for j in range(k+1):
    for l in range(k+1):
      if i+j+l==s:
        cnt+=1
print(cnt)

Fixed submission:
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
  if i>s:
    continue
  for j in range(k+1):
    if i+j>s:
      continue
    l=s-i-j
    if 0<=l<=k:
      cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N=int(input())
#number of cakes
if all( (N - 4*i) % 7 != 0 for i in range(N/4)):
    print("No")
else:
    print("Yes")

Fixed submission:
N=int(input())
#number of cakes
if all( (N - 4*i) % 7 != 0 for i in range(N//4 + 1)):
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
x=int(input())
count=0
for a in range(1, x):
    suma=0
    sumb=0
    b=x-a
    while (a > 0):
        suma += a%10
        a//=10
    while (b > 0):
        sumb += b%10
        b//=10
    count = min(count, suma+sumb)
print(min(S))

Fixed submission:
x=int(input())
count=100000
suma=0
sumb=0
for a in range(1, x):
    b = x-a
    y = sum(map(int, str(a))) + sum(map(int, str(b)))
    if y<count:
        count=y
print(count)
Buggy python submission (verdict: Runtime Error):
N, X=map(int, input().split())
A=[int(input()) for _ in range(N)]
rest=X-sum(A)
print(rest//min(A)+N)

Fixed submission:
print(input().count("o")*100+700)

Buggy python submission (verdict: Runtime Error):
N, X=map(int, input().split())
A=[int(input(for _ in range(N)))]
rest=X-sum(A)
print(rest//min(A)+N)

Fixed submission:
print(input().count("o")*100+700)
Buggy python submission (verdict: Runtime Error):
N, X=map(int, input().split())
A=[int(input(for _ in range(N)))]
rest=X-sum(A)
print(rest//min(A)+N)

Fixed submission:
N, X=map(int, input().split())
A=[int(input()) for _ in range(N)]
rest=X-sum(A)
print(rest//min(A)+N)

Buggy python submission (verdict: Runtime Error):
N, X=map(int, input().split())
A=[int(input(for _ in range(N)))]
print((X-sum(A))//min(A)+N)

Fixed submission:
N, X=map(int, input().split())
A=[int(input()) for _ in range(N)]
rest=X-sum(A)
print(rest//min(A)+N)

Buggy python submission (verdict: Runtime Error):
N, X=map(int, input().split)
A=[int(input(for _ in range(N)))]
print((X-sum(A))//min(A)+N)

Fixed submission:
N, X=map(int, input().split())
A=[int(input()) for _ in range(N)]
rest=X-sum(A)
print(rest//min(A)+N)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input(),split())
c= a+b
if c%2==0:
 print(c/2)
else:
print((c+1)/2)

Fixed submission:
a, b =map(int, input().split())
print(int((a+b+1)/2))
Buggy python submission (verdict: Runtime Error):
input()
#文字列を数字へ
A=list(map(int, input().split()))

count=0

#Aへの繰り返し処理
while all(i%2==0 for i in A):
        count+=1
        A= [i/2 for i in A]


print(count)

Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
print(input().count"1")

Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Runtime Error):
input()
a=list(map(int,input().split()))
count=0

while all(a%2 == 0 for i in a):
    i=[i/2 for i in a]
    count+=1
print(count)

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

count=0

while all(i%2==0 for i in A):
        count+=1
        A= [i/2 for i in A]

print(count)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=math.log2(N)
print(round(a))

Fixed submission:
n=int(input())
count=1
while count<=n:
    count=2*count
else:
    print(int(count/2))
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort(revese = True)
sum_l=0
for i in range(0,k):
    sum_l+=l[i]

print(sum_l)

Fixed submission:
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort(reverse = True)
sum_l=0
for i in range(0,k):
    sum_l+=l[i]

print(sum_l)

Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
l = list(map(int, input().split))
l.sort(revese = True)
sum_l=0
for i in range(0,k):
    sum_l+=l[i]

print(sum_l)

Fixed submission:
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort(reverse = True)
sum_l=0
for i in range(0,k):
    sum_l+=l[i]

print(sum_l)
Buggy python submission (verdict: Time Limit Exceeded):
k, s =map(int, input().split())
count=0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x + y + z == s:
                count+=1
print(count)

Fixed submission:
k, s =map(int, input().split())
count=0
for x in range(k+1):
    for y in range(min(k+1, s-x+1)):
        if k >=s - x - y >= 0:
            count+=1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
#各桁の和を求める
def findSumOfDigits(n):
  sum = 0
  while n > 0:
    sum += int(n % 10)
    n = int(n / 10)
  return sum

N = int(input())

total = 0
for A in range(1,N + 1):
  for B in range(1,N + 1):
    if A + B == N:
      rec_A = findSumOfDigits(A)
      rec_B = findSumOfDigits(B)
      rec = rec_A + rec_B
      if total == 0:
        total = rec
      elif total >= rec:
        total = rec
        
print(total)

Fixed submission:
#各桁の和を求める
def findSumOfDigits(n):
  sum = 0
  while n > 0:
    sum += int(n % 10)
    n = int(n / 10)
  return sum

N = int(input())

if N % 10 != 0 :
  print(findSumOfDigits(N))
else:
  print("10")
Buggy python submission (verdict: Time Limit Exceeded):
K,S = [int(i) for i in input().rstrip().split()]

lst_temp = [ int(i) for i in range(K + 1)]

rec = 0
lst_rec = []
for x in lst_temp:
  for y in lst_temp:
    for z in lst_temp:
      lst_rec.append(x+y+z)
      
rec = [ i for i in lst_rec if i == S]
print(len(rec))



Fixed submission:
K,S = [int(i) for i in input().rstrip().split()]

lst_temp = [ int(i) for i in range(K + 1)]

recCnt = 0
for x in lst_temp:
  for y in lst_temp:
    z = S - x - y 
    if z >= 0 and z <= K:
      recCnt += 1
      
print(recCnt)

Buggy python submission (verdict: Time Limit Exceeded):
K,S = [int(i) for i in input().rstrip().split()]

rec = 0
for x in range(K+1):
  for y in range(K+1):
    for z in range(K+1):
      if x+y+z == S:
        rec += 1
        
print(rec)

Fixed submission:
K,S = [int(i) for i in input().rstrip().split()]

lst_temp = [ int(i) for i in range(K + 1)]

recCnt = 0
for x in lst_temp:
  for y in lst_temp:
    z = S - x - y 
    if z >= 0 and z <= K:
      recCnt += 1
      
print(recCnt)

Buggy python submission (verdict: Time Limit Exceeded):
K,S = [int(i) for i in input().rstrip().split()]

X=Y=Z=K+1

rec = 0
for i in range(X):
  for j in range(Y):
    for k in range(Z):
      xyz = i + j + k			#合計値
      if xyz == S:
        rec += 1

print(rec)

Fixed submission:
K,S = [int(i) for i in input().rstrip().split()]

lst_temp = [ int(i) for i in range(K + 1)]

recCnt = 0
for x in lst_temp:
  for y in lst_temp:
    z = S - x - y 
    if z >= 0 and z <= K:
      recCnt += 1
      
print(recCnt)

Buggy python submission (verdict: Time Limit Exceeded):
K,S = [int(i) for i in input().rstrip().split()]

X=Y=Z=K

rec = 0
for i in range(X+1):
  for j in range(Y+1):
    for k in range(Z+1):
      xyz = i + j + k			#合計値
      if xyz == S:
        rec += 1

print(rec)

Fixed submission:
K,S = [int(i) for i in input().rstrip().split()]

lst_temp = [ int(i) for i in range(K + 1)]

recCnt = 0
for x in lst_temp:
  for y in lst_temp:
    z = S - x - y 
    if z >= 0 and z <= K:
      recCnt += 1
      
print(recCnt)
Buggy python submission (verdict: Runtime Error):
s = str(input())
print(len(s))
for i in range(len(s)):
    if s[i] == 'A':
        min = i
        break
for i in reversed(range(len(s))):
    if s[i] =='Z':
        max = i
        break

print(max)print(max-min+1)

Fixed submission:
s = str(input())
for i in range(len(s)):
    if s[i] == 'A':
        min = i
        break
for i in reversed(range(len(s))):
    if s[i] =='Z':
        max = i
        break

print(max-min+1)
Buggy python submission (verdict: Runtime Error):
l = list(map(int,input().split()))
a = 0
b = 1
c = 1
while c <= l[0]:
    if a + b >= l[1] and a + b <= l[2]:
        sum += c
    if b == 9:
        b = 0
        a += 1
    else:
        b += 1
    c = 10 * a + b
print(sum)


Fixed submission:
l = sorted(list(map(int, input().split())))
if l[0] + l[1] == l[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] = l[1] and l[1] = l[2]:
    s = s + 1
print(s)

Fixed submission:
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] == l[1] and l[1] == l[2]:
    s = s + 1
print(s)

Buggy python submission (verdict: Runtime Error):
l = list(map(int, input().split()))
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s + 1
print(s)

Fixed submission:
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] == l[1] and l[1] == l[2]:
    s = s + 1
print(s)
Buggy python submission (verdict: Runtime Error):
l = [int(input()) for i range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Fixed submission:
l = [int(input()) for i in range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Buggy python submission (verdict: Runtime Error):
l = [int(input) for i range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Fixed submission:
l = [int(input()) for i in range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Buggy python submission (verdict: Runtime Error):
l = list(map(int, input().split()))
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Fixed submission:
l = [int(input()) for i in range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Buggy python submission (verdict: Runtime Error):
l=list(map(int, input().split()))
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Fixed submission:
l = [int(input()) for i in range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Buggy python submission (verdict: Runtime Error):
l=list(map(int, input.split()))
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)

Fixed submission:
l = [int(input()) for i in range(4)]
if l[0] <= l[1]:
    sum = l[0] * l[2]
else:
    sum = l[1] * l[2] + (l[0]-l[1]) * l[3]
print(sum)
Buggy python submission (verdict: Runtime Error):
N=int(input())
T,A = map(int,input().split())
H=list(map(float,input().split()))
tm=0
tem=0
TEM = []
TM = []
for h in H:
    tm=T-h*0.006
    TM.append(tm)
for tm in TM:
    tem=abs(tm-A)
    TEM.append(tem)
num = TEM.index(min(1))
print(num+1)

Fixed submission:
N=int(input())
T,A = map(int,input().split())
H=list(map(float,input().split()))
tm=0
tem=0
TEM = []
TM = []
for h in H:
    tm=T-h*0.006
    TM.append(tm)
for tm in TM:
    tem=abs(tm-A)
    TEM.append(tem)
num = TEM.index(min(TEM))
print(num+1)
Buggy python submission (verdict: Runtime Error):
N,x = map(int,input().split())
A = list(map(int,input().split()))	
ans=0
A.sort()
for i in A:
    x=x-i
    if x < 0:
    
    else:
        ans=ans+1
print(ans)

Fixed submission:
N,x = map(int,input().split())
A = list(map(int,input().split()))	
ans=0
A.sort()
for i in A:
    x=x-i
    if x >= 0:
        ans=ans+1
if x > 0:
    ans= ans-1
print(ans)
Buggy python submission (verdict: Runtime Error):
import re
S = list(input())
ans=0
cou=2
Ccou=0
A=S.count('A')
C=S.count('C')
jud = len(re.findall('[a-z]', S))
rep=len(S)-2
if S[0]=='A':
    ans=+1
rep=len(S)-2
for i in range(1,rep):
    if S[cou]=='C':
        Ccou=Ccou+1
    cou=cou+1
if Ccou == 1:
    ans=ans+1
if ans ==2 and A==1 and C==1 and jud==2:
    print("AC")
else:
    print("WA")

Fixed submission:
import re
S = list(input())
S2=''.join(S)
ans=0
cou=2
Ccou=0
A=S.count('A')
C=S.count('C')
jud = len(re.findall('[A-Z]', S2))
rep=len(S)-2
if S[0]=='A':
    ans=+1
rep=len(S)-2
for i in range(1,rep):
    if S[cou]=='C':
        Ccou=Ccou+1
    cou=cou+1
if Ccou == 1:
    ans=ans+1
if ans ==2 and A==1 and C==1 and jud==2:
    print("AC")
else:
    print("WA")
Buggy python submission (verdict: Runtime Error):
A,B =map(int,input().split())
hih=0
num=1
JG=1
S=int(input())
S= list(str(S))
for s in S:
    if s=="-":
        hih=num 
    num+=1
for s in S:
    if s=="0" or s=="1" or s=="2" or s=="3" or s=="4" or s=="5" or s=="6" or s=="7" or s == "8" or s=="9":
    else:
        JG=0
if hih==A & JG==1:
    print("Yes")
else:
    print("No")

Fixed submission:

A,B =map(int,input().split())
hih=0
num=1
test=1
S=str(input())
S= list(S)
for s in S:
    if num==A+1 and s=="-":
        hih=1
    if num!=A+1 and s=="-":
        test=0
        
    
    num+=1
if hih==1 and test==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
A,B =map(int,input().split())
hih=0
num=1
S=int(input())
S= list(str(S))
for s in S:
    if s=="-":
        hih=num
    num+=1
if hih==A:
    print("Yes")
else:
    print("No")

Fixed submission:

A,B =map(int,input().split())
hih=0
num=1
test=1
S=str(input())
S= list(S)
for s in S:
    if num==A+1 and s=="-":
        hih=1
    if num!=A+1 and s=="-":
        test=0
        
    
    num+=1
if hih==1 and test==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
A,B =map(int,input().split())
hih=0
num=2
S=int(input())
S= list(str(S))
for s in S:
    if s=="-":
        hih=num
    num+=1
if hih==A:
    print("Yes")
else:
    print("No")

Fixed submission:

A,B =map(int,input().split())
hih=0
num=1
test=1
S=str(input())
S= list(S)
for s in S:
    if num==A+1 and s=="-":
        hih=1
    if num!=A+1 and s=="-":
        test=0
        
    
    num+=1
if hih==1 and test==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
A,B =map(int,input().split())
hih=0
num=2
S=int(input())
S= list(str(S))
for s in S:
    if s=="-":
        hih=num
    num+=1
if hih==A:
    print(Yes)
else:
    print(No)

Fixed submission:

A,B =map(int,input().split())
hih=0
num=1
test=1
S=str(input())
S= list(S)
for s in S:
    if num==A+1 and s=="-":
        hih=1
    if num!=A+1 and s=="-":
        test=0
        
    
    num+=1
if hih==1 and test==1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
S=list(input())
S= list(set(S))
J=[]
S.sort()
for i in range(97,123):
    A=chr(i)
    J.append(A)
for i in S:
    J.remove(i)
print(J[0])

Fixed submission:
S=list(input())
S= list(set(S))
J=[]
S.sort()
for i in range(97,123):
    A=chr(i)
    J.append(A)
for i in S:
    J.remove(i)
if len(J)==0:
    print('None')
else:
    print(J[0])
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
Even = []
Odd = []
A.sort()
for a in A:
    if a % 2 == 0:
        a.append(Even)
    if a % 2 == 1:
        a.append(Odd)
if len(Odd) % 2 == 1:
    print('NO')
else:
    print('YES')
        

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
Even = []
Odd = []
A.sort()
for a in A:
    if a % 2 == 0:
        Even.append(a)
    if a % 2 == 1:
        Odd.append(a)
if len(Odd) % 2 == 1:
    print('NO')
else:
    print('YES')
Buggy python submission (verdict: Runtime Error):
N = int(input())
T, A  = map(int, input().split())
hight_list = list(map(int, input().split()))

ans = 10000
ans_ind

for i in range(N):
  temp = T - 0.006 * hight_list[i]
  diff = abs(temp - A)
  if  diff < ans:
    ans = diff
    ans_ind = i
    
print(i+1)
    
  

Fixed submission:
N = int(input())
T, A  = map(int, input().split())
hight_list = list(map(int, input().split()))
 
ans = 10000
ans_ind = 0
 
for i in range(N):
  temp = T - 0.006 * hight_list[i]
  diff = abs(temp - A)
  if  diff < ans:
    ans = diff
    ans_ind = i
    
print(ans_ind+1)