Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
costs_li=[]
costs_list=[]
limit_li=[]
total_li=[]
bought=0
pay=0
for i in range (1,n+1):
  cost,limit=map(int,input().split())
  costs_li.append(cost)
  costs_list.append(cost)
  limit_li.append(limit)
  total_li.append(cost*limit)
costs_li.sort()
low_li=[]
for j in range(0,n):
    for k in range (0,n):
        if costs_list[k]==costs_li[j]:
            low_li.append(k)
for l in range(0,n+1):
    if bought<m:
        pay=pay+total_li[low_li[l]]
        bought=bought+limit_li[low_li[l]]
    elif bought>m:
        pay=pay-costs_li[l-1]*(bought-m)
        bought=m
    else:
        pay=pay
        bought=bought
print(pay)

Fixed submission:
n,k=map(int,input().split())
li=[]
for i in range (0,n):
  li.append(list(map(int,input().split())))
li.sort()
bought=0
pay=0
t=0
while bought<k:
  pay=pay+(li[t][0])*(li[t][1])
  bought=bought+li[t][1]
  t=t+1
pay=pay-li[t-1][0]*li[t-1][1]
bought=bought-li[t-1][1]
bought_2=k-bought
pay_2=li[t-1][0]*bought_2
pay=pay+pay_2
print(pay)
Buggy python submission (verdict: Runtime Error):
s=input()
a_1=s.count("1")
b_1=s.cpunt("0")
if a_1<=b_1:
  print(2*a_1)
else:
  print(2*b_1)

Fixed submission:
s=input()
a_1=s.count("1")
b_1=s.count("0")
if a_1<=b_1:
  print(2*a_1)
else:
  print(2*b_1)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input())
if b%a==0:
  print(a+b)
else:
  print(b-a)

Fixed submission:
a,b=map(int,input().split())
if b%a==0:
  print(a+b)
else:
  print(b-a)
Buggy python submission (verdict: Runtime Error):
n,l=input().split()
lists=[]
for i in range n:
  lists.append(input())
lists.sort()
li=','.join(lists)
print(li)

Fixed submission:
n,l=input().split()
lists=[]
n=int(n)
for i in range (0,n):
  lists.append(input())
lists.sort()
li=''.join(lists)
print(li)
Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())
import itertools
def GCD(a,b):
    if(a%b == 0):
        return b
    else:
        return GCD(b,a%b)
total = 0
for i in list(itertools.product(list(range(1,k+1)), repeat = 3)):
    a = int(i[0])
    b = int(i[1])
    c = int(i[2])
    total += GCD(GCD(a,b),c)
print(total)

Fixed submission:
k = int(input())
import itertools
def GCD(a,b):
    if(a%b == 0):
        return b
    else:
        return GCD(b,a%b)
total = 0
for a in range(1,k+1):
    for b in range(1,k+1):
        for c in range(1,k+1):
            total += GCD(GCD(a,b),c)
print(total)

Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())
import itertools
def GCD(a,b):
    mx = max(a,b)
    mi = min(a,b)
    if(mx%mi == 0):
        return mi
    else:
        return GCD(mi,mx%mi)
total = 0
for i in list(itertools.product(list(range(1,k+1)),repeat=3)):
    a = int(i[0])
    b = int(i[1])
    c = int(i[2])
    #print(a,b,c)
    total += GCD(GCD(a,b),c)
print(total)

Fixed submission:
k = int(input())
import itertools
def GCD(a,b):
    if(a%b == 0):
        return b
    else:
        return GCD(b,a%b)
total = 0
for a in range(1,k+1):
    for b in range(1,k+1):
        for c in range(1,k+1):
            total += GCD(GCD(a,b),c)
print(total)
Buggy python submission (verdict: Runtime Error):
l = int(input())
Ma = 0
import numpy as np
for i in np.arange(0,l+1,0.1):
    for j in np.arange(0,i+1,0.1):
        z = l - (i+j)
        result = z*i*j
        if(result>Ma):
            Ma = result
print(Ma)

Fixed submission:
l = int(input())

print((l/3)**3)
Buggy python submission (verdict: Runtime Error):
n = int(input())
S = []
for i in range(n):
    s = input()
    S.append(s)
S.sort()
A = list(set(S))
A.sort()
#print(A)
#print(S)
NUM =[0]*len(A)
j = 0
for i in range(len(S)):
    if(i+1<len(S)):
        if (S[i] == S[int(i)+1]):
            NUM[j] = NUM[j]+ 1
        else:
            j += 1
import numpy as np
b = np.argmax(NUM)
#print(NUM,b)
for e,i in enumerate(NUM):
    #print(NUM[b])
    if (i == NUM[b]):
        print(A[e])

Fixed submission:
n = int(input())
S = []
for i in range(n):
    s = input()
    S.append(s)
S.sort()
A = list(set(S))
A.sort()
#print(A)
#print(S)
NUM =[0]*len(A)
j = 0
for i in range(len(S)):
    if(i+1<len(S)):
        if (S[i] == S[int(i)+1]):
            NUM[j] = NUM[j]+ 1
        else:
            j += 1
import numpy as np
b = np.argmax(NUM)
#print(NUM,b)
for e,i in enumerate(NUM):
    #print(NUM[b])
    if (i == NUM[b]):
        print(A[e])

Buggy python submission (verdict: Runtime Error):
n = int(input())
S = []
for i in range(n):
    s = input()
    S.append(s)
S.sort()
A = list(set(S))
A.sort()
#print(A)
#print(S)
NUM =[0]*len(A)
for j in range(len(A)):
    for i in range(len(S)):
        if (A[int(j)] == S[int(i)]):
            NUM[j] = NUM[j]+ 1
import numpy as np
b = np.argmax(NUM)
#print(NUM,b)
for e,i in enumerate(NUM):
    #print(NUM[b])
    if (i == NUM[b]):
        print(A[e])

Fixed submission:
n = int(input())
S = []
for i in range(n):
    s = input()
    S.append(s)
S.sort()
A = list(set(S))
A.sort()
#print(A)
#print(S)
NUM =[0]*len(A)
j = 0
for i in range(len(S)):
    if(i+1<len(S)):
        if (S[i] == S[int(i)+1]):
            NUM[j] = NUM[j]+ 1
        else:
            j += 1
import numpy as np
b = np.argmax(NUM)
#print(NUM,b)
for e,i in enumerate(NUM):
    #print(NUM[b])
    if (i == NUM[b]):
        print(A[e])
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0

for i in range(k):
    sum_a += P[i]
num = sum_a
for j in range(1,n-k+1):
    num += P[j+k-1]
    #print(num)
    num -= P[j-1]
    #print(num)
    if(sum_a<num):
        index = j
        sum_a = num

total = 0.0
for m in range(index,index+k):
    total += sum(list(range(P[m]+1)))/P[m]
print(total)


Fixed submission:
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0

for i in range(k):
    sum_a += P[i]
num = sum_a
for j in range(1,n-k+1):
    num += P[j+k-1]
    #print(num)
    num -= P[j-1]
    #print(num)
    if(sum_a<num):
        index = j
        sum_a = num

total = 0.0
for m in range(index,index+k):
    total += sum(list(range(P[m]+1)))/P[m]
print(total)

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0
for i in range(n):
    num = 0
    
    if (int(i)+k<=n):
        for j in range(int(i),int(i)+k):
            num += P[j]
        if(sum_a<num):
            index = i
            sum_a = num
            #print(sum_a,index)
total = 0.0
for m in range(index,index+k):
    total += sum(list(range(P[m]+1)))/P[m]
print(total)

Fixed submission:
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0

for i in range(k):
    sum_a += P[i]
num = sum_a
for j in range(1,n-k+1):
    num += P[j+k-1]
    #print(num)
    num -= P[j-1]
    #print(num)
    if(sum_a<num):
        index = j
        sum_a = num

total = 0.0
for m in range(index,index+k):
    total += sum(list(range(P[m]+1)))/P[m]
print(total)

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0
for i in range(n):
    num = 0
    
    if (int(i)+k<=n):
        for j in range(int(i),int(i)+k):
            num += P[j]
        if(sum_a<num):
            index = i
            sum_a = num
            #print(sum_a,index)
total = 0.0
for m in range(index,index+k):
    mylist = list(range(P[m]+1))
    #print(sum(mylist))
    total += sum(list(range(P[m]+1)))/P[m]
print(total)

Fixed submission:
n,k = map(int,input().split())
P = list(map(int,input().split()))
sum_a = 0
index = 0

for i in range(k):
    sum_a += P[i]
num = sum_a
for j in range(1,n-k+1):
    num += P[j+k-1]
    #print(num)
    num -= P[j-1]
    #print(num)
    if(sum_a<num):
        index = j
        sum_a = num

total = 0.0
for m in range(index,index+k):
    total += sum(list(range(P[m]+1)))/P[m]
print(total)
Buggy python submission (verdict: Runtime Error):
A = list(input().split(" "))
N = int(A[0])
K = int(A[1])
H = list(input().split(" "))
sum = 0
H.sort()
for i in range(K):
    H[N-1-i] = "0"
for i in range(N):
    sum += int(H[i])
print(sum)

Fixed submission:
n,k = map(int,input().split())
H = list(map(int,input().split()))
H.sort(reverse = True)
H = H[k:]
print(sum(H))

Buggy python submission (verdict: Runtime Error):
A = list(input().split(" "))
N = int(A[0])
K = int(A[1])
H = list(input().split(" "))
sum = 0
H.sort()
for i in range(K):
    H[N-1-i] = 0
for i in range(N):
    sum += int(H[i])
print(sum)


Fixed submission:
n,k = map(int,input().split())
H = list(map(int,input().split()))
H.sort(reverse = True)
H = H[k:]
print(sum(H))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(input())
total = 0
for i in range(1000):
  t = list(str(i).zfill(3))
  j = 0
  for c in range(len(s)):
    if (j<=len(t)-1):
      if(s[c] == t[j]):
        j += 1
  if (j == 3):
    total += 1
print(total)

Fixed submission:
n = int(input())
s = list(input())
total = 0
for i in range(1000):
  t = list(str(i).zfill(3))
  j = 0
  for c in range(len(s)):
    if (j<=len(t)-1):
      if(s[c] == t[j]):
        j += 1
  if (j == 3):
    total += 1
print(total)
Buggy python submission (verdict: Runtime Error):
n = int(input())
total = 0
for i in range(n+1):
  if (len(i)%2 != 0):
    total += 1
print(total)

Fixed submission:
n = int(input())
total = 0
for i in range(1,n+1):
  if (len(str(i))%2 != 0):
    total += 1
print(total)
Buggy python submission (verdict: Runtime Error):
n = int(input())
result = 0
for i in range(2,n+1):
  total = 0
  for j in range(i):
    if (i%j == 0):
      tatal += 1
  if(total == 8):
    result += 1
print(result)

Fixed submission:
n = int(input())
result = 0
for i in range(1,n+1,2):
  total = 0
  for j in range(1,i+1):
    if (i%j == 0):
      total += 1
  if(total == 8):
    result += 1
    #print(i,j)
print(result)
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())
return (a*b%2 == 0) ? 'Even':'Odd'

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = 0
b = 0

a = input()
b = input()

c = int(a)*int(b)
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = 0
b = 0

a = input()
b = input()

c = int(a)*int(b)
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = 0
b = 0

a = input()
b = input()

c = a*b
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = 0
b = 0

a = input()
b = input()


if (int(a)*int(b))%2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = 0
b = 0

input(a)
input(b)

if (a*b)%2 == 0:
    print("Odd")
else:
    print("Even")

Fixed submission:
str = input()
a = str.split(" ")
c = int(a[0])*int(a[1])
if c%2 == 0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
import sys
n,y = map(int,input().split())

for i in range(n+1):
    for j in range(n-i+1):
        k = n-i-j:
        if (10000*i+5000*j+1000*k == y):
            print(i,j,k)
            sys.exit()
print(-1,-1,-1)


Fixed submission:
import sys
n,y = map(int,input().split())

for i in range(n+1):
    for j in range(n-i+1):
        k = n-i-j
        if (10000*i+5000*j+1000*k == y):
            print(i,j,k)
            sys.exit()
print(-1,-1,-1)

Buggy python submission (verdict: Runtime Error):
n,y = map(int,input().split())

for i in range(n+1):
    for j in range(n-i+1):
        k = n-i-j:
        if (10000*i+5000*j+1000*k == y):
            print(i,j,k)
            exit()
print(-1,-1,-1)

Fixed submission:
import sys
n,y = map(int,input().split())

for i in range(n+1):
    for j in range(n-i+1):
        k = n-i-j
        if (10000*i+5000*j+1000*k == y):
            print(i,j,k)
            sys.exit()
print(-1,-1,-1)
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
count = 0
for i in range(k+1):
    for j in range(k+1):
        for m in range(k+1):
            if (i+j+m == s):
                count += 1
print(count)

Fixed submission:
k,s = map(int,input().split())
count = 0
for i in range(k+1):
    for j in range(k+1):
        m = s-j-i
        if(m <= k and 0 <= m):
            #print(i,j,m)
            count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
if N % 10 == 2 or N % 10 == 4 or N % 10 == 5 or N % 10 == 7 or N % 10 == 9:
  print('hon')
elif N % 10 == 0 or N % 10 == 1 or N % 10 == 6 or N % 10 == 8:
  print('pon')
else:
  print('bon')

Fixed submission:
n = int(input())

n_onesplace = n%10

if n_onesplace==2 or n_onesplace==4 or n_onesplace==5\
    or n_onesplace==7 or n_onesplace==9:
    print('hon')
elif n_onesplace==0 or n_onesplace==1 or\
    n_onesplace==6 or n_onesplace==8:
    print('pon')
else:
    print('bon')

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

if N % 10 == 2 or N % 10 == 4 or N % 10 == 5 or N % 10 == 7 or N % 10 == 9:
  print('hon')
elif N % 10 == 0 or N % 10 == 1 or N % 10 == 6 or N % 10 == 8:
  print('pon')
else:
  print('bon')

Fixed submission:
n = int(input())

n_onesplace = n%10

if n_onesplace==2 or n_onesplace==4 or n_onesplace==5\
    or n_onesplace==7 or n_onesplace==9:
    print('hon')
elif n_onesplace==0 or n_onesplace==1 or\
    n_onesplace==6 or n_onesplace==8:
    print('pon')
else:
    print('bon')
Buggy python submission (verdict: Runtime Error):
A=input()
B=input()

print(A*B)

Fixed submission:
A,B=[int(x) for x in input().split()]

print(A*B)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
sum = 1
for i in a:
    if i == 0:
        sum = 0
        break
    sum = sum * i

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


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
sum = 1
if 0 in a:
    sum = 0
else:
    for i in a:
        sum = sum * i
        if sum > 10**18:
            sum = -1
            break
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
sum = 1
for i in a:
    if i == 0
    sum = sum * i
    break
    else
    sum = sum * i

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


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
sum = 1
if 0 in a:
    sum = 0
else:
    for i in a:
        sum = sum * i
        if sum > 10**18:
            sum = -1
            break
print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
sum = 1
for i in a:
    sum = sum * i

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


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
sum = 1
if 0 in a:
    sum = 0
else:
    for i in a:
        sum = sum * i
        if sum > 10**18:
            sum = -1
            break
print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
sum = 1
for i in range(n):
    sum = sum * a[i]

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


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


Fixed submission:
n=int(input())
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
	if p[i]<a:
		cnt+=1
		a=p[i]
print(cnt)

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


Fixed submission:
n=int(input())
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
	if p[i]<a:
		cnt+=1
		a=p[i]
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
p=list(map(int,input().split()))
l=[p[0]]
for i in range(1,n):
	l.append(p[i])
	flag="True"
	for j in range(i):
		if flag=="True":
			if p[i]>p[j]:
				l.remove(p[i])
				flag="False"
print(len(l))


Fixed submission:
n=int(input())
p=list(map(int,input().split()))
a=p[0]
cnt=1
for i in range(1,n):
	if p[i]<a:
		cnt+=1
		a=p[i]
print(cnt)
Buggy python submission (verdict: Runtime Error):
s = input()
n = int(input())
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUWVXYZABCDEFGHIJKLMNOPQRSTUWVXYZ"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[(a_list.index(s[i]))+n])
print("".join(ans))

Fixed submission:
youbi_list=["SUN","MON","TUE","WED","THU","FRI","SAT"]

s = input()

print(7-youbi_list.index(s))
Buggy python submission (verdict: Runtime Error):
s = input()
n = int(input())
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUWVXYZabcdefghijklmnopqrstuwvxyz"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n])
ans=ans.upper()
print("".join(ans))

Fixed submission:

n = int(input())
s = input()
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n].upper())
print("".join(ans))

Buggy python submission (verdict: Runtime Error):
s = input()
n = int(input())
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUWVXYZABCDEFGHIJKLMNOPQRSTUWVXYZ"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[int(a_list.index(s[i]))+n])
print("".join(ans))

Fixed submission:

n = int(input())
s = input()
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n].upper())
print("".join(ans))

Buggy python submission (verdict: Runtime Error):
s = input()
n = int(input())
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUWVXYZABCDEFGHIJKLMNOPQRSTUWVXYZ"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n])
print("".join(ans))

Fixed submission:

n = int(input())
s = input()
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n].upper())
print("".join(ans))

Buggy python submission (verdict: Runtime Error):
s = input()
n = int(input())
ans=[]
a_list = "ABCDEFGHIJKLMNOPQRSTUWVXYZABCDEFGHIJKLMNOPQRSTUWVXYZ"
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n])
print("".join(ans))

Fixed submission:

n = int(input())
s = input()
ans=[]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
a_list=[]
for j in a:
	a_list.append(j)
for i in range (len(s)):
	ans.append(a_list[a_list.index(s[i])+n].upper())
print("".join(ans))
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = list(map(int, input().split()))
sum = 0
for i in range((N*(N-1))//2):
    for j in range(i):
        a = l[i]*l[j]
        sum+=a
print(sum)


Fixed submission:
N = int(input())
l = list(map(int, input().split()))
sum = 0
for i in range((N*(N-1))//2):
    for j in range(i+1,N):
        a = l[i]*l[j]
        sum+=a
print(sum)
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
h = list(map(int,input().split()))
cnt=0
for i in range(n):
	if k<=h[i]:
		cnt+=1
print(cnt)

Fixed submission:
import math
N = int(input())
a=N//2
b=N-a

print(b/N)

Buggy python submission (verdict: Runtime Error):
n,k = map(int,input())
h = list(map(int,input().split()))
cnt=0
for i in range(n):
	if k<=h[i]:
		cnt+=1
print(cnt)

Fixed submission:
import math
N = int(input())
a=N//2
b=N-a

print(b/N)

Buggy python submission (verdict: Runtime Error):
N = int(input())
N_list = list(N)
a = 0
for i in range(N):
    if N_list[i]%2==0:
	       a += 1
ave = a/len(N_list)
print(ave)


Fixed submission:
import math
N = int(input())
a=N//2
b=N-a

print(b/N)
Buggy python submission (verdict: Runtime Error):
n,k = int(input())
h = list(map(int,input().split()))
cnt=0
for i in range(n):
	if k<=h[i]:
		cnt+=1
print(cnt)

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

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


Fixed submission:
n,k = map(int,input().split())
h = list(map(int,input().split()))
cnt=0
for i in range(n):
	if k<=h[i]:
		cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
s = input()
s_list=("Sunny","Cloudy","Rainy")
tom = s_list.index(s)+1
print(s_list[tom])


Fixed submission:
s = input()
s_list=("Sunny","Cloudy","Rainy","Sunny")
tom = s_list.index(s)+1
print(s_list[tom])
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.append()
B.append()
ans=0
for i in range(1,N+1):
	ans+=B[A[i-1]-1]
	if A[i-1]==A[i]-1:
		ans+=C[A[i-2]]
print(ans)

Fixed submission:

N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え

Buggy python submission (verdict: Runtime Error):
140 proA
N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え

Fixed submission:

N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え