Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
K = int(input())
pool = set()
n = 0
slist = list(s)

for i in range(26):
  c = s.count(chr(97+ i))
  for j in range(c):
    index = slist.index(chr(97+ i))
    slist[index] = ""
    for k in range(len(s)- index):
      pool.add(s[index:index+ k+ 1])
  if(len(pool)>= K):
    newlist = list(pool)
    newlist.sort()
    print(newlist[K- 1])
    break

Fixed submission:
s = input()
K = int(input())
pool = set()
n = 0
slist = list(s)

for i in range(26):
  c = s.count(chr(97+ i))
  for j in range(c):
    index = slist.index(chr(97+ i))
    slist[index] = ""
    for k in range(len(s)- index):
      pool.add(s[index:index+ k+ 1])
      if(k>= K):
        break
  if(len(pool)>= K):
    newlist = list(pool)
    newlist.sort()
    print(newlist[K- 1])
    break

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
K = int(input())
pool = set()

for i in range(len(s)):
  for j in range(i+ 1, len(s)+ 1):
    news = s[i:j]
    pool.add(news)
    
plis = list(pool)
plis.sort()

print(plis[K- 1])

Fixed submission:
s = input()
K = int(input())
pool = set()
n = 0
slist = list(s)

for i in range(26):
  c = s.count(chr(97+ i))
  for j in range(c):
    index = slist.index(chr(97+ i))
    slist[index] = ""
    for k in range(len(s)- index):
      pool.add(s[index:index+ k+ 1])
      if(k>= K):
        break
  if(len(pool)>= K):
    newlist = list(pool)
    newlist.sort()
    print(newlist[K- 1])
    break
Buggy python submission (verdict: Time Limit Exceeded):
def median(lista):
  lista = sorted(lista)
  return lista[int((len(lista)+ 1)/ 2)- 1]

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

for i in range(N):
  if(i == 0):
    newlista = lista[1:]
  elif(i == N- 1):
    newlista = lista[:N- 1]
  else:
  	newlista = lista[:i]+ lista[i+ 1:]
   
  print(median(newlista))

Fixed submission:
N = int(input())
lista = list(map(int, input().split()))
newlista = sorted(lista)

lowermedian = newlista[int(len(lista)/ 2- 1)]
highermedian = newlista[int(len(lista)/2)]

for i in range(N):
  if(lista[i] <= lowermedian):
    print(highermedian)
  else:
    print(lowermedian)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []

for i in range(N):
    A.append(input())

i = 0
while i< len(A):
    C = A.count(A[i])
    P = A[i]
    if(C > 1 and C % 2 == 0):
        for j in range(C):
            A.remove(P)
    elif(C > 1):
        for k in range(C- 1):
            A.remove(P)
        i+= 1
    else:
        i+= 1
    
print(len(A))

Fixed submission:
N = int(input())
A = []
B = []
for i in range(N):
  A.append(int(input()))
  
A.sort()
B.append(1)

for i in range(1, N):
  if(A[i]!= A[i- 1]):
    B.append(1)
  else:
    B[-1]+= 1
  i+= 1
  
ans = list(filter(lambda x: x % 2 == 1, B))

print(len(ans))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = []

for i in range(N):
  list_A.append(input())

i = 0

while i< len(list_A):
  a = list_A[i]
  b = list_A.count(a)
  if(b > 1 and b % 2 == 0):
    for j in range(b):
      list_A.remove(a)
  elif(b > 1):
    for k in range(b- 1):
      list_A.remove(a)
  else:
    i+= 1

ans = len(list_A)

print(ans)

Fixed submission:
N = int(input())
A = []
B = []
for i in range(N):
  A.append(int(input()))
  
A.sort()
B.append(1)

for i in range(1, N):
  if(A[i]!= A[i- 1]):
    B.append(1)
  else:
    B[-1]+= 1
  i+= 1
  
ans = list(filter(lambda x: x % 2 == 1, B))

print(len(ans))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = []

for i in range(N):
  a = input()
  if(a in list_A):
    list_A.remove(a)
  else:
    list_A.append(a)

ans = len(list_A)

print(ans)

Fixed submission:
N = int(input())
A = []
B = []
for i in range(N):
  A.append(int(input()))
  
A.sort()
B.append(1)

for i in range(1, N):
  if(A[i]!= A[i- 1]):
    B.append(1)
  else:
    B[-1]+= 1
  i+= 1
  
ans = list(filter(lambda x: x % 2 == 1, B))

print(len(ans))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
t = []
for i in range(N):
  t.append(int(input()))
  
t.sort()
t.reverse()

lcm = t[0]  
  
for i in range(1,N):
  j = 1
  while(lcm % t[i] != 0):
    lcm = lcm* (j+ 1)// j
    j+= 1
    
print(lcm)

Fixed submission:
import fractions
N = int(input())
t = []
for i in range(N):
  t.append(int(input()))
  
lcm = 1

for i in range(N):
  lcm = lcm* t[i]// fractions.gcd(lcm, t[i])
  
print(lcm)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
array = []

for i in range(N):
  a, b = map(int, input().split())
  array.extend([a]*b)
                
array.sort()

print(array[K- 1])

Fixed submission:
N, K = map(int, input().split())
array = [0]*(10**5+ 1)

for i in range(N):
  a, b = map(int, input().split())
  array[a]+= b
  
S = 0
i = 0

while S < K:
  S+= array[i]
  i+= 1
  
print(i- 1)

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

for i in range(N):
  a, b = map(int, input().split())
  for j in range(b):
    array.append(a)
    
array.sort()

print(array[K- 1])

Fixed submission:
N, K = map(int, input().split())
array = [0]*(10**5+ 1)

for i in range(N):
  a, b = map(int, input().split())
  array[a]+= b
  
S = 0
i = 0

while S < K:
  S+= array[i]
  i+= 1
  
print(i- 1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
l = len(a)
b = [int(-a[0]/ abs(a[0]))]
for i in range(1, l):
  b.append(a[i])
ans = 0
summary = a[0]

if(summary == 0):
  if(a[1] > 0):
    summary = -1
    ans+= 1
  else:
    summary = 1
    ans+= 1

for i in range(1, l):
  if(summary* (summary+ a[i])>= 0):
    if(summary > 0):
      ans+= a[i]+ summary+ 1
      a[i] = -summary- 1 
      summary= -1
    else:
      ans+= -summary+ 1- a[i]
      a[i] = -summary+ 1
      summary= 1
  else:
    summary+= a[i]

Ans = 0
Summary = b[0]

if(Summary == 0):
  if(b[1] > 0):
    Summary = -1
    Ans+= 1
  else:
    Summary = 1
    Ans+= 1

for i in range(1, l):
  if(Summary* (Summary+ b[i])>= 0):
    if(Summary > 0):
      Ans+= b[i]+ Summary+ 1
      b[i] = -Summary- 1 
      Summary= -1
    else:
      Ans+= -Summary+ 1- b[i]
      b[i] = -Summary+ 1
      Summary= 1
  else:
    Summary+= b[i]
    
print(min(ans, Ans))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
l = len(a)
b = []
for i in range(l):
  b.append(a[i])
  
ans = 0
Ans = 0
summary = a[0]

if(summary == 0):
  summary = 1
  ans+= 1
  Summary = -1
  Ans+= 1
else:
  b[0] = int(-a[0]/ abs(a[0]))
  Ans+= abs(a[0]- b[0])
  Summary = b[0]  
  
for i in range(1, l):
  if(summary* (summary+ a[i])>= 0):
    if(summary > 0):
      ans+= a[i]+ summary+ 1
      a[i] = -summary- 1 
      summary= -1
    else:
      ans+= -summary+ 1- a[i]
      a[i] = -summary+ 1
      summary= 1
  else:
    summary+= a[i]

for i in range(1, l):
  if(Summary* (Summary+ b[i])>= 0):
    if(Summary > 0):
      Ans+= b[i]+ Summary+ 1
      b[i] = -Summary- 1 
      Summary= -1
    else:
      Ans+= -Summary+ 1- b[i]
      b[i] = -Summary+ 1
      Summary= 1
  else:
    Summary+= b[i]
    
print(min(ans, Ans))
Buggy python submission (verdict: Time Limit Exceeded):
import math

N = int(input())
n = int(math.sqrt(N))

while n<= N:
  if(N % n == 0):
    break
  else:
    n += 1
    
print(len(str(n)))

Fixed submission:
import math

N = int(input())
n = 1
divisor = []

while n*n<= N:
  if(N % n == 0):
    divisor.append(n)
  n+= 1
  
max_divisor = divisor[-1]

print(len(str(N// max_divisor)))
Buggy python submission (verdict: Runtime Error):
S = input[0]
cnt = 0
for i in range(3):
  if S[i] == 'R':
    # count, 前の文字列がR or nullならcnt+1、そうでない場合、1
    # 
    if i == 0 or S[i - 1] == 'R':
	  cnt += 1
    else:
      cnt = 1
print(cnt)

Fixed submission:
S = input()
cnt = 0
for i in range(3):
    if S[i] == 'R':
        # count, 前の文字列がR or nullならcnt+1、そうでない場合、1
        if i == 0 or S[i - 1] == 'R':
            cnt += 1
        else:
            cnt = 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = list(map(int,input().strip().split()))
L_sort = L.sort()
count = 0
for i in range(N-2):
	for j in range(i+1 , N):
		for k in range(j+1 , N):
        		if L_sort(i) + L_sort(j) > L_sort(k):
            		count += 1
print(count)


Fixed submission:
input_weather = input()
if input_weather.count('RRR') == 1:
	print(3)
elif input_weather.count('RR') == 1:
    print(2)
elif input_weather.count('R') >= 1:
    print(1)
else :
    print(0)

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = list(map(int,input().strip().split()))
L_sort = L.sort()
count = 0
for i in range(N-2):
	for j in range(i+1 , N):
		for k in range(j+1 , N):
        	if L_sort(i) + L_sort(j) > L_sort(k):
            	count += 1
print(count)

Fixed submission:
input_weather = input()
if input_weather.count('RRR') == 1:
	print(3)
elif input_weather.count('RR') == 1:
    print(2)
elif input_weather.count('R') >= 1:
    print(1)
else :
    print(0)
Buggy python submission (verdict: Runtime Error):
X = input()
if X>=30:
  print('Yes')
else:
  print('No')

Fixed submission:
X = int(input())
if X>=30:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
cout=0
for i in len(S):
  if S[i]!=T[i]:
    cout=cout+1
print (cout)

Fixed submission:
S=input()
T=input()
cout=0
for i in range(len(S)):
    if S[i]!=T[i]:
        cout=cout+1
print (cout)

Buggy python submission (verdict: Runtime Error):
S=str(input())
T=str(input()
if S==T:
      print('0')

Fixed submission:
S=input()
T=input()
cout=0
for i in range(len(S)):
    if S[i]!=T[i]:
        cout=cout+1
print (cout)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    ans=0
else:
    for i in range(1,N):
        if ans<=10**18:
            ans*=A[i]
        else:
            ans=-1
            exit()
    
print(ans )
    


Fixed submission:
n=int(input())
l=list(map(int,input().split()))
if min(l)== 0:
    print(0)
else:    
    s=1
    for x in l:
        s *= x
        if s>10**18:
            s=-1
            break
    print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 1
if 0 in a:
    ans=0
else:
    for i in range(n):
        ans =ans*a[i]
    if ans > 10**18:
        ans=-1
         break  
print(ans)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
if min(l)== 0:
    print(0)
else:    
    s=1
    for x in l:
        s *= x
        if s>10**18:
            s=-1
            break
    print(s)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = 1
if 0 in a:
    ans=0
else:
    for i in range(n):
        ans =ans*a[i]
    if ans > 10**18:
        ans=-1
           
print(ans)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
if min(l)== 0:
    print(0)
else:    
    s=1
    for x in l:
        s *= x
        if s>10**18:
            s=-1
            break
    print(s)
Buggy python submission (verdict: Runtime Error):
N=int(input())
x=N*2.1415926535897
print x

Fixed submission:
N=int(input())
x=2*N*3.1415926535897
print(x)
Buggy python submission (verdict: Runtime Error):
a,b,c= map(int, input().split())
print(a+' '+b+' '+c)

Fixed submission:
X,Y,Z=list(map(int, input().split()))
print(str(Z)+' '+str(X)+' '+str(Y))

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

Fixed submission:
X,Y,Z=list(map(int, input().split()))
print(str(Z)+' '+str(X)+' '+str(Y))
Buggy python submission (verdict: Runtime Error):
X=int(input())
print(1000*(X//500)+5*((X-500*A)//5))

Fixed submission:
X=int(input())
A=X//500
B=(X-500*A)//5
print(1000*A+5*B)
Buggy python submission (verdict: Runtime Error):
S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
    print('No')
else:
    S1=S[:(N-1)/2]#Sが1文字目～(N-1)/2番目の場合
    S2=S[(N+3)/2:]#Sが(N+3)/2～N番目の場合
    if S1==S1[::-1] and S2==S2[::-1]:
        print('Yes')
    else:
        print('No')

Fixed submission:
S=str(input())
N=len(S)
if S!=S[::-1]:#Sと反転したSが不一致
    print('No')
else:
    S1=S[0:(N-1)//2]#Sが1文字目～(N-1)/2番目の場合
    S2=S[(N+1)//2:N]#Sが(N+3)/2～N番目の場合
    if S1==S1[::-1] and S2==S2[::-1]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
N,A,B=map(int,input().split())
N, A, B = map(int, input().split())
ans = N // (A + B) * A
rem = N % (A + B)
ans += min(rem, A)
print(ans)

Fixed submission:
N, A, B = map(int, input().split())
ans = N // (A + B) * A
rem = N % (A + B)
ans += min(rem, A)
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
print((N+1/2)

Fixed submission:
print((int(input())+1)//2)
Buggy python submission (verdict: Runtime Error):
H,A=map(int, input().split())
print(math.ceil(H/A))

Fixed submission:
import math
H,A=map(int, input().split())
print(math.ceil(H/A))
Buggy python submission (verdict: Runtime Error):
N,K=map(int, input().split())
d=list(map(int,input().split()))
ans=0
for i in range(N+1):
    if d[i]>=K:
        ans=ans+1
print(ans)

Fixed submission:
N,K=map(int, input().split())
d=list(map(int,input().split()))
ans=0
for i in range(N):
    if d[i]>=K:
        ans=ans+1
print(ans)
Buggy python submission (verdict: Runtime Error):
print((input())^3)

Fixed submission:
print(int(input())**3)
Buggy python submission (verdict: Runtime Error):
S=str(input())
T=int(input())
ans=0
for i in range (3)
	if S[i]==T[i]:
    	ans=ans+a
print(ans)

Fixed submission:
S=str(input())
T=str(input())
ans=0
for i in range (3):
    if S[i]==T[i]:
        ans=ans+1
print(ans)
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=int(input())
if a>=3200:
  print(s)
else:
  print('red')

Fixed submission:
a=int(input())
s=str(input())
if a>=3200:
    print(s)
else:
    print('red')
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=list( map(int, input().split()))
ans=0
for i in range(0,n):
    if (p[i-1]<p[i]<p[i+1]) or (p[i-1]>p[i]>p[i+1]):
        ans=ans+1
print(ans)

Fixed submission:
n=int(input())
p=list( map(int, input().split()))
ans=0
for i in range(1,n-1):
    if (p[i-1]<p[i]<p[i+1]) or (p[i-1]>p[i]>p[i+1]):
        ans=ans+1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
w = list(map(int, input().split()))
ans = 10 ** 10
for i in range(100**100):
    ans = min(ans, abs(sum(w[:i]) - sum(w[i:])))
print(ans)


Fixed submission:
n = int(input())
w = list(map(int, input().split()))
ans = 10 ** 100
for i in range(n):
    ans = min(ans, abs(sum(w[:i]) - sum(w[i:])))
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
n=int(input())
h=list(map(int, input().split()))
x=1
ans=h[0]
for i in range(1,n):
    if h[0]>h[1] and h[0]>h[2] and h[0]>h[3]:
        x=0
        print(1)
        sys.exit()
    if h[i]>=h[i-1]:
        x=x+1 
print(x)

Fixed submission:
n=int(input())
h=list(map(int, input().split()))
x=1
ans=h[0]
for i in range(1,n):
    if h[i]>=ans:
        x=x+1 
        ans=h[i]
print(x)

Buggy python submission (verdict: Runtime Error):
import sys
n=int(input())
h=list(map(int, input().split()))
x=1
ans=h[0]
for i in range(1,n):
    if h[0]>=h[1] and h[0]>=h[2]:
        x=0
        print(1)
        sys.exit()
    if h[i]>=h[i-1]:
        x=x+1 
print(x)

Fixed submission:
n=int(input())
h=list(map(int, input().split()))
x=1
ans=h[0]
for i in range(1,n):
    if h[i]>=ans:
        x=x+1 
        ans=h[i]
print(x)
Buggy python submission (verdict: Runtime Error):
N=int(input())
S=map(int,input().split())
if 'Y' in S :
  print('Four')
else:
  print('Three')


Fixed submission:
N=int(input())
S=input()
if 'Y' in S :
  print('Four')
else:
  print('Three')

Buggy python submission (verdict: Runtime Error):
N=int(input())
S=map(int,input().split())
if 'Y' in N :
  print('Three')
else:
  print('Four')

Fixed submission:
N=int(input())
S=input()
if 'Y' in S :
  print('Four')
else:
  print('Three')
Buggy python submission (verdict: Runtime Error):
N,A=map(int,input().split())
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,A=map(int,input().split())
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,A=map(int,input().split())
x=N/500
if x<500:
  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):
import sys
N,Y=map(int,input().split())
ans=0
for x in range (N):
    for y in range(N):
        if 10000*x+5000*y+1000*(N-x-y)==Y:
            print(x+' '+y+' '+N-x-y)
            sys.exit()
print(-1,-1,-1)

Fixed submission:
import sys
N,Y=map(int,input().split())
ans=0
for x in range (N+1):
    for y in range(N+1-x):
        if 10000*x+5000*y+1000*(N-x-y)==Y:
            print(str(x)+' '+str(y)+' '+str(N-x-y))
            sys.exit()
print(-1,-1,-1)
Buggy python submission (verdict: Runtime Error):
A= input() 
B= input()
C= input()
D= input()
L=A+B
R=C+D
if L>R:
  print('Left')
elif L==R:
  print('Balanced')
else :
  print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
A,B,C,D= map(int, input().split())
L=A+B:
R=C+D:
if L>R:
  print('Left')
elif L=R:
  print('Balanced')
else :
  print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
A,B,C,D= map(int, input().split())
L=A+B
R=C+D
if L>R:
  print('Left')
elif L=R:
  print('Balanced')
else :
  print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
A= int(input())
B = int(input())
C = int(input())
D= int(input())
L=A+B
R=C+D
if L>R:
  print('Left')
elif L=R:
  print('Balanced')
else :
  print('Right')

Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
 a, b, c ,d = map(int,input().split(' '))
L=a+b;R=c+d:
if L>R:
	print('Left')
elif L<R:
	print('Right')
else:
	print('Balanced')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
 a, b, c ,d = map(int,input().split(' '))
L=a+b;R=c+d:
if L>R:
	print('Left')
elif L=R:
	print('Balance')
else:
	print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
 a, b, c ,d = map(int,input().split(' '))
 L=a+b;R=c+d:
if L>R:
	print('Left')
elif L=R:
	print('Balance')
else:
	print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')

Buggy python submission (verdict: Runtime Error):
 a, b, c ,d = map(int,input().split(' '))
 L=a+b;R=c+d;
if L>R;
	print('Left')
elif L=R;
	print('Balance')
else;
	print('Right')


Fixed submission:
a , b, c ,d = map(int,input().split(' '))
L=a+b
R=c + d
if L> R:
    print('Left')
elif L<R:
    print('Right')
else:
    print('Balanced ')
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=(a+b)*0.5
print(int(c+0.9))

Fixed submission:
a, b = map(int, input().split())
 
c = (a+b) / 2
 
print(int(c+0.9))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=(a+b)*0.5
print(c+0.9)

Fixed submission:
a, b = map(int, input().split())
 
c = (a+b) / 2
 
print(int(c+0.9))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(int((a+b)*o.5+0.9))

Fixed submission:
a, b = map(int, input().split())
 
c = (a+b) / 2
 
print(int(c+0.9))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=a*b
d=c/2
print(c)

Fixed submission:
a, b = map(int, input().split())
 
c = (a+b) / 2
 
print(int(c+0.9))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c=(a+b)*0.5
print(round(c))

Fixed submission:
a, b = map(int, input().split())
 
c = (a+b) / 2
 
print(int(c+0.9))
Buggy python submission (verdict: Runtime Error):
n,a,b=map(int,input(),split())
print(min(n*a,b))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int,input(),split()]
print(min(n*a,b))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int,input(),split()]
ptint(min(n*a,b))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int(i) for i in input().split()]
ptint(min(n*a,b))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int(i) for i in input().split()]
x=A*N:
if x>=B:
  print(B)
else :
  print(x)


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int(i) for i in input().split()]
x=A*N
if x>=B:
  print(B)
else :
  print(x)


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
n,a,b=[int(i) for i in input().split()]
x=A*N
if x>=B:
  print(str(B))
else ;
  print(str(x))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
N,A,B= map(int,input().split(' '))
x=A*N
if x>B:
  print(B)
elif x=B:
  print(B)
else ;
  print(x)

Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
N,A,B= map(int,input().split(' '))
x=A*N:
if x>B:
  print(str(B))
elif x=B:
  print(str(B))
else ;
  print(str(x))


Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
N,A,B= map(int,input().split(' '))
x=A*N
if x>B:
  print(str(B))
elif x=B:
  print(str(B))
else ;
  print(str(x))

Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))
Buggy python submission (verdict: Runtime Error):
N=int(input())
f=map(int,list(N))
if N%sum(f)==0:
  print('Yes')
else:
  print('No')


Fixed submission:
N=int(input())
f=map(int,list(str(N)))
if N%sum(f)==0:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N=input()
f=map(int,list(str(N)))
if N%sum(f)==0:
  print('Yes')
else:
  print('No')

Fixed submission:
N=int(input())
f=map(int,list(str(N)))
if N%sum(f)==0:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N=input()
f=sum(list(map(int, str(N))))
if N%f==0:
  print('Yes')
else:
  print('No')

Fixed submission:
N=int(input())
f=map(int,list(str(N)))
if N%sum(f)==0:
  print('Yes')
else:
  print('No')