TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(150, [150, 140, 100, 200]), 2)

    def test_2(self):
        self.assertEqual(think(500, [499]), 0)

    def test_3(self):
        self.assertEqual(think(1, [100, 200, 300, 400, 500]), 5)


def solve():
    k, h = read()
    result = think(k, h)
    write(result)


def read():
    n, k = read_int(2)
    h = read_int(n)
    return k, h


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(k, h):
    print(k, h)
    return len(list(filter(lambda x: x >= k, h)))


def write(result):
    print(result)


if __name__ == '__main__':
    # import sys
    
    # unittest.main()
    solve()

import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(150, [150, 140, 100, 200]), 2)

    def test_2(self):
        self.assertEqual(think(500, [499]), 0)

    def test_3(self):
        self.assertEqual(think(1, [100, 200, 300, 400, 500]), 5)


def solve():
    k, h = read()
    result = think(k, h)
    write(result)


def read():
    n, k = read_int(2)
    h = read_int(n)
    return k, h


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(k, h):
    return len(list(filter(lambda x: x >= k, h)))


def write(result):
    print(result)


if __name__ == '__main__':
    # import sys
    
    # unittest.main()
    solve()

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
#include <stdio.h>

int main(void)
{
  int N, K;
  scanf("%d %d", &N, &K);
  ans = 0;
  for(int i = 0; i < N; i++){
    int h;
    scanf("%d", &h);
    if(K <= h)
    	ans++;
  }
  printf("%d", ans);
}

N, K = map(int, input().split())
h = map(int, input().split())
ans = 0
for i in h:
  if K <= i:
    ans += 1
print(ans)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
num, least = map(int,input("num: ").split())
high = [int(x) for x in input("high: ").split()]

high.sort(reverse = True)

count = 0
i = 0

while i < num:
    if high[i] >= least:
        count += 1
        i += 1
    else:
        break

print(count)

num, least = map(int,input().split())
high = [int(x) for x in input().split()]

high.sort(reverse = True)

count = 0
i = 0

while i < num:
    if high[i] >= least:
        count += 1
        i += 1
    else:
        break

print(count)


Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K = map(int,input().split())

h = [int(i) for i in input().split()]

count =0

for i in range(N):
  if h[i] >= k:
    count += 1
    
    
print(count)
    

N,K=map(int,input().split())
h=[int(i) for i in input().split()]

ans =0
for i in range(N):
  if h[i] >=K:
    ans +=1
    
    
print(ans)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=map(int,input().split())
h=list(map(int,input().split()))
cnt=0
for i in h:
  if h<k:
    cnt+=1
    
print(cnt)

n,k=map(int,input().split())
h=list(map(int,input().split()))
cnt=0
for i in h:
  if i>=k:
    cnt+=1
    
print(cnt)
  

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in h:
    if i>=k:
        ans=+1
        
print(ans)

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in h:
    if i>=k:
        ans+=1
        
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K =map(int,input().split())
height = [for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)
    

N,K =map(int,input().split())
height = [int(i) for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K=map(int,input().split())
h=[]
a=0
for i in range(1,N+1):
    i=input()
    h.append(i)
    if int(i)>=int(K):
        a+=1
        
print(a)

N,K=map(int,input().split())
h=list(map(int,input().split()))
a=0
for idx in h:
    if idx>=K:
        a+=1
        
print(a)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K=map(int, input().split())
H=list(map(int, input().split()))

count=0
for i in H:
  if H>=K:
    count+=1
print(count)

N, K=map(int, input().split())
H=list(map(int, input().split()))

count=0
for i in H:
  if i>=K:
    count+=1
print(count)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int,input().split())
h = list(int,input().split())
ans = 0
for i in range(n):
  if h[i]>=k:
    ans += 1
    
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
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)

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)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=map(int,input().split())
h=list(map(int,input().split()))
h=filter(lambda x => k, h)
print(len(h))

n,k=map(int,input().split())
h=list(map(int,input().split()))
h=list(filter(lambda x:x >= k, h))
print(len(h))


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())

h = list(map(int, input().split()))
ans = 0
for i in range(N):
    if h[i] > K:
        ans += 1

print(ans)


N, K = map(int, input().split())

h = list(map(int, input().split()))
ans = 0
for i in range(N):
    if h[i] >= K:
        ans += 1

print(ans)


Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N = input().split()
i = [int(input()) for i in range(int(N[0]))]

count=0
for j in i:
    if(j>=int(N[1])):
        count+=1

print(count)


N = input().split()
i = input().split()

count=0
for j in i:
    if(int(j)>=int(N[1])):
        count+=1

print(count)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
H = list(map(int, input().split()))

print(sum([1 if h > K else 0 for h in H]))

N, K = map(int, input().split())
H = list(map(int, input().split()))

print(sum([1 if h >= K else 0 for h in H]))

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.readline().split()))
cnt = 0
for i in li:
  if i >= k:
    cnt += 1
print(cnt)

import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().split()))
cnt = 0
for i in li:
  if i >= k:
    cnt += 1
print(cnt)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import bisect
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_right(h, k))
      



import bisect
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_left(h, k))
      



Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n=list(int(input().splice()))
n[1]=K
h=list(int(input().splice()))

count = 0
for hi in h:
  if hi >= K:
    count += 1

print(count)

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for hei in h:
  if hei >= k:
    ans+=1
print(ans)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
h = input().split()
cnt = 0

for i in range(N):
  if h[i] >= K:
    cnt += 1
    
print(cnt)

N, K = map(int, input().split())
h = list(map(input().split()))
cnt = 0
 
for i in range(N):
  if h[i] >= K:
    cnt += 1
    
print(cnt)

N, K = map(int, input().split())
h = list(map(int, input().split()))
cnt = 0
 
for i in range(N):
  if h[i] >= K:
    cnt += 1
    
print(cnt)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=[int(i) for i in input().split()]
ans=[i for i in input().split() if int(i)>k]
print(len(ans))

n,k=[int(i) for i in input().split()]
ans=[i for i in input().split() if int(i)>=k]
print(len(ans))

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import numpy as np
result = 0
people = int(input('people:'))
restrict = int(input('Restricted height:'))

for i in range(people):
    p1 = int(input())
    if p1 >= restrict:
        result +=1
print(result)

import numpy as np
result = 0
N = list(map(int, input().split())) 
A = list(map(int, input().split())) 

for i in range(N[0]):
    p1 = A[i]
    if p1 >= N[1]:
        result +=1
print(result)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, k = map(int, input().split())
h = list(map(int, input().split())
         
         count = 0
         
         for i in h:
         if i >= k:
         count += 1
         
         print(count)

n, k = map(int, input().split())
h = list(map(int, input().split()))
         
         count = 0
         
         for i in h:
         if i >= k:
         count += 1
         
         print(count)

n,k = map(int,input().split())
h = list(map(int,input().split()))

count = 0

for i in h:
   if i >= k:
       count += 1

print(count)            

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, m = [int(i) for i in input().split()]
cnt = 0
for i in input().split();
	if m <= int(i):
    	cnt += 1
print(cnt)

n, m = [int(i) for i in input().split()]
cnt = 0
for i in input().split():
  if m <= int(i):
    cnt+=1
print(cnt)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N = int(input())
A_list = list(map(int, input().split()))

ans_list = []
for i in range(1, N + 1):
    ans_list.append(A_list.index(i) + 1)
    
print(' '.join([str(n) for n in ans_list]))


N, K = map(int, input().split())
h_list = [int(i) for i in input().split()]

count = 0
for i in h_list:
    if i >= K:
        count += 1
    else:
        pass

print(count)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int,input().split())
h = list(map(int,input().split()))

h.sort()
for i in range(n):
    if h(i) < k:
        break
print(i)

n,k = map(int,input().split())
h = list(map(int,input().split()))

h.sort()
for i in range(n):
    if h[i] < k:
        break
print(i)

n,k = map(int,input().split())
h = list(map(int,input().split()))

h.sort()
for i in range(n):
    if h[-i] < k:
        break
print(i)

n,k = map(int,input().split())
h = list(map(int,input().split()))

c = 0

for i in range(n):
    if h[i] >= k:
        c += 1
print(c)

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

h.sort()

left = 0
right = len(h) - 1
center = 0

if right == 0:
    if a[0] >= K:
        print(1)
    else:
        print(0)
else:
    while right - left >= 1:
        center = int((left + right) / 2)
        if h[center] >= K:
            right = center
        else:
            left = center
        
    print(len(h) - center)

import time

N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

count = 0

for i in range(N):
    if n[i] >= K:
        count += 1

print(count)

N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

h.sort()

left = 0
right = len(h) - 1
center = 0

while right - left >= 2:
    center = int((left + right) / 2)
    print(center)
    if h[center] >= K:
        right = center
    else:
        left = center
    
print(center + 1)

N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

h.sort()

left = 0
right = len(h) - 1
center = 0

while right - left >= 2:
    center = int((left + right) / 2)
    if h[center] >= K:
        right = center
    else:
        left = center
    
print(center + 1)

N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

count = 0

for i in range(N):
    if h[i] >= K:
        count += 1

print(count)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
#!/usr/bin/env python3

def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(N, K, h)
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()


#!/usr/bin/env python3

def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
count = 0
N = int(input())
K = int(input())
hi_list = list()
while count < N:
    count += 1
    hi = int(input())
    hi_list.append(hi)
ok_list = list()
for data in hi_list:
    if data >= K:
        ok_list.append(data)
print(len(ok_list))

n, k = map(int, input().split())
h = list(map(int, input().split()))
ok_list = list()
for data in h:
    if data >= k:
        ok_list.append(data)
print(len(ok_list))

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,m = map(int,input().split())
l = [ i for i in input().split() if i>m]
print(len(l))

n,m = map(int,input().split())
l = [ i for i in input().split() if int(i)>=m]
print(len(l))

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())

h = list(map(int, input().split()))

print(len([i for i in h if i > K]))


N, K = map(int, input().split())

h = list(map(int, input().split()))

print(len([i for i in h if i >= K]))


Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
A = list(map(int, input().split()))

ans = 0
for i in range(N):
    if A[i] >= K:
        cnt += 1

print(ans)

N, K = map(int, input().split())
A = list(map(int, input().split()))

ans = 0
for i in range(N):
    if A[i] >= K:
        ans += 1

print(ans)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N = input()
K = input ()
A = int(N)
B = int(K)
j = 0
for i in range(1,A+1):
    n = input()
    a = int(n)
    if a >= B:
        j += 1
    else: continue
print(j)


N = int(input())
K = int(input())
count = 0
for i in range(1,N+1):
    n = int(input())
    if n >= K:
        count += 1
    else: continue
print(count)

N = input()
K = input()
A = int(N)
B = int(K)
j = 0
for i in range(1,A+1):
  n = input()
  a = int(n)
  if a >= B:
	j += 1
    continue
  else: continue
print(j)

N,K=map(int,input().split())
count = 0
for i in range(1,N+1):
    h = list(map(int,input().split()))
    for j in h:
        if j >= K:
            count += 1
        else: continue
    break
print(count)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
ar = list(map, input().split())

count = 0
for n in ar:
    if n >= K:
        count += 1

print(count)


N, K = map(int, input().split())
ar = list(map, input().split())

count = 0
for i in range(N):
    if ar[i] >= K:
        count += 1

print(count)


N, K = map(int, input().split())
ar = list(map(int, input().split()))

count = 0
for i in range(N):
    if ar[i] >= K:
        count += 1

print(count)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, k = map(int,input().split())
h = list(map(int, input().split()))
cnt = 0
for i in range(len(h)):
    if h[i] > k:
        cnt += 1
print(cnt)

N, K = map(int, input().split())
h_lis = list(map(int, input().split()))

cnt=0
for h in h_lis:
    if h>=K:cnt+=1
print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
str1=input().split(' ')
N=int(str1[0])
K=int(str1[1])
str2=input().split(' ')
h=[]
result=0
for i in range(str2_len):
	h[i]=int(str[i])

for i in range(h_len):
	if h[i]>=K:
		result+=1

print(result)

import numpy

str1=input().split(' ')
N=int(str1[0])
K=int(str1[1])
str2=input().split(' ')
h=[0]*N
result=0
for i in range(N):
	h[i]=int(str2[i])

for i in range(N):
	if h[i]>=K:
		result+=1

print(result)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for i in h:
  if i >= K:
    count += 1
  else:
    continue
  print(count)

N, K = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for i in h:
    if i >= K:
        count += 1
    print(count)


N, K = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for i in h:
    if i >= K:
        count += 1
print(count)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int, input().split())
ans=0
for i in range(n):
	a = int(input())
	if a>=k:
	ans+=1
print(ans)

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

for i in range(n):
	if list[i]>=k:
		ans+=1
print(ans)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in h:
    ans += (h>=K)
print(ans)

N, K = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in h:
    ans += (i >= K)
print(ans)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int,input().split())
h = list(map(int,input().split()))

count = 0
for person in h:
    if person > K:
        count += 1

print(count)

N, K = map(int,input().split())
h = list(map(int,input().split()))

count = 0
for person in h:
    if person >= K:
        count += 1

print(count)

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K=map(int,input().split())
H=list[map(int,input().split())]
count=0
for h in H:
  if h>K:
  count+=1
print(count)

N,K=map(int,input().split())
H=list(map(int,input().split()))
count=0
for h in H:
  if h>=K:
  count=count+1
print(count)

N,K=map(int,input().split())
H=list[map(int,input().split())]
count=0
for h in H:
  if h>=K:
  count=count+1
print(count)

N, K = map(int, input().split())
H = list(map(int, input().split()))
count = 0
for h in H:
    if h >= K:
        count = count+1
print(count)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c++
print(c)

x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c++
    continue
print(c)


x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c+=1
    continue
print(c)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, k = list(map(int,input().split()))
h = list(map(int,input().split()))
print(sum([map(lambda x: 1 if x - k >= 0 else 0, h)]))


n, k = list(map(int,input().split()))
h = list(map(int,input().split()))
print(sum(list(map(lambda x: 1 if x - k >= 0 else 0, h))))


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in range(n):
    if i<k:
        ans+=1
    else:
        print(n-ans)
        break

n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in lis:
    if i<k:
        ans+=1
    else:
        
        break
print(n-ans)

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in N:
  if h[i]>=K:
    ans+=1
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N = int(input())
K = int(input())
h = []
a = 0
for i in range(N):
    b = int(input())
    h.append(b)
    if h[i] >= K:
        a += 1
print(a)


NK_lis = list(map(int,input().split()))
h_lis = list(map(int,input().split()))
a = 0
for i in range(NK_lis[0]):
    if h_lis[i] >= NK_lis[1]:
        a += 1
print(a)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
cnt = 0
for h in H:
  if(h>K):
    cnt += 1
print(cnt)

N,K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
cnt = 0
for h in H:
  if(h>=K):
    cnt += 1
print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
print(h)
j = 0
a = 0
i = 0
for i in range(N):
    if h[i]>=K:
        a = a+1
print(a)

N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
print(h)
j = 0
a = 0
for i in range(N):
    if h[j]>=K:
        a = a+1
    j = j + 1
print(a)

j = 0
a = 0
i = 0
N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
"""j = 0
a = 0
i = 0"""
for i in range(N):
    if h[i]>=K:
        a = a+1
print(a)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int, input())
ans = 0
for i in range(n):
  if int(input()) >= k:
    ans += 1
print(ans)

n,k = map(int, input().split())
ans = 0
for i in range(n):
  if int(input()) >= k:
    ans += 1
print(ans)

n,k = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in h:
  if i >= k:
    ans += 1
print(ans)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
height_list = list(map, input().split())
len_height_list = len(height_list)
count = 0

for i in range(len_height_list):
    if height_list[i] >= K:
        count += 1
        
print(count)

N, K = map(int, input().split())
height_list = list(map(int, input().split()))
len_height_list = len(height_list)
count = 0

for i in range(len_height_list):
    if height_list[i] >= K:
        count += 1
        
print(count)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import bisect

N, K = map(int, input().split())
h = list(map(int,(input().split())))

h.sort()
ans = N - bisect.bisect_left(h,K) +1
print(ans)

N, K = map(int, input().split())

h = list(map(int(input().split())))

ans = 0
for i in h:
    if i>=K:
        ans+=1

print(ans)

N, K = map(int, input().split())

h = list(map(int(input().split())))

ans = 0
[ans+= for i in h if i>=50]

print(ans)


N, K = map(int, input().split())

h = list(map(int(input().split())))

ans = 0
for i in h:
    if i>=K:
        ans+=1

print(ans)


import bisect

N, K = map(int, input().split())
h = list(map(int,(input().split())))

h.sort()
ans = N - bisect.bisect_left(h,K)
print(ans)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for x in h:
  if h >= K:
    ans += 1
print(ans)

N,K = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for x in h:
  if x >= K:
    ans += 1
print(ans)


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K=map(int, input().split())
List=list(map(int,input().split())) 
print(sum(1 for x in List if x>K))

N,K=map(int, input().split())
List=list(map(int,input().split())) 
print(sum(1 for x in List if x>=K))

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, k = map(int, input().split())
h = list(map(int,input().split()))
num = 0
for i in range(n):
  if h[i] >= k:
    m += 1
print(m)

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


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    n = int(input())
    n = decimal.Decimal(n)
    if n % 2 == 0:
        print(1/decimal.Decimal(2))
        return
    
    print(((n-1)/2+1)/n)

    
    
main()

import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count)

    
    
main()

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int,input().split())

h = list(map(int,input().split()))

ans = 0

for i in h:
    if i>=k:
        ++ans
        
print(ans)

n,k = map(int,input().split())

h = list(map(int,input().split()))

ans = 0

for i in h:
    if i>=k:
        ans += 1
        
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int, input().split())
nums = []
for i in range(n):
    nums.append(int(input()))

count = 0
for n in nums:
  if n >= k:
    count +1
  else:
    continue
print(count)

n,k = map(int, input().split())
nums = []
for i in range(n):
    nums.append(int(input()))

count = 0
for n in nums:
  if n > k:
    count +1
  else:
    continue
print(count)

n,k = map(int, input().split())
nums =list(map(int,input().split()))

count = 0
for n in nums:
  if n >= k:
    count +=1
  else:
    continue
print(count)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N,K = input().split()
n = int(N)
k = int(K)
hList = []

for i in range(0,n):
    hList.append(int(input()))

count = 0
for i in range(0,n):
    if hList[i] >= k:
        count += 1
print(count)

N,K = input().split()
n = int(N)
k = int(K)
hList = input().split()

count = 0
for i in range(0,n):
    if int(hList[i]) >= k:
        count += 1
print(count)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n, k = map(int, input().split())
h = list(map(int, input().split()))
out = 0
for i in h:
 if h >= k:
  out = out + 1
print(out)

n, k = map(int, input().split())
h = list(map(int, input().split()))
out = 0
for i in h:
 if i >= k:
  out = out + 1
print(out)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
N, K = map(int, input().split())
h = list(map(int, input().split()))
print(sum(1 if t >= K for t in h))

N, K = map(int, input().split())
H = list(map(int, input().split())
num = 0
for i in H:
    if i >= K:
        num += 1

print(num)


N, K = map(int, input().split())
H = list(map(int, input()split())
num = 0
for i in H:
    if i >= K:
        num += 1

print(num)

N, K = map(int, input().split())
H = list(map(int, input().split()))
num = 0
for i in H:
    if i >= K:
        num += 1

print(num)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
import sys
sys.setrecursionlimit(1000000000) 
N, K = input().strip().split()
h = list(map(int, input().split()))
count = 0
for i in range(N):
    if h[i] >= K:
        count += 1
print(count)


N, K = input().strip().split()
h = list(map(int, input().split()))
count = 0
for i in range(N):
    if h[i] >= K:
        count += 1
print(count)

N, K = input().split()
h = list(map(int, input().split()))

count = 0
for i in h:
    if i >= K:
        count += 1
print(count)

N, K = input().split()
h = list(map(int, input().split()))
count = [i for i in h if i >= K]
print(len(count))

N, K = input().strip().split()
h = list(map(int, input().split()))
count = 0

for i in h:
    if i >= K:
        count += 1
print(count)

N, K = input().strip().split()
h = list(map(int, input().split()))
count = [i for i in h if i >= K]
print(len(count))

N, K = map(int, input().split())
h = list(map(int, input().split()))
count = [i for i in h if i >= K]
print(len(count))

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))
ans = [0]*n

for i in range(n):
    ans[a[i]-1]=i+1

print(" ".join(map(str,ans)))

n, k = map(int, input().split())

h = list(map(int, input().split()))

ans=0

for i in range(n):
    if h[i]>=k:
        ans+=1

print(ans)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n = input()
k = int(input())
ar = list(map(int, input().split()))
ans = 0
for i,v in enumerate(ar):
  if v <= k:
    ans+= 1
print(ans)

n = input()
k = int(input())
ar = list(map(int, input().split()))
ans = 0
for i in ar:
  if i <= k:
    ans+= 1
print(ans)

n,k = map(int, input().split())
ar = list(map(int, input().split()))
ans = 0
for i,v in enumerate(ar):
  if v <= k:
    ans+= 1
print(ans)

n,k = map(int, input().split())
ar = list(map(int, input().split()))
ans = 0
for i,v in enumerate(ar):
  if v >= k:
    ans+= 1
print(ans)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
# ABC142

n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
ct = 0
for i in range(n):
    if H[i] > k:
        ct += 1
print(ct)


n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
ct = 0
k
for i in H:
    print(i)
    if i > k:
        print(i)
        ct += 1
print(ct)


# ABC142

n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
ct = 0
for i in range(n):
    print(i)
    if H[i] < k:
        ct += 1
print(ct)


# ABC142

n, k = map(int, input().split())
H = list(map(int, input().split()))
ct = 0
for i in range(n):
    if H[i] >= k:
        ct += 1
print(ct)


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k=map(int,input().split())
A=list(map(int,input().split()))
c=0
for i in range(len(A)):
  if A[i]>=K:
    c+=1
print(c)

n,k=map(int,input().split())
A=list(map(int,input().split()))
c=0
for i in range(len(A)):
    if A[i]>=k:
        c+=1
print(c)

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int,input().split())
l = list(map(int,input().split()))
ans = 0
for i in range n:
  if(l[i]>=k):
    ans += 1
print(ans)

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


Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
args = []
a = input()
while a:
  for x in a.split():
    args.append(int(x))
  a = input()

b = [x for x in args[2:] if x >= args[1]]
print(len(b))

args = input().split()
heights = input().split()

b = [x for x in heights if int(x) >= int(args[1])]
print(len(b))

Verdicts: Runtime Error

Accepted
Problem: N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i-th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?

Submission attempts (in order):
n,k = map(int, input().split())
a = list(map(int, input(),split()))
ans = 0
for i in range(len(a)):
    if a[i] >= k:
        ans += 1
print(ans)

n,k = map(int, input().split())
a = list(map(int, input(),split()))
ans = 0
for i in range(len(a):
    if a[i] >= k:
        ans += 1
print(ans)

n,k = map(int, input().split())
a = list(map(int, input(),split()))
ans = 0
for i in range(len(a):
    if a[i] >= k:
        ans += 1
print(ans)

n,k = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
    if a[i] >= k:
        ans += 1
print(ans)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted