Problem:


Score : 200 points

Problem Statement

There are N apple trees in a row. People say that one of them will bear golden apples.

We want to deploy some number of inspectors so that each of these trees will be inspected.

Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \leq i \leq N) will inspect the trees with numbers between i-D and i+D (inclusive).

Find the minimum number of inspectors that we need to deploy to achieve the objective.

Constraints

All values in input are integers.

1 \leq N \leq 20

1 \leq D \leq 20

Input

Input is given from Standard Input in the following format:

N D

Output

Print the minimum number of inspectors that we need to deploy to achieve the objective.

Sample Input 1

6 2

Sample Output 1

2

We can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.

Sample Input 2

14 3

Sample Output 2

2

Sample Input 3

20 4

Sample Output 3

3



Sample input:
6 2


Sample output:
2

Submission status: Runtime Error

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
a,b=map(int,input().split())

print(-(-a//(2b+1)))

Submission status: Runtime Error

Solution code:
N,D=map(int,input().split())
m=(N-1)//(2D+1)
n=m+1
print(n)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())
print(y//2*n+1)

Submission status: Runtime Error

Solution code:
N.d = map(int,input().split())

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

Submission status: Runtime Error

Solution code:
n,d = map(int, input().split())
ans = 0
if n % (2d+1) == 0:
  ans = n//(2d+1)
else:
  ans = n//(2d+1) + 1
print(ans)

Submission status: Runtime Error

Solution code:
n,d = map(int, input().split())
ans = 0
if n % (2d+1) == 0:
  ans = n//(2d+1)
else:
  ans = n//(2d+1) + 1

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,D=map(int,input().split())
print((N//(2D+1))+1)

Submission status: Runtime Error

Solution code:
N,D = map(int, input().strip().split(' '))
area = 2*D+1
print((N+area-1)///area)

Submission status: Runtime Error

Solution code:
import math

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

print(math.ceil(n/(2d+1.0)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = list(map(int,input().split()))
n = l[0]
d = l[1]

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

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
c=a//(2b+1)+1
print(c)

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
if n//(2*d+1) % 0:
    print(n/(2*d+1))
else:
    print(n//(2*d+1)+1)

Submission status: Runtime Error

Solution code:
n, d = int(input().split())

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

Submission status: Runtime Error

Solution code:
import mth
n, d = map(int,input().split())
print(math.ceil(n / (2 * d + 1)))

Submission status: Runtime Error

Solution code:
import mth
n, d = map(int,input().split())
print(math.seil(n / (2 * d + 1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, D = map(int, input().split())
B=2*D
A=N//2B+1
print(A)

Submission status: Runtime Error

Solution code:
N, D = map(int, input().split())
A=N//2D+1
print(A)

Submission status: Runtime Error

Solution code:

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

while True:
    a = n- i*(2*d+1)
    if a<=0:
        print(i)
        break
    else:
        continue

Submission status: Runtime Error

Solution code:
n,d = map(int, input().split())

while True:
    a = n- i*(2*d+1)
    if a<=0:
        print(i)
        break

Submission status: Runtime Error

Solution code:
import math

nd = input().strip().split()
n = nd[0]
d = nd[1]

inspectors = math.ceil(n / (2 * d + 1))
print(inspectors)

Submission status: Runtime Error

Solution code:
import math
n,d=map(int,input().split())
print(math.ceil(n/(2*d+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
inp = list(map(int, input().strip().split(' ')))

a = inp[0]
b = inp[1]

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

Submission status: Runtime Error

Solution code:
i1 = list(map(int, f.input().split()))

o1 = ((i1[0]) // (i1[1]*2 + 1))
o2 = ((i1[0]) % (i1[1]*2 + 1))
if o2 == 0:
    print(o1)
else:
    print(o1 + 1)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
print(int(n//(2*d+1))

Submission status: Runtime Error

Solution code:
n,d=map(int,input())
print(int(n//(2*d+1))

Submission status: Runtime Error

Solution code:
n,d = map(int,input().split())

if (2*d+1) > N:
  print(1)
else:
  print(int(n / (2*d+1)))

Submission status: Runtime Error

Solution code:
n,d = map(int.input(),split())

if (2*d+1) > N:
  print(1)
else:
  print(int(n / (2*d+1)))

Submission status: Runtime Error

Solution code:
import math
N,D=input().split()
print(math.ceil(N/(D*2+1)))

Submission status: Runtime Error

Solution code:
import math
N,D = map(int,input().split())

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

Submission status: Runtime Error

Solution code:
n,d = (int(x) for x in input().split())
if n//(2*d) = 0:
  print(n/(2*d))
else:
  print(n/(2*d)+1)

Submission status: Runtime Error

Solution code:
n,d = (int(x) for x in input().split())
print(n/2d)

Submission status: Runtime Error

Solution code:
N,D = array(input(),input())
print(roundup(N/2D ,0)

Submission status: Runtime Error

Solution code:
n,d = map(int, input().split())
print int((n+(d*2+1)-1)/(d*2+1))

Submission status: Runtime Error

Solution code:
n=int(input())
d=int(input())

d1=d*2+1
print((n+d1-1)/d1)

Submission status: Runtime Error

Solution code:
a = n // (2*d+1)

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

Submission status: Runtime Error

Solution code:
n,d = list(map(int, input().split(' ')))

a = n // (2*d+1)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
d=int(input())
if n%(2*d)==0:
  a=n/(2*d)
   print(a)
else:
  a=n/(2*d)
   print(a)

Submission status: Runtime Error

Solution code:
n=int(input())
d=int(input())
if n%(2*d)==0:
   a=n/(2*d)
   print(a)
else:
   a=n/(2*d)
   print(a)

Submission status: Runtime Error

Solution code:
n=int(input())
d=int(input())
if n%(2*d)==0:
  a=n/(2*d)
  print(a)
else:
  a=n/(2*d)
  print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,d=int(input().split())
if(n%2*d==0)
   print(n%2*d)
else
   print(n%2*d+1)

Submission status: Runtime Error

Solution code:
,d = map(int,input().split())

a = d * 2 + 1

b=n/a
b = int(b)
c=n%a
if c>0:
    b = b + 1
    
print(b)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define dmp(x) cerr<<#x<<":"<<x<<endl
typedef pair<int,int> P;
typedef pair<int,P> PP; 
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
const int MOD = 1e9+7;

signed main(){
  int n,d;
  cin>>n>>d;
  d+=d+1;
  cout<<(n+d-1)/d<<endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
inputs = [int(x) for x in input().split()]

N = inputs[0]
D = inputs[1]
answer = 0
if N < (D*2) + 1:
  answer = 1
else:
  check = N % ((D*2) + 1)
  answer = N / ((D*2) + 1) 
  answer = int(answer)
if check != 0:
  answer += 1
  
print(answer)

Submission status: Runtime Error

Solution code:
N,D=map(int(),input().split())
print(N//(2D+1))

Submission status: Runtime Error

Solution code:
import math
n, d = map(int, input().split)
print(math.ceil(n/(2*d+1)))

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())

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

Submission status: Runtime Error

Solution code:
import math
N,D =map(int,input().split())

x = D * 2 + 1

pre_answer = N / X
print(math.ceil(pre_answer))

Submission status: Runtime Error

Solution code:
N,D =map(int,input().split())

x = D * 2 + 1

pre_answer = - (-N // X)
print(int(pre_answer))

Submission status: Runtime Error

Solution code:
N,D = map(int, input().split())

a = int(N/(2*D+1) + 1
print(a)

Submission status: Runtime Error

Solution code:
import collections
import numpy as np
from matplotlib import pyplot



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

if N[0]%(2*N[1]+1)==0:
 S=int(N[0]/(2*N[1]+1))
else:
 S=int(N[0]/(2*N[1]+1))+1
    
print(S)

Submission status: Runtime Error

Solution code:
import math
N = int(input())
D = int(input())
i = N / (2*D + 1)
if 1 <= N <= 20 and 1 <= D <= 20:
    if i > 0:
        i = math.ceil(i)
        print(i)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector <ll>
#define vii vector <int>
#define vpii vector <pii>
#define vpll vector <pll>
#define ff first
#define ss second
#define matrix vector <vll>
#define all(v) v.begin(),v.end()
#define PQ priority_queue
using namespace std;
ll pow(ll a, ll b){
	ll res = 1;
	while(b > 0){
		if(b&1) res*=a;
		b/=2;
		a*=a;
	}
	return res;
}
int main()
{
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	int n, d;
  	cin >> n >> d;
  	int cnt = 0;
  	int p = 0;
  	while(p < n){
    	p+=(2*d+1)
      	cnt++;
    }
  return 0;
}

Submission status: Runtime Error

Solution code:
lst = int(input().split())
print((lst[0]+2*lst[1])//(2*lst[1]+1))

Submission status: Runtime Error

Solution code:
import math
n, d = map(input().split())
se = d * 2 + 1
print(math.ceil(n/se))

Submission status: Runtime Error

Solution code:
import math
n, d = map(input().split())
se = d * 2 + 1
print(math.ceil(n/d))

Submission status: Runtime Error

Solution code:
import math
N,D = map(int,input().split)
print(N/(D*2+1))

Submission status: Runtime Error

Solution code:
N,D = map(int,input().split())
if N % (D*2+1) != 0:
  p = n // (d*2+1) + 1
else:
  p = n // (d*2+1)
  
print(p)

Submission status: Runtime Error

Solution code:
import math
N, D = map(int, input().split())
person = math.cell(N / (D*2+1))
print(person)

Submission status: Runtime Error

Solution code:
import math
N, D = int(input())
person = math.cell(N / (D*2+1))
print(person)

Submission status: Runtime Error

Solution code:
n,d = mat(int,input().split())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
n, d = map(int, input().split())
a = int(math.seil(n/(2*d+1)))
print(a)

Submission status: Runtime Error

Solution code:

import math
n, d = map(int, input().split())
a = math.seil(n/(2*d+1))
print(a)

Submission status: Runtime Error

Solution code:
N,D = map(int,input(),split())
a = (N-1)//(2*D)
if (N-1)%(2*D) == 0:
	print(a)
else:
 	print((N-1)//(2*D+1))

Submission status: Runtime Error

Solution code:
N,D = map(int,input(),split())
a = (N-1)/(2*D)
if (N-1)%(2*D)==0:
	print(a)
else:
 	print((N-1)//(2*D+1))

Submission status: Runtime Error

Solution code:
N,D = map(int,input(),split()))
a = (N-1)/(2*D)
if (N-1)%(2*D)==0:
	print(a)
else :
 	print((N-1)//2*D+1)

Submission status: Runtime Error

Solution code:
n = int(input())
d = int(input())
ans = n // (2*d + 1)
if n % (2*d + 1) != 0:
  print(ans+1)
else:
  print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
d = int(input())
ans = n/(2*d + 1)
if n % (2*d + 1) != 0:
  print(ans+1)
else:
  print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
d = int(input())
ans = n/(2*d + 1)
if n % (2*d + 1) != 0:
  print("{}".format(ans+1))
else:
  print("{}".format(ans))

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
i = (n // 2*r) + 1
print(i)

Submission status: Runtime Error

Solution code:
t,d = map(int,input().split())
p_a = t//(2d+1)
p_b = t%(2d+1)
if p_b == 0:
  print(p_a)
else:
  print(p_a + 1)

Submission status: Runtime Error

Solution code:
a,b = map(int.input())

c = a//b

print(c+1)

Submission status: Runtime Error

Solution code:
N, D = map(input())
A = (2D+1)//N
if A == 0:
  print(A)
elif A == 1:
  print(A+1)

Submission status: Runtime Error

Solution code:
nd = [int(i) for i in input().split()]
n = nd[0]
d = nd[1]
for i in range(n):
    if n <= (2*d+1)*i:
        D = i
        break
print(D)

Submission status: Runtime Error

Solution code:
n, d = map(int,input().split())

d = d*2+1

for i in range(1,n):
    n -= d
    if n < 1:
        break

print(i)

Submission status: Runtime Error

Solution code:
n, d = map(int,input().split())

for i in range(1,n):
    n -= (2*d+1)
    if n<= 0:
        break

print(i)

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
a = n // (2d + 1) + 1
print(a)

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
a = n // (2d + 1) + 1
print(a)

Submission status: Runtime Error

Solution code:
n = int(input())
d = int(input())
a = n/d + 1
print(a)

Submission status: Runtime Error

Solution code:
N = int(input())
D = int(input())
result = N / (2D + 1)
print(result)

Submission status: Runtime Error

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

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

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
in n%(2*d+1)==0:
  print(n//(2*d+1))
else:
  print(n//(2*d+1)+1)

Submission status: Runtime Error

Solution code:
math.ceil(N/(2D+1))

Submission status: Runtime Error

Solution code:
n=int(input())
d=int(input())
look=d*2+1
ans=int(n/look)
if not ans*look==n:
  ans+=1
  
prin(ans)

Submission status: Runtime Error

Solution code:
N, D = int(input())

print(-(-N//(2*D+1)))

Submission status: Runtime Error

Solution code:
n, d = map(int, input())
print(n//(2*d+1)+(1 if n%(2*d+1)!=0 else 0))

Submission status: Runtime Error

Solution code:
N,D = map(int(input().split()))
sum = 1
cnt = 0
while sum > N:
  sum += 2D
  cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
import math
def q45(n, d):
    a = math.ceil(n/(2*d+1))
    return a

N = int(input())
D = int(input())
print(q45(N, D))

Submission status: Runtime Error

Solution code:
N, D = map(int, input())
print( N//(2*D+1)+1)

Submission status: Runtime Error

Solution code:
N = input()
D = input()
num1 = int(N)
num2 = int(D)
k = (num1 + 2 * num2)//(2 * num2 + 1)
print(k)

Submission status: Runtime Error

Solution code:
N = input()
D = input()
n = int(N)
d = int(D)
k = (n + 2*d)/(2*d+1)
print(k)

Submission status: Runtime Error

Solution code:
N = input()
D = input()
n = int(N)
d = int(D)
k = (n + 2*d)/(2*d+1)

Submission status: Runtime Error

Solution code:
import math
N = input()
D = input()
n = int(N)
d = int(D)
k = n/(2*d+1)
print(math.ceil(k))

Submission status: Runtime Error

Solution code:
import math
N = input()
D = input()
n = int(N)
d = int(D)
k = n/(2d+1)
print(math.ceil(k))

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

Solution code:
import math
N,D = map(int,input().split())
print(math.cell(N/(2*D)))

Submission status: Runtime Error

Solution code:
import math
N,D = map(int,input().split())
print(math.floor(N/(2D)))

Submission status: Runtime Error

Solution code:
import math import ceil

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

t = 2d + 1

print(ceil(n/t))

Submission status: Runtime Error

Solution code:
n,d = map(int,input().split())
sight = 2*d+1
i = 1
while(True)
  if n <= i*sight:
    print(i)
    break
  i += 1

Submission status: Runtime Error

Solution code:
l=list(map(int,input().rstrip().split()))
a=l[0]
b=l[1]
c=(2*b)+1
u=int(a/c)
if(a%c==0):
  print(u)
else():
  print(u+1)

Submission status: Runtime Error

Solution code:
N,D=int(input())
print(N/(2D+1))

Submission status: Runtime Error

Solution code:
    N,D=map(int,input().split())
    print(N//(2*D+2) +1)

Submission status: Runtime Error

Solution code:
N=int(input())
D=int(input())
maximum=2*D+1
if N%maximum==0:
    print(int(N/maximum))
else:
    print(int(N/maximum+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
n,d=map(int,raw_input())
print int( math.ceil(float(n)/(2*d+1)))

Submission status: Runtime Error

Solution code:
n, d = [ int(_) for _ in input().split() ]
x  = n / (2*d+1)
if x.is_integer()
    print( x )
else:
    print( x + 1 )

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
r=a//(2*b+1)
r+=1 if a%(2*b+1)>0
print(r)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
print(ceil(n/(2*d+1)))

Submission status: Runtime Error

Solution code:
N,D=[int(x) for x in input().split()]
if( N/D < N- D*2){
 print(int(N/D)) 
}else{
 print(int(N/D)+1)
}

Submission status: Runtime Error

Solution code:
N,D=[int(x) for x in input().split()]
if( N/D < N- D*2){
 console.log(Math.floor(N/D)) 
}else{
 console.log(Math.floor(N/D)+1)
}

Submission status: Runtime Error

Solution code:
N=int(input())
D=int(input())

print((N+D*2)//(D*2+1))

Submission status: Runtime Error

Solution code:
N=int(input())
D=int(input())
a=2*n+1
b=D//a+1
print(b)

Submission status: Runtime Error

Solution code:
N=int(input())
D=int(input())

print((N+D*2)/(D*2+1))

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
canseerange = 2*d+1
if n % canseerange == 0:
    print(int(n/canseerange))
else:
    print(int(n/canseerange)+1

Submission status: Runtime Error

Solution code:
import math
n,d=map(int,input())
k=math.ceil(n/(2*d))
print(k)

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 1

#端を埋める
for i in range(0,2*d):
    flag[i] = 1

#print(flag)
#print(sum(flag))

if sum(flag) < n:
    for i in range(n-2*d-1, n):
        flag[i] = 1
    people += 1


#print(flag)

for i in range(2*d, n-2*d):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
if d,n==0 or d>n:
  print(0)
else:
  print(n//(2*d)+1)

Submission status: Runtime Error

Solution code:
a.b = map(int.input().split())
c = a/2/b
d = round(c)
print(d)

Submission status: Runtime Error

Solution code:
a.b = map(int.input().split())
c = (a/2/b)
d =count(c)
print(d)

Submission status: Runtime Error

Solution code:
from sys import stdin


N, D = stdin.readline().rstrip().split(' ')
print(int(round(int(N) / (int(D) * 2), 0)

Submission status: Runtime Error

Solution code:
a.b = map(int.input().split())
if a/2%b === 0 :
    print (a/2/b)
else :
print(a/2//b+1)

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 1

#端を埋める
for i in range(0,2*d):
    flag[i] = 1


for i in range(n-2*d-1, n):
    flag[i] = 1

if sum(flag) != n:
    people += 1

#print(flag)

for i in range(2*d, n-2*d):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 0

#端を埋める
for i in range(0,2*d):
    flag[i] = 1

if sum(flag) != n:
    people += 1

for i in range(n-2*d-1, n):
    flag[i] = 1

if sum(flag) != n:
    people += 1

#print(flag)

for i in range(2*d, n-2*d):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 1

#端を埋める
for i in range(0,2*d):
    flag[i] = 1

if sum(flag) != n:
    people += 1
for i in range(n-2*d-1, n):
    flag[i] = 1



#print(flag)

for i in range(2*d, n-2*d):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

Solution code:
n, d = map(int, input().split())
if n%(2*d+1) == 0:
  print(n/(2*d+1))
else:
  print((n/(2*d+1)+1)

Submission status: Runtime Error

Solution code:
N, D = map(int, input())
x = N//((2*D)+1)
if(x*((2*D)+1)>= N):
	print(N//((2*D)+1))
else:
	print((N//((2*D)+1)+1))

Submission status: Runtime Error

Solution code:
N, D = map(int, input())
x = N//((2*D)+1)
if(x*((2*D)+1)>= N):
	print(N//((2*D)+1))
else:
	print(N//((2*D)+1)+1)

Submission status: Runtime Error

Solution code:
N,D = map(int,input().split())
if N =< D:
  print("1")
else:
  s = N / (2 * D + 1)
  print(int(s) + 1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 0

for i in range(0,d):
    flag[i] = 1

for i in range(n-d, n):
    flag[i] = 1

#print(flag)

for i in range(d, n):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

Solution code:
#coding:utf-8
n, d = map(int, input().split())

flag = [0] * n
people = 0

for i in range(0,d):
    flag[i] = 1


for i in range(d, n):
    if flag[i] == 0:
        people += 1
        #print(i)
        for j in range(i, i+d+1):
            if j > n-d:
                flag = [1] * n
                break 
            else:
                flag[j] = 1
        #print(flag)


#print(flag)
print(people)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,D = map(int,input().split())
s = N / (2 * D + 1)
print(math.seil(s))

Submission status: Runtime Error

Solution code:
#A
#n = int(input())
#print(3*n**2)
#B
n, d = map(int, input().split())
canseerange = 2*d+1
if n % canseerange == 0:
    print(int(n/canseerange))
else:
    print(int(n/canseerange)+1
#C
#n = int(input())
#ans = 0
#most1 = 0
#most2 = 0
#ed = False
#for i in range(n):
#    t = int(input())
#    ed = False
#    if most1 <= t:
#        most2 = most1
#        most1 = t
#        ans = i
#        ed = True
#    elif most2 <= t and ed == False:
#        most2 = t
#for i in range(n):
#    if i==ans:print(most2)
#    else:print(most1)
#D

Submission status: Runtime Error

Solution code:
n, d = map(int, input())
print(-(-n // (1 + d * 2)))

Submission status: Runtime Error

Solution code:
n, d = [int(x) for x in input().split()]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
print(-(-n//(2*d))

Submission status: Runtime Error

Solution code:
n, d = input().split()
n=int(n)
d=int(d)
sum=0
count=0
while 1:
  sum=sum+2*d+1
  count+=1
    break
print(count)

Submission status: Runtime Error

Solution code:
import math
n, d = map(int, input().split())
x = 2*n + 1
print(int(math.ceil(n/x))

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
print(-(-n//2d))

Submission status: Runtime Error

Solution code:
N, D = map(int, input().split())
 
result = -(-N // (2D+1))
 
print(result)

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
if(d>=10){
print(1)
}else{
x=2*d+1
print(int(n/x)+1)
}

Submission status: Runtime Error

Solution code:
see = D*2 + 1
need = N // see
if (N % see) > 0:
    need += 1

Submission status: Runtime Error

Solution code:
N, D = map(int, input().split())

result = N // (2D+1) + 1

print(result)

Submission status: Runtime Error

Solution code:
import numpy as np

n,d= int(input())

print(int(np.ceil(n/(2*d+1))))

Submission status: Runtime Error

Solution code:
N = map(int,raw_input()).split()
for i in range(100):
  A = N[0]-(N[1]*2+1)*i
  if A >= 0:
    pass
  else:
    print(i)
    exit()

Submission status: Runtime Error

Solution code:
N = int(input())
D = int(input())

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

Submission status: Runtime Error

Solution code:
N, D = input().split()
each = D*2 + 1 
print(-(-N // each))

Submission status: Runtime Error

Solution code:
import math
n,d = map(int,input().split())
print(math.ceil(n / (2d+1)) )

Submission status: Runtime Error

Solution code:
n,d=map(int,input().split())
if n%(2*d+1)!=0:
   print(n//(2*d+1)+1)
else:
    print(n//(2*d+1

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, D = map(int,input())

watch = D * 2 + 1

ans = ( N + watch - 1 ) // watch

print(ans)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
prnit((a-0.01)//(2*b+1)+1)

Submission status: Runtime Error

Solution code:
N,D = [int(s) for s in input().split()]
print(math.ceil(N/(2*D+1)))

Submission status: Runtime Error

Solution code:
a,b=map(int,input())
print(0--a//b)

Submission status: Runtime Error

Solution code:
 n,b = map(int,input().split())
 
 print(n //(b*2))