Problem:
 Score : 200 points    Problem Statement We have a long seat of width X centimeters.
There are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.  We would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.  At most how many people can sit on the seat?      Constraints  All input values are integers.  1 \leq X, Y, Z \leq 10^5  Y+2Z \leq X         Input Input is given from Standard Input in the following format:  X  Y  Z       Output Print the answer.        Sample Input 1 13 3 1      Sample Output 1 3  There is just enough room for three, as shown below:    Figure        Sample Input 2 12 3 1      Sample Output 2 2       Sample Input 3 100000 1 1      Sample Output 3 49999       Sample Input 4 64146 123 456      Sample Output 4 110       Sample Input 5 64145 123 456      Sample Output 5 109

Solution (Python):
X, Y, Z = map(int, input().split())

print((X-Z) // (Y+Z))

Solution (Python):
x,y,z = map(int,input().split())

print( (x-z) // (y+z) )

Solution (Python):
a,b,c = map(int,input().split())
x = 1

while a >= b*x + c*(x+1):
    x += 1

print(x-1)

Solution (Python):
X,Y,Z = map(int,input().split())
print(int((X-Z)//(Y+Z)))

Solution (Python):
x, y, z = map(int, input().split())
for i in range(x):
    m = i * (y + z) + z
    if m > x:
        break
print(i - 1)

Solution (Python):
a,b,c=map(int,input().split())
print((a-c)//(b+c))

Solution (Python):

x,y,z=map(int,input().split())
ans = (x-z)//(y+z)
print(ans)

Solution (Python):
X, Y, Z = map(int, input().split())
if X - Y -2*Z >= 0:
    print(1+(X-Y-2*Z)//(Y+Z))
else:
    print(0)

Solution (Python):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

X,Y,Z = inpl()
X -= Z
print(X//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())

x = x-z

print(x//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
X, Y, Z = map(int, input().split())
d,m = divmod(X - Z * 2, Y+Z)
print(d + (1 if Y <= m else 0))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
x, y, z = map(int, input().split())

last = x - y - (z*2)
ans = int( last / (y+z) + 1)

print(ans)

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):

def main():
    x, y, z = map(int, raw_input().split())
    a = y + z
    b = x - z
    n = 0

    while True:
        if (n * a) <= b:
            n += 1
        else:
            break

    print(n-1)


if __name__ == '__main__':
    main()

Solution (Python):
x, y, z = map(int, input().split(" "))
l = y + z
n = (x - z) // l
print(n)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
x, y, z = map( int, input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z=map(int,input().split())
n=int((X-Z)/(Y+Z))
print(n)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):


def main():
    x, y, z = map(int, input().split())
    print((x - z) // (y +z))

if __name__ == '__main__':
    main()

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = [int(m) for m in input().split(" ")]

print((x-z) // (y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
import math
X,Y,Z = map(int,input().split())
print(math.floor((X-Z)/(Y+Z)))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())

print(int((x-z)/(y+z)))

Solution (Python):
x, y, z = list(map(int, input().split()))
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = list(map(int, input().split()))
l = X - Y - 2 * Z
print(1 + int(l // (Y + Z)))

Solution (Python):
a,b,c = list(map(int, input().split()));print((a-c)//(b+c))

Solution (Python):
X, Y, Z = map(int, input().split())
ans = int((X - Z) / (Y + Z))
print(ans)

Solution (Python):
x, y, z = map(int, input().split())

x -= z
print(x // (y + z))

Solution (Python):
X, Y, Z = map(int, input().split())
ans = int((X - Z) / (Y + Z))
print(ans)

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
"""
https://abc078.contest.atcoder.jp/tasks/abc078_b
"""

[x,y,z]=[int(i) for i in input().split()]
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
A,B,C=map(int,input().split())

A-=C

print(A//(B+C))

Solution (Python):
import math

X,Y,Z=map(int,input().split())

if X<Z:
    print(0)
else:
    print(math.floor((X-Z)/(Y+Z)))

Solution (Python):


X,Y,Z=map(int,input().split())

X-=Z
count=0
while X>=Z+Y:
    X-=Z+Y
    count+=1

print(count)

Solution (Python):
X, Y, Z = map(int, input().split())

n = X // (Y + Z) - 1
while X >= Y * (n + 1) + Z * (n + 2):
    n += 1
print(n)

Solution (Python):


X, Y, Z = map(int, input().split())

for i in range(1, 1000001):
    if (Y + Z) * i + Z > X:
        
        print(i - 1)
        exit()

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z)//(Y + Z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,raw_input().split())
print (x-z)/(y+z)

Solution (Python):
X, Y, Z =map(int,input().split())
chair=0
chair+=Z
count=0
while chair<X:
    chair+=Y+Z
    count+=1
if chair>X:
    print (count-1)
else:
    print (count)

Solution (Python):
X,Y,Z=map(int,input().split())
n=(X-Z)//(Y+Z)
print(n)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):

X, Y, Z = map(int,input().split())

X_ = X - Z

print(X_//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())

for i in range(10**5):
    if X - Y*i - Z*i < Y + 2*Z :
        res += 1
        break
    res = i

print(res)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
x, y ,z = [int(i) for i in input().split()]

print(int((x-z)/(y+z)))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):


x, y, z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
x,y,z = map(int,input().split())
print(int((x - z) / (y + z)))

Solution (Python):
X,Y,Z = map(int,input().split())

print(int((X-Z)/(Y+Z)))

Solution (Python):
x, y, z = map(int,input().split())

i = 0
a = a = y * i + z * (i + 1)

while x >= a :
    i += 1
    a = y * i + z * (i + 1)
print('{}'.format(i-1))

Solution (Python):

X, Y, Z = map(int, input().split())

X = X - Z

ans = X // (Y + Z)

print(ans)

Solution (Python):
a=list(map(int, input().split()))

b = (a[0]-a[2]) // (a[1]+a[2])
print(b)

Solution (Python):
a=list(map(int, input().split()))

b = (a[0]-a[2]) // (a[1]+a[2])
print(b)

Solution (Python):
a=list(map(int, input().split()))

b = (a[0]-a[2]) // (a[1]+a[2])
print(b)

Solution (Python):



C = input().split()
X = int(C[0])
Y = int(C[1])
Z = int(C[2])


N = int((X-Z) / (Y+Z))
print(N)

Solution (Python):
x,y,z = input().split()
X = int(x)
Y = int(y)
Z = int(z)

num = int(X/(Y+Z))
if(num*(Y+Z)+Z <=X):
	print(num)
else:
	print(num-1)

Solution (Python):
X, Y, Z = map(int, input().split())

print((X-Z)//(Y+Z))

Solution (Python):
X,Y,Z = (int(i) for i in input().split())

print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int, input().split())
i,c=z,0
while(i<x):
    c+=1
    i+=y+z
if i==x:
    print(c)
else:
    print(c-1)

Solution (Python):
X, Y, Z = map(int, input().split())

print((X - Z) // (Y + Z))

Solution (Python):
X,Y,Z = map(int, input().split())
N = (X-Z) // (Y+Z) 
print(str(N))

Solution (Python):


X, Y, Z = map(int, input().split())

ans = (X-Z) // (Y+Z)

print(ans)

Solution (Python):
X, Y, Z = map(int, input().split())

X -= Z
print(X // (Y + Z))

Solution (Python):
x, y, z = map(int, input().split())
a = x // (y + z)
b = x % (y + z)
if b >= z:
    print(a)
else:
    print(a - 1)

Solution (Python):
x, y, z = map(int, input().split(' '))

if x % (y+z) >= z:
  print(int(x / (y + z)))
else:
  print(int(x / (y + z)) - 1)

Solution (Python):
space,seat,sp = map(int,input().split())
print((space-sp)//(seat+sp))

Solution (Python):
x, y, z = map(int, input().split())
x -= z
print(x // (y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
x -= z
y += z
print(x//y)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
import math
X, Y, Z = map(int, input().split(' '))
print(math.floor((X-Z)/(Y+Z)))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, raw_input().split())
print (X-Z) / (Y+Z)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())

if x % (y+z) >= z:
    print(x//(y+z))
else:
    print(x//(y+z)-1)

Solution (Python):
X, Y, Z = map(int, input().split())
count = 0
X -= Z
while True:
    X -= Y 
    X -= Z
    if X < 0:
        break
    count += 1
print(count)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
X,Y,Z=map(int,input().split())

ans=int(X/(Y+Z))
if X%(Y+Z)<Z:
    print(ans-1)
else:
    print(ans)

Solution (Python):
x,y,z=map(int,raw_input().split())

x=x-z
y=y+z

print x/y

Solution (Python):

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

nu=(x[0]-x[2]) % (x[1]+x[2])
res=(x[0]-x[2]-nu) / (x[1]+x[2])
print(int(res))

Solution (Python):
X, Y, Z = map(int,input().split())
print([X//(Y+Z)-1,X//(Y+Z)][X%(Y+Z)-Z>=0])

Solution (Python):
X,Y,Z = map(int,input().split())

p = 0
cap = Z
while(True):
    if cap>X:
        break
    elif cap+Y+Z>X:
        break
    else:
        cap += Y+Z
        p += 1
        
print(p)

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())
X -= (Y+Z)
ans = 1

while X >= Y+Z:
    X -= (Y+Z)
    ans += 1
if X < Z:
    ans -= 1
print(ans)

Solution (Python):
X, Y, Z  = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z  = map(int, input().split())
ans = X//(Y+Z)
if X - ans*(Y+Z) < Z:
    print(ans-1)
else:
    print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z=list(map(int,input().split()))

print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x,y,z = map(int,list(input().split(" ")))
print((x-z)//(y+z))

Solution (Python):
l=raw_input().split()
print((int(l[0])-int(l[2]))/(int(l[1])+int(l[2])))

Solution (Python):
l = raw_input().split()
print((int(l[0])-int(l[2]))/(int(l[1])+int(l[2])))

Solution (Python):



 
import math
import re
import sys
 
args = input().split()

X = args[0]
Y = args[1]
Z = args[2]
 

a = (int(X)-int(Z))/(int(Y)+int(Z))
 
print(int(a))

Solution (Python):
x,y,z=map(int,input().split());print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=list(map(int,input().split()))
print((x-z)//(y+z))

Solution (Python):
x, y, z = list(map(int, input().split()))
x -= z
print(x // (y + z))

Solution (Python):
x, y, z = map(int, input().split())
a = (x-z) // (y+z)
print(a)

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()


x = int(arr_data[0][0])
y = int(arr_data[0][1])
z = int(arr_data[0][2])



hasi = y + z

naka = y + z 


cnt = 0






if x >= hasi * 2:
    
    cnt += 2
    
    x -= hasi * 2
    
elif x >= hasi:
    
    cnt += 1
    
    x -= hasi



x-=z

cnt += x // naka

print(cnt)

Solution (Python):
X, Y, Z = map(int, input().split())

ans = (X - Z) // (Y + Z)

print(ans)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

x,y,z = na()
x = x - z
print(x // (y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
ans = 1
length = Y+2*Z
while True:
    if length+Y+Z > X:
        print(ans)
        break
    ans += 1
    length += Y+Z

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = (int(i) for i in input().split())
X,Y = x-z, y+z
print((X-X%Y)//Y)

Solution (Python):
x,y,z = list(map(int,input().split()))
x-=z
ans = x//(y+z)
print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

print(int((X - Z) / (Y + Z)))

Solution (Python):
X, Y, Z =  list(map(int, input().split()))
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())

print((X-Z) // (Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
ans = (x-z)//(y+z)
print(ans)

Solution (Python):
x,y,z = map(int,input().split())
print(int((x-z)/(y+z)))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):





if __name__ == '__main__':
    total_width, width_per_person, span = list(map(int, input().split()))

    result = (total_width - span) // (width_per_person + span)
    print(result)

Solution (Python):
X,Y,Z = map(int,input().split(" "))
print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = list(map(int, input().split()))

x -= z
print(x//(y+z))

Solution (Python):
X,Y,Z=map(int,input().split())
if X%(Y+Z)>=Z:
  print(X//(Y+Z))
else:
  print(X//(Y+Z)-1)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)


def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))


def to_bin(x):
    return bin(x)[2:]


def dim2input(N):
    li = []
    for _ in range(N):
        li.append(list(map(int, input())))
    return li



dp = None

def main():
    X, Y, Z = list(map(int, input().split()))
    X -= Z

    ans = 0
    while True:
        if X >= Y + Z:
            ans += 1
            X -= Y + Z
        else:
            break

    print(ans)

main()

Solution (Python):
X,Y,Z=map(int, input().split())

MAX=int(X/(Y+Z))

if MAX*(Y+Z)+Z > X:
    print(MAX-1)
else:
    print(MAX)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
x,y,z=map(int,input().split())
i,sum=0,0
while True:
    sum+=y+z
    i+=1
    if sum>x-z:
        print(i-1)
        break

Solution (Python):
import math

list = raw_input().split()

X = int(list[0])
Y = int(list[1])
Z = int(list[2])

print(int(math.floor((X-Z) / (Y+Z))))

Solution (Python):
x,y,z = map(int,input().split())
X=x-z
num = 0
while X>=(y+z):
    X=X-(y+z)
    num=num+1
print(num)

Solution (Python):
x,y,z=map(int,input().split())
x-=z
count = x//(y+z)
print(count)

Solution (Python):

x,y,z = map(int,input().split())
ans = int(x/(y+z))
if (y+z) * ans + z > x:
    ans += -1
print(ans)

Solution (Python):
x, y, z = map(int, input().split())
a = x % (y + z)
b = x // (y + z)
if (a >= z):
    print(b)
else:
    print(b - 1)

Solution (Python):
X, Y, Z = map(int, input().split())
X -= Z
print(X // (Y + Z))

Solution (Python):
X, Y, Z = list(map(int, input().split()))

A = 1
while A*(Y + Z) + Z <= X:
    A = A + 1

print(A-1)

Solution (Python):
import math

a, b, c=map(int, input().split(" "))

i = math.floor(a / b)

while a / (b * i + c * (i + 1)) < 1:
  i -= 1

print(i)

Solution (Python):
x,y,z=map(int,input().split(' '))
n = int(((x-z)/(y+z))//1)
print(n)

Solution (Python):
x,y,z=map(int,input().split(' '))
n = int(((x-z)/(y+z))//1)
print(n)

Solution (Python):
a,b,c=map(int,input().split())
d=a-c
print(int(d/(b+c)))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = map(int, input().split())

for i in range(1,x+1):
   tmp = x - z*(i+1) - y*i
   if tmp < 0 :
      print(i-1)
      break

Solution (Python):





def main():
    X, Y, Z = map(int, input().split())

    ans = (X-Z) // (Y+Z)
    print(ans)

if __name__ == "__main__": main()

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z) // (Y+Z))

Solution (Python):
x, y, z = list(map(int, input().split()))

print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
x -= z
print(x // (y + z))

Solution (Python):
import math
X_Y_Z = list(map(int, input().split()))

print(math.floor((X_Y_Z[0] - X_Y_Z[2])/(X_Y_Z[1]+X_Y_Z[2])))

Solution (Python):
x,y,z=[int(x) for x in input().split()]
print((x-z)//(y+z))

Solution (Python):
x, y, z = (int(i) for i in input().split())

print((x-z)//(y+z))

Solution (Python):
X, Y, Z = list(map(int, input().split()))
X -= Z
print(X // (Y+Z))

Solution (Python):
X,Y,Z=map(int, input().split())

print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):

X,Y,Z = map(int, input().split())
X = X - Z
N = X // (Y + Z)
print(N)

Solution (Python):
X, Y, Z = map(int, raw_input().split())
k = 0
while k * Y + (k+1) * Z <= X:
    k += 1
print k-1

Solution (Python):
x,y,z=map(int,input().split())
total=x-z
one_pair=y+z
k=1
while one_pair*k<total:
    k+=1
if one_pair*k%total==0:
    print(k)
else:
    print(k-1)

Solution (Python):
x,y,z=map(int, input().split())

x=x-z
c=0
while(x>=y+z):
    x=x-y-z
    c+=1

print(c)

Solution (Python):
a,b,c=[int(i) for i in input().split(' ')]
print((a-c)//(b+c))

Solution (Python):
list1 = [int(i) for i in input().split()]

print(int((list1[0]-list1[2])/(list1[2]+list1[1])))

Solution (Python):

import math

X, Y, Z = map(int, input().split())
NUM = math.floor((X - Z) / (Y + Z))

print(NUM)

Solution (Python):
x, y, z = map(int, raw_input().split())
print (x - z) / (y + z)

Solution (Python):
x, y, z = map(int, input().split())

ans = 0
while ans * (y + z) + z <= x:
    ans += 1
print(ans - 1)

Solution (Python):
x, y, z = list(map(int, input().split()))

print((x-z) // (y+z))

Solution (Python):
x,y,z=[int(i) for i in input().split()]
x-=z*2
ans=0
while y+z<=x:
        x-=(y+z)
        ans+=1
        
if y<=x:
        ans+=1
        
print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
N = (X - Z) // (Y + Z)
print(N)

Solution (Python):
x,y,z = map(int, input().split())
x -= z
print(x//(y+z))

Solution (Python):



x, y, z = map(int, input().split())


result = (x-z) // (y+z)


print(result)

Solution (Python):
X, Y, Z = map(int, input().split())
print(int((X-Z)/(Y+Z)))

Solution (Python):
X, Y, Z = map(int, input().split())

n = 1
l = Y + 2 * Z

while X >= l:
    l += Y + Z
    n += 1

print(n-1)

Solution (Python):
x,y,z = input().split()
x = int(x)
y = int(y)
z = int(z)
x -= z
y += z
current = 0
c = 0

while current <= x:
    current += y
    c += 1

print(c-1)

Solution (Python):
X, Y, Z = list(map(int,input().split()))

ans=(X-Z)//(Y+Z)
print(ans)

Solution (Python):
a=list(map(int,input().split()))
a[0]=a[0]-a[2]

print(int(a[0]/(a[1]+a[2])))

Solution (Python):
x, y, z = map(int, input().split())
x -= 2 * z
x -= y
if x < 0:
    print(0)
else:
    print(1 + x // (y + z))

Solution (Python):
X, Y, Z = map(int,input().split())
a = X - Z
b = Y + Z
print(a//b)

Solution (Python):
x, y, z = map(int, raw_input().split())
print (x - z) / (y + z)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
X, Y, Z = map(int, input().split())
ans = 1
while ans * (Y + Z) + Z <= X:
	ans += 1
print(ans - 1)

Solution (Python):


from queue import Queue
import sys
import subprocess
import json
import time
import math
import re

import random
import numpy as np

from statistics import mean, median, variance, stdev



def ans():
    remain = X - Y - 2 * Z
    if (remain < 0): return 0
    return 1 + remain // (Y + Z)
    

X, Y, Z = map(int, input().split())
print(ans())

Solution (Python):


from queue import Queue
import sys
import subprocess
import json
import time
import math
import re

import random
import numpy as np

from statistics import mean, median, variance, stdev



def ans():
    remain = X - Y - 2 * Z
    if (remain < 0): return 0
    res = 1
    while (remain >= Y + Z):
        remain -= Y + Z
        res += 1
    return res
    

X, Y, Z = map(int, input().split())
print(ans())

Solution (Python):
length,man,space = map(int,raw_input().split())
num = (length-space)/(man+space)
print num

Solution (Python):
x,y,z=map(int,input().split())

n=0
while(1):
    if(n*y+(n+1)*z>x):
        break
    n+=1

print(n-1)

Solution (Python):
def getNum():
    x,y,z = map(int,input().split())
    return x,y,z

def cal(x,y,z):
    num = int((x-z) / (y+z))
    print(num)

def main():
    x,y,z = getNum()
    cal(x,y,z)

main()

Solution (Python):
x, y, z = map(int, input().split())
print(((x-z)//(y+z)))

Solution (Python):
X, Y, Z = map(int, input().split())
X -= Z
print(int(X/(Y+Z)))

Solution (Python):

X,Y,Z = map(int,raw_input().split())
X = X - Z
print((X/(Y+Z)))

Solution (Python):
print (lambda x,y,z:(x-z)/(y+z))(*map(int, raw_input().split()))

Solution (Python):
X,Y,Z = map(int,input().split())
ans = (X-Z)//(Y+Z)
print(ans)

Solution (Python):
X,Y,Z = map(int,input().split(" "))
ans = (X-Z)//(Y+Z)
print(ans)

Solution (Python):
X,Y,Z = map(int,input().split())
count = 0
before = 0
I = Z
while (True):
	I += Y + Z
	
	if I > X:
		break
	
	count += 1
	
print(count)

Solution (Python):
a,b,c=map(int,input().split())
X=a-c
Y=b+c
print(X//Y)

Solution (Python):
x,y,z = map(int, raw_input().split())
print (x-z)/(y+z)

Solution (Python):
s = input()
x, y, z = [int(i) for i in s.split()]
print(int((x-z)/(y+z)))

Solution (Python):
X, Y, Z = map(int, input().split())
width = Y+Z
N = (X-Z)//width
print(N)

Solution (Python):
import math

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

x = il[0]
y = il[1]
z = il[2]

tmp = (x - z) / (y + z)

ans = math.floor(tmp)
print(ans)

Solution (Python):
import sys
import math
 

a, b, c = map(int, input().split())

if a < (b + 2*c):
    print("a >= b + 2*cとなるようにしてください")
    sys.exit()
elif a == (b + 2*c):
    print("1")
else:
    max = math.floor((a - c) / (b + c))
    print(max)

Solution (Python):
import sys;
lines = sys.stdin.readlines();


stdIn = {};

for i, line in enumerate(lines):
    
    chairSize,humanSize,spaceSize = map(int, line.split());

total = 0;
maxSize = 0;
while total*(humanSize)+(total-1)*(spaceSize)+spaceSize*2 <= chairSize:
    total = total+1;
print (total-1);

Solution (Python):

x,y,z=map(int,input().split())

x=x-z
a=y+z
b=x/a

print(str(int(b)))

Solution (Python):
a = input().split()
b = int(a[0])
c = int(a[1])
d = int(a[2])
b = b-d
F = int(b/(c+d))
print(F)

Solution (Python):
x, y, z = map(int, input().split())
print(int((x - z) / (y + z)))

Solution (Python):

"""
https://beta.atcoder.jp/contests/abc078/tasks/abc078_b

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    X, Y, Z = map(int, input().split())
    ans = (X - Z) // (Y + Z)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):

line = input().rstrip().split()

x = int(line[0])
y = int(line[1])
z = int(line[2])

print((x-z)//(y+z))

Solution (Python):
meter, body, width = map(int, input().split())

num = (meter - width ) // (body + width)

print(num)

Solution (Python):
X, Y, Z = map(int, input().split())
print (int((X-Z) / (Y+Z)))

Solution (Python):
t=input().split(" ")
X=int(t[0])
Y = int(t[1])
Z = int(t[2])
print((X-Z)//(Y+Z))

Solution (Python):
(x, y, z) = [int(i) for i in input().split()]
print((x - z) // (y + z))

Solution (Python):
def solve():
    x, y, z = list(map(int, input().split(" ")))

    if (x % (y + z) == 0):
        ans = x // (y + z) - 1
    else:
        if (x % (y + z)) >= z:
            ans = x // (y + z)
        else:
            ans = x // (y + z) - 1

    print(ans)
    

solve()

Solution (Python):



def main():
	X,Y,Z = input().split(' ')
	X,Y,Z = int(X),int(Y),int(Z)
	output = int((X - Z) / (Y + Z))
	print(output)
if __name__ == "__main__":
	main()

Solution (Python):
x, y, z = [int(i) for i in input().split()]
t = 0
for i in range(1, 114514):
    l = y * i + 2*z + z * (i-1)
    if l <= x:
        t = i
    else:
        break
print(t)

Solution (Python):

X, Y, Z = map(int, input().split())

ans = 0
X -= Z
while X >= Y + Z:
    X -= Y + Z
    ans += 1

print(ans)

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
xyz = list(map(int,input().split()))
x = 0
for i in range(100000):
    x += 1
    if xyz[0] < (x*(xyz[1]+xyz[2])+xyz[2]):
        x -= 1
        break
print(x)

Solution (Python):

x,y,z = map(int, input().split())
ans = 0
while (y+z)*ans+z <= x:
    ans += 1
print(ans-1)

Solution (Python):
X,Y,Z=map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
print((x - z)//(y + z))

Solution (Python):


def main():
    X, Y, Z = map(int, input().split(" "))

    
    
    
    
    
    
    

    print(int((X - Z) / (Y + Z)))

if __name__ == '__main__':
    main()

Solution (Python):


def main():
    X, Y, Z = map(int, input().split(" "))

    max_num = 0
    for i in range(100000):
        if Y * i + Z * (i + 1) <= X:
            max_num = i
        else:
            break
    print(max_num)

if __name__ == '__main__':
    main()

Solution (Python):
X, Y, Z = map(int, input().split())

for n in range(100000):
    if n * ( Y + Z )+ Z > X:
        print(n-1)
        break
        
    else:
        pass

Solution (Python):
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
INF = float("inf")
sys.setrecursionlimit(10**7)


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


def main():
    X, Y, Z = map(int, input().split())
    X -= Z
    print(max(0, X // (Z + Y)))


if __name__ == '__main__':
    main()

Solution (Python):

x,y,z=map(int,raw_input().split())

res=(x-z)/(y+z)
print res

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z) // (Y+Z))

Solution (Python):
def main():
    X, Y, Z = map(int, input().split())
    
    print((X - Z) // (Y + Z))

if __name__ == '__main__':
    main()

Solution (Python):
print((lambda a:(a[0]-a[2])//(a[1]+a[2]))(list(map(int,input().split()))))

Solution (Python):
def main():
    X, Y, Z = map(int, input().split())
    X -= Z
    print(X // (Y + Z))


if __name__ == "__main__":
    main()

Solution (Python):
x,y,z = input().split()

print( ( int(x) - int(z) ) // ( int(y) + int(z) ) )

Solution (Python):
x,y,z = map(int,input().split())
hi = 100000
lo = 0
mid = (hi+lo)//2
while hi-lo > 1:
    mid = (hi+lo)//2
    if mid*y + (mid+1)*z <= x:
        lo = mid
    else:
        hi = mid
print(lo)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    x,y,z = LI()
    x -= z*2
    r = x // (z+y)
    x %= z+y
    if x >= y:
        r += 1
    return r


print(main())

Solution (Python):
def solve():
    X, Y, Z = list(map(int, input().split()))
    rest_width = X
    rest_width -= Z
    print(rest_width//(Y+Z))

solve()

Solution (Python):
x,y,z=[int(i) for i in input().split()]
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

print(int((X - Z) / (Y + Z)))

Solution (Python):
x,y,z=map(int,input().split())
ans=(x-z)//(y+z)
print(ans)

Solution (Python):
x, y, z = list(map(int, input().split()))
x -= z
print(x // (y + z))

Solution (Python):
x,y,z = map(int,raw_input().split())
x -= z
print x/(y+z)

Solution (Python):
x, y, z = [int(x) for x in raw_input().split()]
print (x - z) / (y + z)

Solution (Python):
x, y, z = map(int, input().split())

print((x - z) // (y + z))

Solution (Python):
x,y,z = list(map(int,input().split()))
counter = 0
while True:
    x -= (y+z)
    if x  - z< 0:
        break
    else:
        counter += 1
print(counter)

Solution (Python):
x, y, z = map(int,input().split())
print(int((x - z) / (y + z)))

Solution (Python):
nb = input().split(' ')

x, y, z = int(nb[0]), int(nb[1]), int(nb[2])

print(int((x-z)/(y+z)))

Solution (Python):
N =input().split()
total =(int(N[0])-int(N[2]))/(int(N[1])+int(N[2]))

print(int(total))

Solution (Python):
def isu(x, y, z):
    n = int(x / (y + z))
    if x - n * (y + z) - z < 0:
        return int(n - 1)
    return int(n)

x, y, z = map(int, input().strip().split())
print(isu(x, y, z))

Solution (Python):
x, y, z = map(int,input().split())
x = x - z
print(int(x / (y + z)))

Solution (Python):
x,y,z = map(int,input().split())
count = 0
x=x-z
while(True):
    x = x - y
    x = x - z
    if x >= 0:
        count += 1
    else:
        break
print(count)

Solution (Python):
[x,y,z] = list(map(int,input().split()))
print((x-z)//(y+z))

Solution (Python):
data = list(map(int, input().split()))
x = data[0]
y = data[1]
z = data[2]
people = int((x - z) / (y + z))
print(people)

Solution (Python):



X, Y, Z = map(int, raw_input().split())

ans = (X - Z) / (Z + Y)
print ans

Solution (Python):
X,Y,Z=(int(i) for i in input().split())
X-=Z
Y+=Z
X//=Y
print(X)

Solution (Python):

import math

line_list = input().split(" ")

x = int(line_list[0])
y = int(line_list[1])
z = int(line_list[2])

print(int(math.floor((x-z)/(y+z))))

Solution (Python):
a,b,c=map(int,input().split())
a-=c
a//=(b+c)
print(a)

Solution (Python):
x,y,z = map(int,input().split())
aa = x
b1 = 0
b2 = 0
for a in range(aa):
  x -= z
  if x < y:
    break
  x -= y
  if x < z:
    break
  b2 += 1
if b1 <= b2:
  print(b2)
else:
  print(b1)

Solution (Python):
x, y, z = map(int, raw_input().split())
print (x - z) // (y + z)

Solution (Python):
import sys

X, Y, Z = map(int, input().split())


for n in range(X):
    if Y + 2*Z + (n - 1) * (Y + Z) > X:
        break;

print (n - 1)