ZhenlongDai/ACPR huggingface dataset:
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d=map(int,input().split())
d = 2*d+1
s = n 
print(s)

Failing test case input:
36 28

Expected output:
1


Actual output:
36


Fixed submission (verdict: Accepted):
import math

n, d=map(int,input().split())
d = 2*d+1
s = math.ceil(n/d)
print(s)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

a, b = readmi()

count = 1
n = b + 1
while(n <= a):
    n += (b * 2) + 1
    count += 1
    if n + b >= a:
        break
print(count)

Failing test case input:
36 28

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

a, b = readmi()

count = 1
n = b + 1
while(n + b < a):
    n += (b * 2) + 1
    count += 1
print(count)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=[]
for x in input().split(" "):
    a.append(int(x))
    
print(int(a[0]/(2*a[1]+1))+1)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
a=[]
for x in input().split(" "):
    a.append(int(x))

if a[0]
    print(a[0]
else:
    print(a[0]

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())


if N%(2*D+1) == 0 :
	ans = 0
	ans = int(N%(2*D+1))
	print(ans)
else:
	ans = 0
	ans = int(N%(2*D+1))+1
	print(ans)

Failing test case input:
2 62

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())


if N%(2*D+1) == 0 :
	ans = 0
	ans = N
	print(ans)
else:
	ans = 0
	ans = int(N
	print(ans)

Problem: p02970
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n, d = map(int, input().split())
c = 0
while n > d:
    d = d*2 + 1
    c += 1
if c == 0:
    print(1)
else:
    print(c)

Failing test case input:
57 0

Expected output:
57


Actual output:
6


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
c = 0
p = d*2 + 1
tmp = 0
while n > tmp:
    tmp = tmp+p
    c += 1
print(c)
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int, input().split())
sum = 1
cnt = 0
while sum > N:
  sum += 2*D
  cnt += 1
 
print(cnt)

Failing test case input:
20 14

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())
S = 0
cnt = 0
while S < N:
  S += 1+2*D
  cnt +=1
print(cnt)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())
if n%(2*d+1) == 0:
    print(n%(2*d+1))
else:
    print(n%(2*d+1)+1)

Failing test case input:
20 28

Expected output:
1


Actual output:
21


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())
if n%(2*d+1) == 0:
    print(int(n/(2*d+1)))
else:
    print(int(n/(2*d+1)+1))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())

for i in range(N):
  if N <= 2*D + i:
    break
print(i)

Failing test case input:
20 28

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())

for i in range(100):
  if N <= 2*D*i + i:
    break
print(i)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

S = input()

S = S.split()

N = int(S[0])
D = int(S[1])

print(math.ceil(N*(2*D+1)))

Failing test case input:
20 14

Expected output:
1


Actual output:
580


Fixed submission (verdict: Accepted):
import math

S = input()

S = S.split()

N = int(S[0])
D = int(S[1])

print(math.ceil(N/(2*D+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())

ans = 0

n -= (d+1)  
ans += 1
while True:
    if (n - d) == 0:
        break
    else:
        n -= (2*d + 1)
        ans += 1
        if n <= 0:
            break

print(ans)


Failing test case input:
36 28

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())

ans = 0

n -= (d+1)  
ans += 1
if n <= 0:
    print(ans)
    exit()
while True:
    if (n - d) <= 0:
        break
    else:
        n -= (2*d + 1)
        ans += 1
        if n <= 0:
            break

print(ans)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())
print((2 * d + n) / (2 * d + 1))

Failing test case input:
2 62

Expected output:
1


Actual output:
1.008


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
print((2 * d + n)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input_data=input()
input_data=input_data.split()
N=int(input_data[0])
D=int(input_data[1])

x=N/(2*D+1)
a=type(x)
if  a==float:
    output=int(x)+1
else :
    output=x

print(output)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
input_data=input()
input_data=input_data.split()
N=int(input_data[0])
D=int(input_data[1])

x=N/(2*D+1)

if  int(x)==x:
    output=x
    output=int(x)
else :
    output=int(x)+1

print(output)
Problem: p02970
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def resolve():
    N, D = map(int, input().split())
    miru = 2 * D + 1
    for i in range(1, N):
        if (N - miru * i <= 0):
            print(i)
            break
resolve()

Failing test case input:
57 0

Expected output:
57


Actual output:

Fixed submission (verdict: Accepted):
def resolve():
    N, D = map(int, input().split())
    miru = 2 * D + 1
    for i in range(1, N + 1):
        if (N - miru * i <= 0):
            print(i)
            break
resolve()

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int, input().split())

x=N/(2*D+1)

if x.is_integer==True:
    print(int(x))
else:
    print(int(x)+1)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
N,D = map(int, input().split())

x=N/(2*D+1)
if x.is_integer()==True:
    print(int(x))
else:
    print(int(x)+1)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    n, d = map(int, input().split(' '))
    print(int((n / (2*d + 1))+1))


if __name__ == '__main__':
    main()

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
import math

def main():
    n, d = map(int, input().split(' '))
    print(math.ceil((n / (2*d + 1))))


if __name__ == '__main__':
    main()

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = input().split()
n = int(n)
d = int(d)

if n%(d*2+1)==0:
    print(int(n/(d*2+1)))
else:
    print(int(n/(d*2+1)))

Failing test case input:
36 28

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n,d = input().split()
n = int(n)
d = int(d)

if n%(d*2+1)==0:
    print(int(n/(d*2+1)))
else:
    print(int(n/(d*2+1))+1)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())

print(-(-(n-d)/(d+1)))

Failing test case input:
36 28

Expected output:
1


Actual output:
0.27586206896551724


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())

print(-(-n

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())

A = [i for i in range(1,N+1)]


def people(t):
    t = t + 2*D
    return t
if N<D:
    print(1)

else:
    t = 1
    c = 0
    while t < N:
        
        t = people(t+1)
        c+=1
    print(c)
    

Failing test case input:
57 0

Expected output:
57


Actual output:
56


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())

def people(t):
    t = t + 2*D
    return t
if N<D:
    print(1)

else:
    t = 1
    c = 0
    while t <= N:
        
        t = people(t+1)
        c+=1
    print(c)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d=map(int ,input().split())
print((n+2*d)/(2*d+1))

Failing test case input:
20 28

Expected output:
1


Actual output:
1.3333333333333333


Fixed submission (verdict: Accepted):
n,d=map(int,input().split())
print((n+2*d)
Problem: p02970
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n, d = map(int, input().split())
c = 0
while n > d:
    d = d*2 + 1
    c += 1
print(c)

Failing test case input:
57 0

Expected output:
57


Actual output:
6


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
c = 0
p = d*2 + 1
tmp = 0
while n > tmp:
    tmp = tmp+p
    c += 1
print(c)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
b=b*2+1
c=0
c=a/b
if c>b:
  print(c+1)
else:
  print(c)

Failing test case input:
2 62

Expected output:
1


Actual output:
0.016


Fixed submission (verdict: Accepted):
a,b=map(float,input().split())

d=b*2+1

c=a/d

if c>int(c):
  print(int(c)+1)
else:
  print(int(c))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n , d = map(int, input().split())
count = 0

for i in range(n):
    if n > 2*d+1:
        count += 1
        n = n - 2*d+1
if n != 0:
    count += 1

print(count)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n , d = map(int, input().split())
count = 0

for i in range(n):
    if n >= 2*d+1:
        count += 1
        n = n - (2*d+1)

if n != 0:
    count += 1
print(count)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())
import math
print(math.ceil((n-1)/(2*d+1)) )


Failing test case input:
57 0

Expected output:
57


Actual output:
56


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())
import math
print(math.ceil(n/(2*d+1)) )

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())

for i in range(N):
  if N <= 2*D*i + i:
    break
print(i)

Failing test case input:
57 0

Expected output:
57


Actual output:
56


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())

for i in range(100):
  if N <= 2*D*i + i:
    break
print(i)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())
print(round(n / (d * 2 + 1) + 0.5))

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
print(int((n + d * 2) / (d * 2 + 1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = list(map(int,input().split()))

human = 1
kanshi = 2*D+1

while kanshi < N-1:
    kanshi = kanshi*2
    human +=1
    
print(human)

Failing test case input:
57 0

Expected output:
57


Actual output:
7


Fixed submission (verdict: Accepted):
N,D = list(map(int,input().split()))
human = 1
hani = 2*D+1
while hani < N:
    hani = hani + (2*D+1)
    human +=1
    
print(human)
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N,D=map(int,input().split())
if (N/((D*2)+1))%2==0 or (N/((D*2)+1))==1:
    print(int(N/((D*2)+1)))
else:
    print(int(N/((D*2)+1))+1)


Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):


N,D=list(map(int,input().split()))
if N%(D*2+1)==0:
    print(int(N/((D*2)+1)))
else:
    print(int(N/((D*2)+1))+1)

Problem: p02970
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N, D = list(map(int, input().split()))

ans = (N + 1) 
print(ans)


Failing test case input:
36 28

Expected output:
1


Actual output:
37


Fixed submission (verdict: Accepted):
N, D = list(map(int, input().split()))

ans = -(-N 
print(ans)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = list(map(int, input().split()))
print((n / (2*d+1)) + 1)


Failing test case input:
57 0

Expected output:
57


Actual output:
58.0


Fixed submission (verdict: Accepted):
import math
n,d = list(map(int, input().split()))
print(math.ceil(n / (2*d+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main11():
    data = input().split()
    num = []
    for i in range(2):
        num.append(int(data[i]))
    result = int(num[0] / (num[1] * 2 + 1))
    print(result)

if __name__ == "__main__":
    main11()

Failing test case input:
20 14

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
def main11():
    data = input().split()
    num = []
    for i in range(2):
        num.append(int(data[i]))
    result = int(num[0] / (num[1] * 2 + 1))
    if int(num[0] % (num[1] * 2 + 1)) != 0:
        result = result + 1
    print(result)

if __name__ == "__main__":
    main11()

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())

ret=round(N / (2*D+1) +0.5)
print(ret)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
import math
N,D=map(int,input().split())

ret=math.ceil(N / (2*D+1))
print(ret)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())

ans = int(N%(2*D+1))

if ans  == 0:
	print(ans)
else:
	ans += 1
	print(ans)

Failing test case input:
57 0

Expected output:
57


Actual output:
0


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())


if N%(2*D+1) == 0 :
	ans = 0
	ans = N
	print(ans)
else:
	ans = 0
	ans = int(N
	print(ans)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())
print((n + d + d) / (d + d + 1))


Failing test case input:
20 28

Expected output:
1


Actual output:
1.3333333333333333


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
print(int((n + d + d) / (d + d + 1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
n,d= map(int,input().split())
math.ceil(n/(d*2+1))

Failing test case input:
20 28

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
import math
n,d= map(int,input().split())
print(math.ceil(n/(d*2+1)))
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

def main():

    N,D = map(int,input().split())
    D += 4

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



if __name__== "__main__":
    main() 


Failing test case input:
57 0

Expected output:
57


Actual output:
15


Fixed submission (verdict: Accepted):

def main():

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

    power = D*2+1

    if N <= power:
        print(1)
        exit()

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



if __name__== "__main__":
    main()

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=map(int,input().split())
d=b*2+1

c=a/d
if c>b:
  print(c+1)
else:
  print(c)

Failing test case input:
20 28

Expected output:
1


Actual output:
0.3508771929824561


Fixed submission (verdict: Accepted):
a,b=map(float,input().split())

d=b*2+1

c=a/d

if c>int(c):
  print(int(c)+1)
else:
  print(int(c))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math


a, b = [int(i) for i in input().split()]








print(int(a/(2*b + 1))+1)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
import math


a, b = [int(i) for i in input().split()]








print(math.ceil(a/(2*b + 1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = map(int, input().split())
 
result = N 
 
print(result)

Failing test case input:
36 28

Expected output:
1


Actual output:
36


Fixed submission (verdict: Accepted):
N, D = map(int, input().split())
 
result = -(-N 
 
print(result)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

def main():

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

    power = D*2+1

    if N <= power:
        print(1)

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



if __name__== "__main__":
    main() 


Failing test case input:
20 28

Expected output:
1


Actual output:
1
1


Fixed submission (verdict: Accepted):

def main():

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

    power = D*2+1

    if N <= power:
        print(1)
        exit()

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



if __name__== "__main__":
    main()

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = map(int, input().split())
d = []
i = 1
while len(d) <= N:
    d += [i]*(D*2+1)
    i += 1
len(set(d))

Failing test case input:
20 28

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
N, D = map(int, input().split())
d = []
i = 1
while len(d) <= N:
    d += [i]*(D*2+1)
    i += 1
print(len(set(d[:N])))
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
N, D = map(int,input().split())
print(N, D)
cnt = math.floor(N/(2*D+1))
if N%(2*D+1) != 0:
  cnt += 1
print(cnt)

Failing test case input:
20 28

Expected output:
1


Actual output:
20 28
1


Fixed submission (verdict: Accepted):
import math
N, D = map(int,input().split())
cnt = math.floor(N/(2*D+1))
if N%(2*D+1) != 0:
  cnt += 1
print(cnt)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
N, D = map(int, input().split())
math.ceil(N/(D*2+1))

Failing test case input:
2 62

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
import math
N, D = map(int, input().split())
print(math.ceil(N/(D*2+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = list(map(int,input().split()))

human = 1
kanshi = 2*D+1

while kanshi < N:
    kanshi = kanshi + kanshi
    human +=1
    
print(human)

Failing test case input:
57 0

Expected output:
57


Actual output:
7


Fixed submission (verdict: Accepted):
N,D = list(map(int,input().split()))
human = 1
hani = 2*D+1
while hani < N:
    hani = hani + (2*D+1)
    human +=1
    
print(human)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())
if n < 2*d or n % (2*d +1) == 0:
  print(1)
else:
  ans = n 
  print(ans)

Failing test case input:
57 0

Expected output:
57


Actual output:
1


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
if n < 2*d:
  print(1)
elif n % (2*d +1) == 0:
  print(n 
else:
  ans = n 
  print(ans)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N , D = map(int, input().split())

d = 2*D + 1
num = int(N / d)

if (N % d == 0):
  num += 1
  
print(num)

Failing test case input:
20 28

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N , D = map(int, input().split())
 
d = 2*D + 1
num = int(N 
 
if (N % d != 0):
  num += 1
  
print(num)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d=map(int,input().split())
c=1
i=d+1
while i<=n:
    i+=(2*d+1)
    c+=1
    if (i+d)>=n:
        break
print(c)

Failing test case input:
36 28

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):
n,d=map(int,input().split())
c=1
i=d+1
while i<=n:
    if (i+d)>=n:
        break
    i+=(2*d+1)
    c+=1
print(c)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())
people=N/(2*D+1)
if people % 2 == 0:
    print(int(people))
else:
    print(int(people)+1)


Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
N,D=map(int,input().split())
people=N/(2*D+1)
if N % (2*D+1) == 0:
    print(int(people))
else:
    print(int(people)+1)

Problem: p02970
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import math
N,D = map(int,input().split())
print(math.ceil(D/N/2))

Failing test case input:
2 62

Expected output:
1


Actual output:
16


Fixed submission (verdict: Accepted):
import math
N,D = map(int,input().split())
print(math.ceil(N/(D*2+1)))
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())

max = (n - d) - d
count = 1

for i in range(1000):
  if max <= 1:
    break
  max = (max - (d*2)) 
  count += 1

print(count)

Failing test case input:
57 0

Expected output:
57


Actual output:
1001


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())

max = (n - d) - d
count = 1

for i in range(1000):
  if max <= 1:
    break
  max = (max - (d*2) -1) 
  count += 1

print(count)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D = map(int,input().split())


tmp = D + D + 1
cnt = 1
while N > tmp:
    tmp +=tmp
    cnt+=1

print(cnt)

Failing test case input:
57 0

Expected output:
57


Actual output:
7


Fixed submission (verdict: Accepted):
N,D = map(int,input().split())


tmp = D + D + 1
condition = tmp
cnt = 1
while N > condition:
    condition +=tmp
    
    cnt+=1

print(cnt)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d=map(int ,input().split())
print(n/(2*d+1))

Failing test case input:
20 14

Expected output:
1


Actual output:
0.6896551724137931


Fixed submission (verdict: Accepted):
n,d=map(int,input().split())
print((n+2*d)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())
r = d * 2 + 1
cnt = 0

while n >= 0:
    n = n - r
    cnt += 1

print(cnt)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())
r = d * 2 + 1
cnt = 0

while n > 0:
    n = n - r
    cnt += 1

print(cnt)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = map(int,input().split())
a = 1
while n/((2*d+1)*a) >= 1:
  a+=1
print(a)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n,d = map(int,input().split())
a = 1
while n/((2*d+1)*a) > 1:
  a+=1
print(a)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())
min = (n+((2*d+1)-n%(2*d+1)))/(2*d+1)
print(min)


Failing test case input:
57 0

Expected output:
57


Actual output:
58.0


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
a = int((n+2*d)/(2*d+1))
print(a)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = map(int, input().split())
print(round(N / (D * 2 + 1)))


Failing test case input:
2 62

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
import math
N, D = map(int, input().split())
print(math.ceil(N / (2*D+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = (int(x) for x in input().split())
X = N / (2 * D + 1)

if (X.is_integer()):
  print(X)
else:
  print(int(X) + 1)


Failing test case input:
57 0

Expected output:
57


Actual output:
57.0


Fixed submission (verdict: Accepted):
N, D = (int(x) for x in input().split())
X = N / (2 * D + 1)

if (X.is_integer()):
  print(int(X))
else:
  print(int(X) + 1)
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = map(int, input().split())

for i in range(n):
    if i * (2 * d + 1) >= n:
        print(i)
        break
else:
    print(0)

Failing test case input:
57 0

Expected output:
57


Actual output:
0


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())

for i in range(1, n+1):
    if i * (2 * d + 1) >= n:
        print(i)
        break

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d = input().split()
hon = 2 * int(d) + 1
a = int(n) / hon
for i in range(1,20):
  if a == i:
    answer = a
  else:
    answer = a + 1
print(int(answer))

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n,d = input().split()
hon =( 2 * int(d) ) + 1
a = int(n) / hon
if a == int(a):
  answer = a
else:
  answer = a + 1
print(int(answer))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())
a=0
while a*((2*D)+1)<=N:
    a=a+1
print(a)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
N,D=map(int,input().split())
a=0
while a*((2*D)+1)<N:
    a=a+1
print(a)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())
print((N+D*2)/(D*2+1))


Failing test case input:
2 62

Expected output:
1


Actual output:
1.008


Fixed submission (verdict: Accepted):
N,D=map(int,input().split())
print(int((N+D*2)/(D*2+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
N,D=map(int,input().split())
tmp = D *2.0 + 1
print(tmp)
print(int(math.ceil(N / tmp)))

Failing test case input:
2 62

Expected output:
1


Actual output:
125.0
1


Fixed submission (verdict: Accepted):
import math
N,D=map(int,input().split())
tmp = D *2.0 + 1
print(int(math.ceil(N / tmp)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
n,d=map(int, input().split())
print(math.ceil(n/(2*d+1))+1)

Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
import math
n,d=map(int, input().split())
print(math.ceil(n/(2*d+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d=map(int,input().split())
if(d>=10):
    print(1)
else:
    x=2*d+1
    print(int(n/x)+1)




Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n,d=map(int,input().split())
x=2*d+1
if(n%x!=0):
    print(int(n/x)+1)
else:
    print(int(n/x))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
n,d=map(int,input().split())
print(math.ceil(n/2*d+1))

Failing test case input:
36 28

Expected output:
1


Actual output:
505


Fixed submission (verdict: Accepted):
import math
n,d=map(int,input().split())
print(math.ceil(n/(2*d+1)))
Problem: p02970
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N,d = map(int,input().split())
 
if N%(2*d+1)==0:
  print(N/(2*d+1))
else:
  print(int((N/(2*d+1))+1))

Failing test case input:
57 0

Expected output:
57


Actual output:
57.0


Fixed submission (verdict: Accepted):
N,d = map(int,input().split())
 
if N%(2*d+1)==0:
  print(int(N/(2*d+1)))
else:
  print(int((N/(2*d+1))+1))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

N, D = map(int,input().split())
print(math.floor(N / (D*2+1)))

Failing test case input:
36 28

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
import math

N, D = map(int,input().split())
print(math.ceil(N / (D*2+1)))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = map(int, input().split())

d, m = divmod(N, 2 * D + 1)
print(d, m)
if m != 0:
    d += 1
print(d)

Failing test case input:
20 14

Expected output:
1


Actual output:
0 20
1


Fixed submission (verdict: Accepted):
N, D = map(int, input().split())

d, m = divmod(N, 2 * D + 1)
if m != 0:
    d += 1
print(d)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, d = input().split(" ")
n = int(n)
d = int(d)
print(n / (2*d+1) + int(n % (2*d+1) != 0))

Failing test case input:
20 28

Expected output:
1


Actual output:
1.3508771929824561


Fixed submission (verdict: Accepted):
string = input()
n, d = string.split(" ")
n = int(n)
d = int(d)
print(n

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())
a=0
while a*((2*D)+1)>=N:
    a=a+1
print(a)

Failing test case input:
2 62

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N,D=map(int,input().split())
a=0
while a*((2*D)+1)<N:
    a=a+1
print(a)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, D = map(int, input().split(' '))
ans = N / (D*2+1)
if ans >= int(ans):
    ans = ans+1
print(int(ans))


Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
N, D = map(int, input().split(' '))
ans = N / (D*2+1)
if ans > int(ans):
    ans = ans+1
print(int(ans))

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,d=map(int, input().split())
if (n%(2*d+1)) == 0:
    print(n%(2*d+1))
else:    
    print(n%(2*d+1)+1)

Failing test case input:
57 0

Expected output:
57


Actual output:
0


Fixed submission (verdict: Accepted):
n,d=map(int, input().split())
if (n%(2*d+1)) == 0:
    print(n
else:    
    print(n

Problem: p02970
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, d = map(int, input().split())
ans = 0
while True:
  ans +=1
  n -= 2*d+1
  if n < 0:
    print(ans)
    break


Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
n, d = map(int, input().split())
ans = 0
while True:
  ans +=1
  n -= 2*d+1
  if n <= 0:
    print(ans)
    break
Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,D=map(int,input().split())
total=0
i=0
while N>=total:
  i+=1
  total=(2*D+1)*i
print(i)


Failing test case input:
57 0

Expected output:
57


Actual output:
58


Fixed submission (verdict: Accepted):
N,D=map(int,input().split())
total=0
i=0
while N>total:
  i+=1
  total=(2*D+1)*i
print(i)

Problem: p02970
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

import math

def solve():
    N, D = list(map(int, input().split()))
    print(math.ceil(N/(D+1)))

if __name__ == "__main__":
    solve()


Failing test case input:
20 14

Expected output:
1


Actual output:
2


Fixed submission (verdict: Accepted):

import math

def solve():
    N, D = list(map(int, input().split()))
    print(math.ceil(N/(D*2+1)))

if __name__ == "__main__":
    solve()
Problem: p03700
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
from math import ceil 
n,a,b=map(int,input().split())
l=[int(input()) for i in range(n)]
def check(x):
    c=0
    l1=[i-b*x for i in l]
    
    for i in l1: 
         c+=ceil((i)/(a-b))
    return c<=x
lo=0 
ans=-1 
hi=10**10
while lo<=hi:
    mi=(lo+hi)>>1 
    if check(mi):
        ans=mi 
        hi=mi-1
    else:
        lo=mi+1 
print(ans)


Failing test case input:
5 2 1
105611412
900000000
1010000000
1000000101
1100000000

Expected output:
802000021


Actual output:
685935253


Fixed submission (verdict: Accepted):
from math import ceil 
n,a,b=map(int,input().split())
l=[int(input()) for i in range(n)]
def check(x):
    c=0
    l1=[i-b*x for i in l]
    for i in l1: 
         if i<=0:
             continue 
         c+=ceil((i)/(a-b))
    return c<=x
lo=0 
ans=-1 
hi=10**9+4 
while lo<=hi:
    mi=(lo+hi)>>1 
    if check(mi):
        ans=mi 
        hi=mi-1
    else:
        lo=mi+1 
print(ans)
Problem: p02760
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
X=[list(map(int,input().split()))for i in range(3)]
b=[int(input())for i in range(int(input()))]
for i in range(3):
 X[i]=[1 if i in b else 0 for i in X[i]]
print("Yes" if 3>=max(*[sum(i)for i in X],*[sum([x[i] for x in X])for i in range(3)],X[0][0]+X[1][1]+X[2][2],X[0][2]+X[1][1]+X[2][0]) else "No")

Failing test case input:
36 68 8
92 41 13
39 47 49
4
74
43
12
10
48
73
65
66
125
57

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
X=[list(map(int,input().split()))for i in range(3)]
b=[int(input())for i in range(int(input()))]
for i in range(3):
 X[i]=[1 if i in b else 0 for i in X[i]]
print("Yes" if 3<=max(*[sum(i)for i in X],*[sum([x[i] for x in X])for i in range(3)],X[0][0]+X[1][1]+X[2][2],X[0][2]+X[1][1]+X[2][0]) else "No")
Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
a = [int(temp) for temp in input().split()]
a.sort
a = [str(temp) for temp in a]
print(' '.join(a))

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
3 6 9 7 5


Fixed submission (verdict: Accepted):
a = [int(temp) for temp in input().split()]
a.sort(reverse = True)
a = [str(temp) for temp in a]
print(' '.join(a))

Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
a=sorted([int(i) for i in input().split()],reverse=True)
print(",".join(map(str,a)))

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
9,7,6,5,3


Fixed submission (verdict: Accepted):
a=sorted([int(i) for i in input().split()],reverse=True)
print(" ".join(map(str,a)))

Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
print(sorted(list(map(int, input().split())), reverse=True))

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
[9, 7, 6, 5, 3]


Fixed submission (verdict: Accepted):
print(' '.join(map(str, sorted(list(map(int, input().split())), reverse=True))))

Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
l = list(map(int,input().split()))
l.sort(reverse=True)
print(l)

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
[9, 7, 6, 5, 3]


Fixed submission (verdict: Accepted):
l = list(map(int,input().split()))
l.sort(reverse=True)
l = [str(i) for i in l]
print(' '.join(l))

Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
print(' '.join(map(str, sorted(map(int, input().split())))))

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
3 5 6 7 9


Fixed submission (verdict: Accepted):
print(' '.join(map(str, sorted(map(int, input().split()), reverse=True))))

Problem: p00018
Buggy submission (Python3, verdict: Wrong Answer):
print(sorted(map(int, input().split()), reverse=True))

Failing test case input:
3 6 9 7 5

Expected output:
9 7 6 5 3

Actual output:
[9, 7, 6, 5, 3]


Fixed submission (verdict: Accepted):
print(' '.join(map(str, sorted(map(int, input().split()), reverse=True))))
Problem: p02898
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N, K = map(int, input().split())
heights = list(map(int, input().split()))
unqualified = 0

for height in heights:
    if height < K:
        unqualified += 1

print(unqualified)


Failing test case input:
0 500
499

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())
heights = list(map(int, input().split()))
qualified = 0

for height in heights:
    if height >= K:
        qualified += 1

print(qualified)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k=map(int,input().split())
h=input().split()
for i in range(0,n-1):
  h[i]=int(h[i])
count=0
for i in range(0,n-1):
  if h[i]>=k:
    count=count+1
print(count)


Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n,k=map(int,input().split())
h=input().split()
for i in range(0,len(h)):
    h[i]=int(h[i])
count=0
for i in range(0,len(h)):
    if h[i]>=k:
        count=count+1
print(count)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

Failing test case input:
-2 1156
20

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
    print("0")
    exit()
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 0, 0
while i < len(h):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Failing test case input:
5 4
000 200 300 467 500

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = input().split(' ')
h = input().split(' ')
h.reverse()
count = 0
for i in range(0, int(n)):
  if int(h[i]) >= int(k):
    count += 1
  else:
    pass
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import re

num, lim = input().split()
x = re.split(' +', input())
print(len([person for person in x if person >= lim]))


Failing test case input:
-1 1020
262

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
num, lim = map(int, input().split())
x = map(int, input().split())
print(len([person for person in x if person >= lim]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k=[int(i) for i in input().split()]
ans=[i for i in input().split() if int(i)>k]
print(len(ans))

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n,k=[int(i) for i in input().split()]
ans=[i for i in input().split() if int(i)>=k]
print(len(ans))
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int, input().split())
H = map(int, input().split())
cnt = 0
for i in H:
  if i > K:
    cnt += 1
print(cnt)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())
H = map(int, input().split())
cnt = 0
for i in H:
  if i >= K:
    cnt += 1
print(cnt)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n,k=map(int, input().split())
a=list(map(int, input().split()))
cnt=0
for i in a:
    if i >= 150:
        cnt+=1
print(cnt)

Failing test case input:
-1 584
289

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n,k=map(int, input().split())
a=list(map(int, input().split()))
cnt=0
for i in a:
    if i >= k:
        cnt+=1
print(cnt)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))

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

Failing test case input:
5 4
000 200 300 467 500

Expected output:
4


Actual output:

Fixed submission (verdict: Accepted):
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))

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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k = map(int,input().split())
h = list(map(int,input().split()))
count = 0
for i in range(n):
    if h[i] >= 150:
        count+=1
print(count)

Failing test case input:
5 0
100 71 476 467 38

Expected output:
5


Actual output:
2


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n , k = map(int,input().split())
h_list = list(map(int,input().split()))
count = 0
for h in h_list:
    if h < k:
        count += 1

print(count)

Failing test case input:
0 912
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n , k = map(int,input().split())
h_list = list(map(int,input().split()))
count = 0
for h in h_list:
    if h >= k:
        count += 1

print(count)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)


Failing test case input:
5 1
100 86 476 302 500

Expected output:
5


Actual output:
1
2
3
4
5


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N_K = str(input())
H = str(input()).split(" ")

N = N_K.split(" ")[0]
K = N_K.split(" ")[1]

count = 0
for h in H:
    if K <= h:
        count += 1

print(count)


Failing test case input:
0 668
84

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N_K = str(input())
H = str(input()).split(" ")

N = N_K.split(" ")[0]
K = N_K.split(" ")[1]

count = 0
for h in H:
    if int(K) <= int(h):
        count += 1

print(count)

Problem: p02898
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N,K=map(int,input().split())
h=sorted(list(map(int,input().split())))
ans = 0
for i in range(N):
  if h[i]>=K:
    ans += h[i]
print(ans)

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
432


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = map(int, input().split())
lst = [int(i) for i in input().split()]
print(len([j for j in lst if j > k]))


Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = map(int, input().split())
lst = [int(i) for i in input().split()]
print(len([j for j in lst if j >= k]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0
for i in h:
  if i>=K:
    a+=1
  else:
    break
    

Failing test case input:
-2 500
56

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0
for i in h:
  if i>=K:
    a+=1
  else:
    break
print(a)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k = map(int,input().split())
ans = 0
for i in range(n):
  if i >= k:
    ans += 1
print(ans)
  

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
0


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N, K = input().split()
height_list = input().split()
count = sum([1 for h in height_list if h>K])
print('{}'.format(count))


Failing test case input:
-4 500
56

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
count = sum(h>=K for h in h_list)
print('{}'.format(count))
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
s = 0
for i in range(n):
    if a[i] >= k:
        s += 1
    else:
        print(s)
        exit(0)


Failing test case input:
5 1
100 200 476 467 500

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
s = 0
for i in range(n):
    if a[i] >= k:
        s += 1
    else:
        print(s)
        exit(0)
print(s)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k=input().split(" ") 
h=input().split(" ") 
c=0
for i in h:
  if int(i )>int(k):
    c+=1
print (c)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n,k=input().split(" ") 
h=input().split(" ") 
c=0
for i in h:
  if int(i)>=int(k):
    c+=1
print (c)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x = input().split()
y = input().split()

cnt = 0

for i in y:
  if i >= x[1]:
    cnt += 1
    
print(cnt)

Failing test case input:
-1 1020
122

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
x = input().split()
y = input().split()

cnt = 0

for i in y:
  if int(i) >= int(x[1]):
    cnt += 1
    
print(cnt)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N,K=input().split()
print(sum([1 for i in input().split() if K<=i]))

Failing test case input:
-2 1020
194

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N,K=input().split()
print(sum([1 for i in input().split() if int(K)<=int(i)]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    l = input().strip().split(" ")
    n = l[0]
    k = l[1]

    h = input().strip().split(" ")

    r = [x for x in h if x >= k]
    print(r.__len__())


if __name__ == "__main__":
    main()


Failing test case input:
-1 1196
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = int(l[1])

    h = input().strip().split(" ", n)

    count = 0
    for x in h:
        x = int(x)
        if x >= k:
            count += 1

    print(count)


if __name__ == "__main__":
    main()