Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
info=input().split()

D=info[0]
S=info[1]
T=info[2]

if D/S<=T:
  print('Yes')
else:
  print('No')

Fixed submission:
info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[2])
 
if D/S<=T:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
if D/S<=T:
  print("Yes")
else:
  print("No")

Fixed submission:
info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[2])
 
if D/S<=T:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
total_minute=D/S
 
if total_minute<=T:
  print("Yes")
else:
  print("No")

Fixed submission:
info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[2])
 
if D/S<=T:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
total_minute=D/S

if total_minute<=T:
  print("Yes")
else:
  print("No

Fixed submission:
info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[2])
 
if D/S<=T:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
def main():
  s = input()
  ans = 'A' s.isupper() else 'a'
  print(ans)
  
  
  
if __name__ == '__main__':
  main()

Fixed submission:
def main():
  s = input()
  ans = 'A' if s.upper() == s else 'a'
  print(ans)
    
    
    
 
if __name__ == '__main__':
  main()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,(input().split())))
u = 1  
 
if 0 in a:
  print(0)
else:
  for i in a:
    u *=i
  if u > 1000000000000000000:
    print(-1)
  else:
    print(u)

Fixed submission:
import sys
def main():
  u = 1  
  n = int(input())
  a = list(map(int,(input().split())))
  
  if 0 in a:
    print(0)
    sys.exit()
	
  for i in a:
    u *=i
    if u > 1000000000000000000:
      print(-1)
      sys.exit()

  print(u)


main()

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

if 0 in a:
  print(0)
else:
  for i in a:
    u *=i
  if u > 1000000000000000000:
    print(-1)
  else:
    print(u)

    

    

  
  

Fixed submission:
import sys
def main():
  u = 1  
  n = int(input())
  a = list(map(int,(input().split())))
  
  if 0 in a:
    print(0)
    sys.exit()
	
  for i in a:
    u *=i
    if u > 1000000000000000000:
      print(-1)
      sys.exit()

  print(u)


main()
Buggy python submission (verdict: Runtime Error):
s = list(input())
n = int(input())
p = []
for i in range(n):
  i =(input().split())
  if i[0] == '1':
    s = s[::-1]
  elif i[0] =='2':
    if i[1] == '1':
      s.insert(0,i[2])
    else:
      s.append(i[2])
#  count +=1      
      
#print(s)      
      
s = ''.join(s)
print(s)
      
      
      

Fixed submission:
n, a ,b = list(map(int,(input().split())))
k = n//(a+b)
am = n%(a+b)

print(a*k+min(am,a))
Buggy python submission (verdict: Runtime Error):
a,b = list(map(int,(input().split())))
temp_a = int(a/0.08)
temp_b = int(b/0.1)
ans = 0
#print(temp_a,temp_b)
for i in range(min(temp_a,temp_b)/2,max(temp_b,temp_a)+1):
  if  int(i* 0.08) == int(i * 0.1) or temp_a == temp_b:
    ans = i
    break
    
if ans:
  print(ans)
else:
  print(-1)

Fixed submission:
a ,b = list(map(int,(input().split())))
ans = 0
for i in range(1,10000):
  if int(i * 0.08) == a and int(i * 0.1) == b:
    ans = i
    break
  else  :
    ans = -1
    
    
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
h, n = list(map(int,(input().split())))
a = list(map(int,(input().split())))
import sys
sys.setrecursionlimit(10 ** 9) #再帰用

a.sort()

if h >= n and n !=0 :
  for i in range(n):
    a.pop()
    ans = sum(a)
elif n ==0:
  ans = sum(a)
else:
  ans = 0
  
print(ans)

Fixed submission:
h, n = list(map(int,(input().split())))
a = list(map(int,(input().split())))
import sys
sys.setrecursionlimit(10 ** 9) #再帰用

a.sort(reverse=True)

if h >= n and n !=0 :
  a = a[n:]
  ans = sum(a)
elif n ==0:
  ans = sum(a)
else:
  ans = 0
  
print(ans)
Buggy python submission (verdict: Runtime Error):
a =list(map(int,input().split(' ')))
[print('Yes') if a[0] == a[1] print('No')]

Fixed submission:
a =list(map(int,input().split(' ')))
[print('Yes') if a[0] == a[1] else print('No')]
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = list(map(int, input().split()))
ans  = 0
for i in range(n):
  if p[i] == min(p[:i+1]):
        ans+=1 
                 
print(ans)                 
                 

Fixed submission:
n = int(input())
p = list(map(int, input().split()))
ans  = 0
current = max(p)+1
for i in range(n):
  if p[i]  <= current:
    current = p[i]
    ans +=1
  
#  if p[i] == min(p[:i+1]):
#        ans+=1 
                 
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = list(map(int, input().split()))
ans  = 0
for i in range(n):
  if p[i] == min(p[:i+1]):
        ans+=1 
                 
print(ans)                 
                 

Fixed submission:
n = int(input())
p = list(map(int, input().split()))
ans  = 0
current = max(p)+1
for i in range(n):
  if p[i]  <= current:
    current = p[i]
    ans +=1
  
#  if p[i] == min(p[:i+1]):
#        ans+=1 
                 
print(ans)
Buggy python submission (verdict: Runtime Error):
m = [1,2,3]
a = int(input())
b = int(input())

m.pop(a-1)
m.pop(b-1)
print(m[0])

Fixed submission:
m = [1,2,3]
a = int(input())
b = int(input())

m.pop(m.index(a))
m.pop(m.index(b))
print(m[0])
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
import math
import numpy as np
z = []
N = int(input())
for i in range(N):
  z.append(list(map(int,input().split(' '))))
d = 0  
x = []
p = list(itertools.permutations(z, N))
#print(p,N)  
for i in p:
  #print(i)
  #ans = math.sqrt((i[0][0]-i[1][0])**2) + math.sqrt((i[0][1]-i[1][1])**2)
  for j in range(N-1):
    #print(j,i)
    d += np.linalg.norm(np.array([i[j+1][0],i[j+1][1]]) - np.array([i[j][0],i[j][1]]))
    #print(([i[j+1][0],i[j+1][1]]), ([i[j][0],i[j][1]]))
  x.append(d) 
  d = 0
  
  
#  print(ans)
  
#print(x)  
print(sum(x)/len(x))  

Fixed submission:
import itertools
import math
import numpy as np
z = []
N = int(input())
for i in range(N):
  z.append(list(map(int,input().split(' '))))
d = 0  
x = []
p = list(itertools.permutations(z, N))
#print(p,N)  
for i in p:
  #print(i)
  #ans = math.sqrt((i[0][0]-i[1][0])**2) + math.sqrt((i[0][1]-i[1][1])**2)
  for j in range(N-1):
    #print(j,i)
    #d += np.linalg.norm(np.array([i[j+1][0],i[j+1][1]]) - np.array([i[j][0],i[j][1]]))
    d += math.sqrt(((i[j][0]-i[j+1][0])**2) + ((i[j][1]-i[j+1][1])**2))
    #print(([i[j+1][0],i[j+1][1]]), ([i[j][0],i[j][1]]))
  x.append(d) 
  d = 0
  
  
#  print(ans)
  
#print(x)  
print(sum(x)/len(x))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,(input().split(' '))))
#b = sorted(a)
ans = []
#l = range(0,n)
x = [print(a.index(i)+1) for i in range(1,n+1)]
   
#print(x)  
#print(' '.join(x))

Fixed submission:
n = int(input())
a = list(map(int,(input().split(' '))))
b = sorted(a)

from collections import OrderedDict
od = OrderedDict()

for n,i in enumerate(a):
  od[(n+1)] = i

#print(od)

od_sorted_value = OrderedDict(
    sorted(od.items(), key=lambda x: x[1], reverse=False)
)
#print(od_sorted_value)

ans = list(od_sorted_value.items())
for i,n in ans:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,(input().split(' '))))
#b = sorted(a)
ans = []
#l = range(0,n)
x = [str(a.index(i)+1) for i in range(1,n+1)]
   
#print(x)  
print(' '.join(x))

Fixed submission:
n = int(input())
a = list(map(int,(input().split(' '))))
b = sorted(a)

from collections import OrderedDict
od = OrderedDict()

for n,i in enumerate(a):
  od[(n+1)] = i

#print(od)

od_sorted_value = OrderedDict(
    sorted(od.items(), key=lambda x: x[1], reverse=False)
)
#print(od_sorted_value)

ans = list(od_sorted_value.items())
for i,n in ans:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,(input().split(' '))))
ans = []
l = range(1,n+1)
for i in range(n):
   ans.append(str(a.index(l[i])+1))
  
#print((ans)  )
print(' '.join(ans))

Fixed submission:
n = int(input())
a = list(map(int,(input().split(' '))))
b = sorted(a)

from collections import OrderedDict
od = OrderedDict()

for n,i in enumerate(a):
  od[(n+1)] = i

#print(od)

od_sorted_value = OrderedDict(
    sorted(od.items(), key=lambda x: x[1], reverse=False)
)
#print(od_sorted_value)

ans = list(od_sorted_value.items())
for i,n in ans:
  print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k)
for i in range(q):
  point-=1
  point[int(input())-1]+=1

  
  
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k-q)
for i in range(q):
  win = int(input())
  point[win-1]+=1
  
  
#print(np.where(point>0,'Yes','No'))
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(k, n)
for i in range(q):
  point-=1
  point[int(input())-1]+=1

for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k-q)
for i in range(q):
  win = int(input())
  point[win-1]+=1
  
  
#print(np.where(point>0,'Yes','No'))
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point = [k]*n
point = np.array(point)
#print(point)
last_point = []
for i in range(q):
  point-=1
#  print(point)
  point[int(input())-1]+=1
#  print(point)
  
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = list(map(int,input().split(' ')))
import numpy as np
point =np.full(n,k-q)
for i in range(q):
  win = int(input())
  point[win-1]+=1
  
  
#print(np.where(point>0,'Yes','No'))
for i in point:
  if i>0:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
h = list(map(int,input().split(' ')))
h_d = np.diff(h)

ans = 0
ans_a = [0]
first_h_d = h_d[0]

#print(h_d)
for i in h_d:
  if first_h_d <= i and  h_d[0]<= 0 :
    ans+=1
    first_h_d = i
  else:
    ans_a.append(ans)
    ans = 0
    first_h_d = i

print(max(ans_a))

Fixed submission:
#import numpy as np
n = int(input())
h = list(map(int,input().split(' ')))
#h_d = np.diff(h)

ans = 0
ans_a = [0]
#first_h_d = h_d[0]
first_h = h[0]
#print(h_d)
for i in h[1:]:
  #print(first_h,i,first_h >= i)
  if first_h >= i:
    ans+=1
    first_h = i
  else:
    ans_a.append(ans)
 #   print(ans)
    ans = 0
    first_h = i

ans_a.append(ans)

print(max(ans_a))

Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
h = list(map(int,input().split(' ')))
h_d = np.diff(h)

ans = 0
ans_a = [0]
first_h_d = h_d[0]
#print(h_d)
for i in h_d:
  if first_h_d <= i:
    ans+=1
    first_h_d = i
  else:
    ans_a.append(ans)
    ans = 0
    first_h_d = i
    
    
    
print(max(ans_a))

Fixed submission:
#import numpy as np
n = int(input())
h = list(map(int,input().split(' ')))
#h_d = np.diff(h)

ans = 0
ans_a = [0]
#first_h_d = h_d[0]
first_h = h[0]
#print(h_d)
for i in h[1:]:
  #print(first_h,i,first_h >= i)
  if first_h >= i:
    ans+=1
    first_h = i
  else:
    ans_a.append(ans)
 #   print(ans)
    ans = 0
    first_h = i

ans_a.append(ans)

print(max(ans_a))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for _ in range(n):
  a.append(int(input()))
  
for i in range(n):
  b = a.copy()
  b.remove(b[i])
  print(max(b))
  
  
  
  
  

Fixed submission:
n = int(input())
a = []
x = 0
x_max = 0
for _ in range(n):
  x = int(input())
#  if x_max 
  a.append(x)

b = a.copy()  
b.sort(reverse=True)
a_max1 = b[0]
a_max2 = b[1] 

for i in a:
  if i == a_max1:
    print(a_max2)
  else:
    print(a_max1)

Buggy python submission (verdict: Time Limit Exceeded):
import array
from copy import deepcopy

n = int(input())
a = []
for i in range(n):
  a.append(int(input()))

a = array.array('i',a)
           
for i in range(0,len(a)):
  ax = deepcopy(a)
  del a[i]

  print(max(a))
  a = deepcopy(ax)
  

  #  if 1+i<=len(a):
#    print('i:' ,i)
#    print(max(a[i],a[i+1]))

        
#print(max(a[0],a[-1]   )   )  

Fixed submission:
n = int(input())
a = []
x = 0
x_max = 0
for _ in range(n):
  x = int(input())
#  if x_max 
  a.append(x)

b = a.copy()  
b.sort(reverse=True)
a_max1 = b[0]
a_max2 = b[1] 

for i in a:
  if i == a_max1:
    print(a_max2)
  else:
    print(a_max1)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
  a.append(int(input()))

           
for i in range(0,len(a)):
  ax = a.copy()
  del a[i]
  print(max(a))
  a = ax.copy()
  

  #  if 1+i<=len(a):
#    print('i:' ,i)
#    print(max(a[i],a[i+1]))

        
#print(max(a[0],a[-1]   )   )  

Fixed submission:
n = int(input())
a = []
x = 0
x_max = 0
for _ in range(n):
  x = int(input())
#  if x_max 
  a.append(x)

b = a.copy()  
b.sort(reverse=True)
a_max1 = b[0]
a_max2 = b[1] 

for i in a:
  if i == a_max1:
    print(a_max2)
  else:
    print(a_max1)
Buggy python submission (verdict: Runtime Error):
s = list(input())
s_ = len(s_)

a_ = len(set(s_))

if s_ > s_:
  print('Yes')
else:
  print('No')

Fixed submission:
s = list(input())
s_ = len(s)

a_ = len(set(s))

if s_ == a_*2:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
import fractions
import itertools
n = int(input())
x = list(map(int,input().split()))
p = list(itertools.combinations(x,2))
ar = []
for n in range(0,len(p)):
	ar.append(fractions.gcd(p[n][0],p[n][1]))
print(max(ar))

Fixed submission:
n = list(map(int,input().split()))
print(int((n[2]+0.5)/n[0])*n[1])
Buggy python submission (verdict: Runtime Error):
n = list(input())
n_size = len(n)
count = 0
#print(n_size)  
new_list = []
new_list.append(int(n[0]))
for i in range(n_size-1):
  if new_list[i] == 0:
    new_list.append(1)
  else:
    new_list.append(0)

#print(new_list)
    
for i in range(n_size):
  if (int(n[i]) != int(new_list[i])):
    count+=1

#print(new_list)    
if n_size == 1:
  print(0)
else:
#  ans = n_size-count    
  print(count)    
    


Fixed submission:
n = input().split()
count = 0
if int(n[0]) > int(n[1]):
  count +=int(n[0])
  if int(n[0])-1 > int(n[1]):
    count +=int(n[0])-1
  else:
    count +=int(n[1])
else:
  count +=int(n[1])
  if int(n[1])-1 > int(n[0]):
	  count +=int(n[1])-1
  else:
	  count +=int(n[0])

print(count)
Buggy python submission (verdict: Runtime Error):
N, M, X, Y = list(map(int,input().split(' ')))
x = list(map(int,input().split(' ')))
y = list(map(int,input().split(' ')))

ans = 'War'
for i in range(X,Y+1):
  if  max(x) < i <= min(y) and X < i <=y:
    ans ='No War'
    break
    

print(ans)    
    
    
    
    
  


Fixed submission:
N, M, X, Y = list(map(int,input().split(' ')))
x = list(map(int,input().split(' ')))
y = list(map(int,input().split(' ')))

ans = 'War'
for i in range(X+1,Y+1):
  if  max(x) < i <= min(y):
    ans ='No War'
    break
    

print(ans)
Buggy python submission (verdict: Runtime Error):
D,N = list(map(int,input().split(' ')))
#ar = [ar.append(100**D*i) for i in range(1,N+1)

for i in range(1,N+1):
  ar.append(100**D*i)
 
  
print(ar[-1])

Fixed submission:
D,N = list(map(int,input().split(' ')))
#ar = [ar.append(100**D*i) for i in range(1,N+1)
ar = []
if N <100:
  for i in range(1,N+1):
    ar.append(100**D*i)
else:
  for i in range(1,N+2):
    ar.append(100**D*i)
    
  
print(ar[-1])
Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = list(map(int,input().split(' ')))
'''
x = [i for i in range(A,B+1)]
s_f,s_b = x[:K],x[len(x)-K:]
ans = s_f + s_b
ans =list(set(ans))
#ans.sort()

'''
if len(range(A,B+1))<K:
  [print(i) for i in range(A,B+1)]
else:
  x = [i for i in range(A,B+1)]
  s_f,s_b = x[:K],x[len(x)-K:]
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

  
  
       

Fixed submission:
A, B, K = list(map(int,input().split(' ')))
'''
x = [i for i in range(A,B+1)]
s_f,s_b = x[:K],x[len(x)-K:]
ans = s_f + s_b
ans =list(set(ans))
#ans.sort()
if len(range(A,B+1))<K:
  [print(i) for i in range(A,B+1)]
else:
  x = [i for i in range(A,B+1)]
  s_f,s_b = x[:K],x[len(x)-K:]
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

'''
if (B-A+1)<K:
  s =  list(range(A,B+1))
  [print(i) for i in s]
else:           
  s_f = list(range(A,A+K))
  s_b = list(range(B,B-K,-1))
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = list(map(int,input().split(' ')))
x = [i for i in range(A,B+1)]
s_f,s_b = x[:K],x[len(x)-K:]
ans = s_f + s_b
ans =list(set(ans))
ans.sort()

[print(i) for i in ans]


Fixed submission:
A, B, K = list(map(int,input().split(' ')))
'''
x = [i for i in range(A,B+1)]
s_f,s_b = x[:K],x[len(x)-K:]
ans = s_f + s_b
ans =list(set(ans))
#ans.sort()
if len(range(A,B+1))<K:
  [print(i) for i in range(A,B+1)]
else:
  x = [i for i in range(A,B+1)]
  s_f,s_b = x[:K],x[len(x)-K:]
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

'''
if (B-A+1)<K:
  s =  list(range(A,B+1))
  [print(i) for i in s]
else:           
  s_f = list(range(A,A+K))
  s_b = list(range(B,B-K,-1))
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = list(map(int,input().split(' ')))
x = [i for i in range(A,B+1)]
leng = len(x)
s_f = x[:K]
s_b = x[leng-K:]
ans = s_f + s_b
ans =list(set(ans))
ans.sort()

for i in ans:
  print(i)

Fixed submission:
A, B, K = list(map(int,input().split(' ')))
'''
x = [i for i in range(A,B+1)]
s_f,s_b = x[:K],x[len(x)-K:]
ans = s_f + s_b
ans =list(set(ans))
#ans.sort()
if len(range(A,B+1))<K:
  [print(i) for i in range(A,B+1)]
else:
  x = [i for i in range(A,B+1)]
  s_f,s_b = x[:K],x[len(x)-K:]
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]

'''
if (B-A+1)<K:
  s =  list(range(A,B+1))
  [print(i) for i in s]
else:           
  s_f = list(range(A,A+K))
  s_b = list(range(B,B-K,-1))
  ans = s_f + s_b
  ans =list(set(ans))
  ans.sort()
  [print(i) for i in ans]
Buggy python submission (verdict: Runtime Error):
N = int(input())
import math
for i in range(N,1,-1):
  sq = math.sqrt(i)
  if sq.is_integer():
    ans = i
    break

print(ans)    

Fixed submission:
N = int(input())
import math
for i in range(N,-1,-1):
  sq = math.sqrt(i)
  if sq.is_integer():
    ans = i
    break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N  = int(input())
p = 1
for i in range(1,N+1):
  p*=i
  
print(p%(10**9+7)  )

Fixed submission:
N  = int(input())
#N = 10**5
p = 1
#x = [p*i for i in range(1,N+1)]
for i in range(1,N+1):
  p =i*p%(10**9+7)
#  print(p)
  
  
  
print(p)

Buggy python submission (verdict: Runtime Error):
N  = int(input())
p = 1
for i in range(1,N+1):
  p*=i
  
print(p/(10**9+7)  )

Fixed submission:
N  = int(input())
#N = 10**5
p = 1
#x = [p*i for i in range(1,N+1)]
for i in range(1,N+1):
  p =i*p%(10**9+7)
#  print(p)
  
  
  
print(p)
Buggy python submission (verdict: Time Limit Exceeded):
n = list(map(int, (input()).split(' ')))
#print(n)
x = [ i   for i in range(n[0]+1)]
#y = [ i   for i in range(n[1]+1)]
#z = [ i   for i in range(n[1]+1)]
#print(x)
counter = 0
for x1 in x:
  for y1 in x:
    for z1 in x:
      if x1+y1+z1== n[1]:
        counter +=1

        
print(counter)        

Fixed submission:
n = list(map(int, (input()).split(' ')))
#n = [2500,7500]
#print(n)
x = [ i   for i in range(n[0]+1)]
#y = [ i   for i in range(n[1]+1)]
#z = [ i   for i in range(n[1]+1)]
#print(x)
counter = 0
if n[0]*3 >= n[1]:
  for x1 in x:
    for y1 in x:
      if 0<= n[1]-x1-y1 <=n[0]  :
          counter +=1

        
print(counter)
Buggy python submission (verdict: Runtime Error):
s = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if s== 600000:
    s = 1000000
print(s)

Fixed submission:
s = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if s== 600000:
    s = 1000000
print(s)

Buggy python submission (verdict: Runtime Error):
total = 0
for i in map(int, input().split()):
    if i == 1:
        total=total+300000
    elif i == 2:
        total=total+200000
    elif i == 3:
        total=total+100000
if total==600000:
    total=1000000
print(total)

Fixed submission:
s = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if s== 600000:
    s = 1000000
print(s)

Buggy python submission (verdict: Runtime Error):
n=0
for i in map(int, input().split()):
    if i==1:
        n+= 300000
    elif i==2:
        n+= 200000
    elif i==3:
        n+= 100000
if n==600000:
    n=1000000
print(n)

Fixed submission:
s = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if s== 600000:
    s = 1000000
print(s)

Buggy python submission (verdict: Runtime Error):
total = 0
for i in map(int, input().split()):
    if i == 1:
        total+= 300000
    elif i == 2:
        total+= 200000
    elif i == 3:
        toal+= 100000
if total == 600000:
    total = 1000000
print(total)

Fixed submission:
s = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if s== 600000:
    s = 1000000
print(s)
Buggy python submission (verdict: Time Limit Exceeded):
a = input().rstrip().split(" ")
K = int(a[0])
A = int(a[1])
B = int(a[2])

bis = 1
coin = 0

if B - A > 1:
    for i in range(K):
        if coin > 0:
            bis += B
            coin -= 1
        elif bis >= A and K - i > 1:
            bis -= A
            coin += 1
        else:
            bis += 1
else:
    for i in range(K):
        bis += 1

print(bis)

Fixed submission:
a = input().rstrip().split(" ")
K = int(a[0])
A = int(a[1])
B = int(a[2])

bis = 1

if B - A > 1:
    if K >= A + 1:
        # bis = (K - (A - 1)) // 2 * (B - A) + A
        koukan = (K - (A - 1)) // 2
        koukan_turn = koukan * 2
        nokori_turn = K - koukan_turn
        bis += koukan * (B - A) + nokori_turn
    else:
        bis += K
else:
    bis += K
    
print(bis)
Buggy python submission (verdict: Runtime Error):
K = str(input)
S = input()
if len(S)<=K:
    print(S)
else:
    print(S[:K]+'...')

Fixed submission:
K = int(input())
S = input()
if len(S)<=K:
    print(S)
else:
    print(S[:K]+'...')
Buggy python submission (verdict: Runtime Error):
a,b,c,k = map(int,input())
if k<a:
    print(k)
elif k < a+b:
    print(a)
else:
    print(2*a+b-k)

Fixed submission:
a,b,c,k = map(int,input().split())
if k<a:
    print(k)
elif k < a+b:
    print(a)
else:
    print(2*a+b-k)
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = (input().split())
a_str = ''.join(a)
a_str2 = a_str
sum = 0
l_dict = {}
while len(a_str)>0:
    n = a.count(a_str[0])
    sum += int(n*(n-1)/2)
    l_dict[a_str[0]] = n
    a_str = a_str.replace(a_str[0],'')
for k in range(N):
    print(sum-l_dict[a_str2[k]]+1)


Fixed submission:
N,M = map(int,input().split())
sum = 0
sum+=N*(N-1)/2
sum+=M*(M-1)/2
print(int(sum))

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
sum = 0
sum+=N*(N-1)/2
sum+=M*(M-1)/2
print(int(sum)

Fixed submission:
N,M = map(int,input().split())
sum = 0
sum+=N*(N-1)/2
sum+=M*(M-1)/2
print(int(sum))
Buggy python submission (verdict: Runtime Error):
H, A = input().split()

n = round((int(H)/int(A)) + 0.5)

print(n)10

Fixed submission:
H, A = input().split()

n = (int(H)/int(A)) +(int(H)%int(A)>0)

print(int(n))