Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N=int(input())
P=list(map(int,input().split()))
def m(n):
    return min(P[:n+1])
A=[]
if m(i)==P[i] for i in range(N):
    A.append(i)
else:
    pass
print(len(A))

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

ans = 0
n_min = 0
for i in range(0,n):
    if i == 0:
        ans += 1
        n_min = p[i]
        continue
    if p[i] <= n_min:
        ans += 1
        n_min = p[i]
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
P=list(map(int,input().split()))
def m(n):
    return min(P[:n+1])
A=[]
for i in range(N):
    A.append(m(i))
print(len(set(A)))

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

ans = 0
n_min = 0
for i in range(0,n):
    if i == 0:
        ans += 1
        n_min = p[i]
        continue
    if p[i] <= n_min:
        ans += 1
        n_min = p[i]
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=input()
P=list(map(int,input().split()))
t=0
while len(P)>0:
    A=P[0]
    P=[i for i in P if i<A]
    t=t+1
print(t)

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

ans = 0
n_min = 0
for i in range(0,n):
    if i == 0:
        ans += 1
        n_min = p[i]
        continue
    if p[i] <= n_min:
        ans += 1
        n_min = p[i]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N,M=map(int,input().split())
ac=0
wa=0
mydict={}
w=[]
p=[]
for i in range(M):
    P,S=input().split()
    if S=="WA":
        if w.count(P)==0:
            mydict[P]=1
            w.append(P) 
        else:
            mydict[P]=mydict[P]+1
    else:
        if p.count(P)==0:
            ac=ac+1
            p.append(P)
            if w.count(P)!=0:
                wa=wa+mydict[P]
        else:
            pass
print(ac,wa)

        





Fixed submission:
N,M=map(int,input().split())
ac=0
wa=0
a=[0]*N
w=[0]*N
for i in range(M):
    P,S=input().split()
    if S=="WA":
        w[int(P)-1]+=1
    else:
        if a[int(P)-1]==0:
            a[int(P)-1]+=1
            ac=ac+1
            wa+=w[int(P)-1]
        else:
            pass
print(ac,wa)

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
ac=0
wa=0
mydict={}
already=[]
for i in range(M):
    P,S=input().split()
    if S=="WA":
        if already.count(P)==0:
            mydict[P]=1
        else:
            mydict[P]=mydict[P]+1
    else:
        if already.count(P)==0:
            ac=ac+1
            wa=wa+mydict[P]
        else:
            pass
print(wa,ac)

        





Fixed submission:
N,M=map(int,input().split())
ac=0
wa=0
a=[0]*N
w=[0]*N
for i in range(M):
    P,S=input().split()
    if S=="WA":
        w[int(P)-1]+=1
    else:
        if a[int(P)-1]==0:
            a[int(P)-1]+=1
            ac=ac+1
            wa+=w[int(P)-1]
        else:
            pass
print(ac,wa)

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
wa=0
ac=0
already=[]
for i in range(M+1):
    P,S=map(input().split())
    if S=="WA" and already.count(P)==0:
        wa=wa+1
    if S=="AC" and already.count(P)==0:
        ac=ac+1
        already.append(P)
    else:
        pass
print(wa,ac)


 
    


    

    




Fixed submission:
N,M=map(int,input().split())
ac=0
wa=0
a=[0]*N
w=[0]*N
for i in range(M):
    P,S=input().split()
    if S=="WA":
        w[int(P)-1]+=1
    else:
        if a[int(P)-1]==0:
            a[int(P)-1]+=1
            ac=ac+1
            wa+=w[int(P)-1]
        else:
            pass
print(ac,wa)

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
wa=0
ac=0
already=[]
for i in range(M):
    P,S=map(input().split())
    if S=="WA" and already.count(P)==0:
        wa=wa+1
    if S=="AC" and already.count(P)==0:
        ac=ac+1
        already.append(P)
    else:
        pass
print(wa,ac)


 
    


    

    




Fixed submission:
N,M=map(int,input().split())
ac=0
wa=0
a=[0]*N
w=[0]*N
for i in range(M):
    P,S=input().split()
    if S=="WA":
        w[int(P)-1]+=1
    else:
        if a[int(P)-1]==0:
            a[int(P)-1]+=1
            ac=ac+1
            wa+=w[int(P)-1]
        else:
            pass
print(ac,wa)
Buggy python submission (verdict: Time Limit Exceeded):

s = int(input())

val = s
mp = {}
i= 0
while True:
  i+=1
  if val%2==0:
    val = val//2
  else:
    val = 2*val+1
  
  if val in mp:
    print(i)
    break
  else:
    mp[val] = 1

Fixed submission:

s = int(input())

val = s
mp = {s:1}
i= 1
while True:
  i+=1
  if val%2==0:
    val = val//2
  else:
    val = 3*val+1
  
  if val in mp:
    print(i)
    break
  else:
    mp[val] = 1
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
li = list(map(int,input().split()))

part_of_sum=[]
for i in range(n-1):
  part_of_sum.append(sum(li[i+1:]))

sum=0
for j in range(n-1):
  sum+=li[j]*part_of_sum[j]

print(sum%(10**9+7))

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

part_of_sum=[]
s=0
mini_sum=sum(li[1:])
for j in range(n-1):
  s+=li[j]*mini_sum
  mini_sum-=li[j+1]

print(s%(10**9+7))
Buggy python submission (verdict: Runtime Error):
n=int(input())

def f_xyz(x,y,z):
  return x**2+y**2+z**2+x*y+y*z+z*x 

li=[0]*(n+1)
for x in range(1,200):
  for y in range(1,200):
    for z in range(1,200):
      num=f_xyz(x,y,z)
      if num<=n:
        li[f_xyz(x,y,z)+1]+=1
      else:
        break
        
for i in li[2:n+1]:
  print(i)
  

Fixed submission:
n=int(input())

def f_xyz(x,y,z):
  return x**2+y**2+z**2+x*y+y*z+z*x 

li=[0]*(n+5)
for x in range(1,200):
  for y in range(1,200):
    for z in range(1,200):
      num=f_xyz(x,y,z)
      if num<=n:
        li[f_xyz(x,y,z)+1]+=1
      else:
        break
        
for i in li[2:n+2]:
  print(i)
Buggy python submission (verdict: Runtime Error):
N=int(input())
while True:
    try:
        listA=list(map(int,input().split()))
        #listA<-[1,2,2,3,1]
        #ここに逐次処理を書けばいいと思う。
    except:
        break;

product=1
for i in listA:
  if product<10**18+1:
  	product=product*i
    
if listA.count(0)>0:
  print(0)
    
elif product<10**18+1:
  print(product)
  
elif product>=10**18+1:
  print(-1)


Fixed submission:
x,y = map(int,input().split()) 	
print(x*y)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
while True:
    try:
        listA=list(map(int,input().split()))
        #listA<-[1,2,2,3,1]
        #ここに逐次処理を書けばいいと思う。
    except:
        break;

product=1
for i in listA:
  	product=product*i
    
if product<10**18+1:
  print(product)
  
elif product>=10**18+1:
  print(-1)


Fixed submission:
N=int(input())
while True:
    try:
        listA=list(map(int,input().split()))
        #listA<-[1,2,2,3,1]
        #ここに逐次処理を書けばいいと思う。
    except:
        break;

product=1
for i in listA:
  if product<10**18+1:
  	product=product*i
    
if listA.count(0)>0:
  print(0)
    
elif product<10**18+1:
  print(product)
  
elif product>=10**18+1:
  print(-1)
Buggy python submission (verdict: Runtime Error):
import math
A=int(input())
B =float(input())
print(math.floor(A*B))

Fixed submission:
import math
li = input().split()
A=int(li[0])
B=li[1].split(".") #整数部分と小数部分に分割

B_int=int(B[0])
B_point=int(B[1])

print(A*B_int+(A*B_point)//100)
Buggy python submission (verdict: Runtime Error):
    import sys
    N,Y = map(int,input().split())
     
    for A in range(N+1)[::-1]:
      for B in range(N-A+1)[::-1]:
        C=N-A-B
        if (10000*A+5000*B+1000*C==Y):
          print(A,B,C)        
          sys.exit()
    print(-1,-1,-1)

Fixed submission:
import sys
N,Y = map(int,input().split())

for A in range(N+1):
  for B in range(N-A+1):
    C=N-A-B
    if (10000*A+5000*B+1000*C==Y):
      print(A,B,C)        
      sys.exit()
print(-1,-1,-1)
Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())

counter=0
#まずあるものでsccを作る
while True:
  if (N>=1) and (M>=2):
    N-=1
    M-=2
    counter+=1
  else:
    break

#のこったcだけで作る
counter+=M//4
print(counter)
    

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

counter=0
#まずあるものでsccを作る
raw_scc=min(N//1,M//2)
N-=raw_scc
M-=raw_scc*2
counter+=raw_scc

#のこったcだけで作る
counter+=M//4
print(counter)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())

ls = list(map(int, input().split()))
ans = []

for i in range(2**N):
  num = 0
  s = 0
  for j in range(N):
    if ((i >> j) & 1):
      if num < K:
        s += ls[j]
        num += 1
  if num == K:
    ans.append(s)

ans2 = sorted(ans)
print(ans2[0])

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

ls = list(map(int, input().split()))
ans = 0

ls2 = sorted(ls)

for i in range(K):
  ans += ls2[i]

print(ans)

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

ls = list(map(int, input().split()))
ans = []

for i in range(2**N):
  num = 0
  s = 0
  for j in range(N):
    if ((i >> j) & 1):
      if num < K:
        s += ls[j]
        num += 1
  if num == K:
    ans.append(s)

print(min(ans))

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

ls = list(map(int, input().split()))
ans = 0

ls2 = sorted(ls)

for i in range(K):
  ans += ls2[i]

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

goukei = 1
for i in ls:
  goukei *= i

if goukei > 10**18:
  print('-1')
else:
  print(goukei)

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

if 0 in ls:
  print('0')
  exit()

goukei = 1
for i in ls:
  goukei *= i

  if goukei > 1000000000000000000:
    print('-1')
    exit()

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

for i in range(1, N+1):
  print(ls.count(i))


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

tmp = [0 for i in range(N+1)]

for i in ls:
  tmp[i] += 1

for i in range(1, N+1):
  print(tmp[i])
Buggy python submission (verdict: Runtime Error):
n = str(input())
wa = 0

for i in range(len(n)):
	n[i] = int(n[i])
	wa += n[i]

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

Fixed submission:
n = str(input())
wa = 0

for i in range(len(n)):
	wa += int(n[i])

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
n = str(input())
wa = 0

for i in n:
	n[i] = int(n[i])
	wa += n[i]

if wa % 9 == 0:
	print('Yes')
else:
	print('No')

Fixed submission:
n = str(input())
wa = 0

for i in range(len(n)):
	wa += int(n[i])

if wa % 9 == 0:
	print('Yes')
else:
	print('No')
Buggy python submission (verdict: Runtime Error):
N = int
a = (N/1000-int(N/1000))*1000
print(a)


Fixed submission:
N = int(input())
a = N % 1000
b = 1000 - a if a!=0 else 0
print(b)
Buggy python submission (verdict: Runtime Error):
Ss = []
for i in range(N):
	Ss.append(input())
	
C0, C1, C2, C3 = 0, 0, 0, 0
for S in Ss:
	if S == 'AC':
		C0 += 1
	elif S == 'WA':
		C1 += 1
	elif S == 'TLE':
		C2 += 1
	else:
		C3 += 1
print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))

Fixed submission:
N = int(input())
Ss = []
for i in range(N):
	Ss.append(input())
	
C0, C1, C2, C3 = 0, 0, 0, 0
for S in Ss:
	if S == 'AC':
		C0 += 1
	elif S == 'WA':
		C1 += 1
	elif S == 'TLE':
		C2 += 1
	else:
		C3 += 1
print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

A.sort(reverse=True)
ans = 0

if N%2 == 1:
	k = (N+1)/2
	for i in range(k):
		ans += A[i]*2
	ans -= A[0]
	ans -= A[k]
else:
	k = N/2
	for i in range(k):
		ans += A[i]*2
	ans -= A[0]

print(ans)

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

A.sort(reverse=True)
ans = 0

for i in range(N-1):
	ans += A[(i+1)//2]

print(ans)

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

A.sort(reverse=True)
ans = 0

if N%2 == 1:
	k = (N+1)/2
	for i in range(k):
		ans += A[i]*2
	ans -= A[0]
	ans -= A[k]
	print(ans)
else:
	k = N/2
	for i in range(k):
		ans += A[i]*2
	ans -= A[0]
	print(ans)

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

A.sort(reverse=True)
ans = 0

for i in range(N-1):
	ans += A[(i+1)//2]

print(ans)

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

A.sort(reverse=True)
ans = 0

if N%2 == 1:
	for i in range((N+1)/2):
		ans += A[i]*2
	ans -= A[0]
	ans -= A[(N+1)/2]
	print(ans)
else:
	for i in range(N/2):
		ans += A[i]*2
	ans -= A[0]
	print(ans)

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

A.sort(reverse=True)
ans = 0

for i in range(N-1):
	ans += A[(i+1)//2]

print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = []
for i in range(N):
	A.append(map(int, input().split()))

A.sort(reverse=True)
ans = 0

if N%2 == 1:
	for i in range((N+1)/2):
		ans += A[i]*2
	ans -= A[0]
	ans -= A[(N+1)/2]
	print(ans)
else:
	for i in range(N/2):
		ans += A[i]*2
	ans -= A[0]
	print(ans)

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

A.sort(reverse=True)
ans = 0

for i in range(N-1):
	ans += A[(i+1)//2]

print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input)
b = a + a^2 * a^3
print(b)

Fixed submission:
a = int(input())
b = a + a*a + a*a*a
print(int(b))
Buggy python submission (verdict: Runtime Error):
s = str(input())
t = str(input())
count = 0

for i in len(s):
	if s[i] != t[i]:
		count += 1

print(count)

Fixed submission:
s = str(input())
t = str(input())
count = 0

for i in range(len(s)):
	if s[i] != t[i]:
		count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
al = str(input())
if al.isupper() = true:
	print('A')
else:
	print('a')

Fixed submission:
al = str(input())
if al.isupper():
	print('A')
else:
	print('a')
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
P = map(int, input().split())

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

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

Pn.sort()
s = 0
for i in range(K):
	s += Pn[K]

print(s)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

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

Pn.sort()
sum = 0
for i in range(K):
	sum += Pn[K]

print(sum)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
Pn = []
for i in range(N):
	Pn.append(input())

Pn.sort()
sum = 0
for i in range(K):
	sum += Pn[K]

print(sum)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
Pn = []
for i in range(N):
	Pn.append(input())

Qn = sorted(Pn)
sum = 0
for i in range(K):
	sum += Qn[K]

print(sum)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
K = int(input())
Pn = []
for i in range(N):
	Pn.append(input())

Qn = sorted(Pn)
sum = 0
for i in range(K):
	sum += Qn[K]

print(sum)

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

P.sort()
s = 0
for i in range(K):
	s += P[i]

print(s)
Buggy python submission (verdict: Runtime Error):
N = input()
if N % 2 == 0:
    A = (N/2)/N
    print(float(A))
else:
    B = ((N+1)/2)/N
    print(float(B))

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print((N/2)/N)
else:
    print(((N+1)/2)/N)
    


Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print((N/2)/N)
else:
    print(((N//2+1)/N))

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print(0.5)
else:
    print((N//2+1)/N)

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print(0.5)
else:
    print(N//2+1/N)
    

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print(0.5)
else:
    print(float((N//2+1)/N))
    

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print(0.5)
else:
    a = N//2+1
    b = a/N
    print(b)
    


Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)

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

if N % 2 == 0:
    print(0.5)
else:
    print((N // 2 + 1)/N)
    

Fixed submission:
N = int(input())

if N % 2 == 0:	
    print((N/2)/N)
else:
    print(((N+1)/2)/N)
Buggy python submission (verdict: Runtime Error):


param_n, param_d = map(int, input().split())

param_count = 0
for i in param_n:
    param_a, param_b = map(int, input().split())
    
    if (param_a)*(param_a) + (param_b)*(param_b) <= (param_d)*(param_d):
        param_count = param_count + 1
        
print(param_count)

Fixed submission:
param_n, param_d = map(int, input().split())

param_count = 0
for i in range(param_n):
    param_a, param_b = map(int, input().split())
    
    if (param_a)*(param_a) + (param_b)*(param_b) <= (param_d)*(param_d):
        param_count = param_count + 1
        
print(param_count)

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

Fixed submission:
param_n, param_d = map(int, input().split())

param_count = 0
for i in range(param_n):
    param_a, param_b = map(int, input().split())
    
    if (param_a)*(param_a) + (param_b)*(param_b) <= (param_d)*(param_d):
        param_count = param_count + 1
        
print(param_count)
Buggy python submission (verdict: Runtime Error):
param_k = int(input())

if param_k % 2 == 0:
  print(-1)
  
elif param_k %  == 0:
  print(-1)
  
else:
  n=0
  for i in range(param_k + 10):
    n = 10n + 7
    if n % 7 == 0:
      print(i+1)
      break
    if i == param_k + 10 - 1:
      print(-1)

Fixed submission:
# https://atcoder.jp/contests/abc174/submissions/15768313 さんの回答、参照

K = int(input())
num = 0
if K%2 == 0:
    print(-1)
else:
    for i in range(1, 1000000):
        num = num*10 + 7
        num %= K
        if num == 0:
            print(i)
            break
    else:
        print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
param_a = int(input())

if param_a%2==0:
    print(-1)
    
elif param_a%5==0:
    print(-1)

else:
    for i in range(1000000):
        param_str = '7'*(i+1)
        param_int = int(param_str)
        
        if param_int % param_a == 0:
            param_answer = i+1
            break
     
    try:
        print(param_answer)
    except:
        print(-1)

Fixed submission:
# https://atcoder.jp/contests/abc174/submissions/15768313 さんの回答、参照

K = int(input())
num = 0
if K%2 == 0:
    print(-1)
else:
    for i in range(1, 1000000):
        num = num*10 + 7
        num %= K
        if num == 0:
            print(i)
            break
    else:
        print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
param_a = int(input())

for i in range(1000000):
    param_str = '7'*(i+1)
    param_int = int(param_str)
    
    if param_int % param_a == 0:
        param_answer = i+1
        break

try:
    print(param_answer)
except:
    print(-1)

Fixed submission:
# https://atcoder.jp/contests/abc174/submissions/15768313 さんの回答、参照

K = int(input())
num = 0
if K%2 == 0:
    print(-1)
else:
    for i in range(1, 1000000):
        num = num*10 + 7
        num %= K
        if num == 0:
            print(i)
            break
    else:
        print(-1)
Buggy python submission (verdict: Runtime Error):
A,B,X=map(int,input().split())
if A>X:
    print("NO")
elif A<=X=<A+B:
    print("YES")
else :
    print("NO")

Fixed submission:
A,B,X=map(int,input().split())
if A>X:
    print("NO")
elif A<=X<=A+B:
    print("YES")
else :
    print("NO")
Buggy python submission (verdict: Runtime Error):
    X=int(input())
    A=int(input())
    B=int(input())
    a=X-A
    b=int(a/B)
    print(a-b*B)

Fixed submission:
X=int(input())
A=int(input())
B=int(input())
a=X-A
b=int(a/B)
print(a-b*B)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if b-a=c-b:
    print("YES")
else:
    print("NO")
    
    


Fixed submission:
a,b,c=map(int,input().split())
if b-a==c-b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
elif A==B==1 :
    print("Draw")
if A==1:
    print("Alice")
elif B==1 :
    print("Bob")
elif A<B:
    print("Bob")
elif A>B:
    print("Alice")
elif A==B:
    print("Draw")

Fixed submission:
A,B=map(int,input().split())
if A==B==1 :
    print("Draw")
elif A==1:
    print("Alice")
elif B==1 :
    print("Bob")
elif A<B:
    print("Bob")
elif A>B:
    print("Alice")
elif A==B:
    print("Draw")

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A==1:
    print(Alice)
elif B==1 :
    print(Bob)
elif A==B==1 :
    print(Draw)
elif A<B:
    print(Bob)
elif A>B:
    print(Alice)
elif A==B:
    print(Draw)

Fixed submission:
A,B=map(int,input().split())
if A==B==1 :
    print("Draw")
elif A==1:
    print("Alice")
elif B==1 :
    print("Bob")
elif A<B:
    print("Bob")
elif A>B:
    print("Alice")
elif A==B:
    print("Draw")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a=b=c :
    print(1)
elif a=b and not b=c:
    print(2)
elif b=c and not a=c :
    print(2)
elif c=a and not a=b :
    print(2)
else :
    print(3)


Fixed submission:
a,b,c=map(int,input().split())
if a==b==c :
    print(1)
elif a==b and not b==c:
    print(2)
elif b==c and not a==c :
    print(2)
elif c==a and not a==b :
    print(2)
else :
    print(3)
Buggy python submission (verdict: Runtime Error):
from decimal import *
a,b=map(int,input().split())
kotae=Decimal(a)*Decimal(b)
kotae=kotae%1
print(kotae)

Fixed submission:
from decimal import *
a,b=map(Decimal,input().split())
kotae=Decimal(a)*Decimal(b)
print(int(kotae))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = input().split(" ")
lista = [int(n) for n in a]
for i in range (1,n):
  print(lista.count(i))
print(0)

Fixed submission:
n = int(input())
a = input().split(" ")
lista = [int(n) for n in a]
listb = [0]*n
for i in range (n-1):
  l = lista[i]
  listb[l-1] += 1
[print(i) for i in listb]