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):
v = input().split(' ')
X = int(v[0])
Y = int(v[1])
Z = int(v[2])
i=0

if X<Y:
    print(i)

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

Solution (Python):

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

Solution (Python):
x, y, z = map(int, input().split())
count = z
p = 0
ite = 1
while count < x:
    if ite % 2 == 0:
        if count + y > x:
            break
        else:
            count += y
            p += 1
            ite += 1
    elif ite % 2 != 0:
        if count + z > x:
            break
        else:
            count += z
            ite += 1

print(p)

Solution (Python):
input_lines = input().split(" ")
X = int(input_lines[0])
Y = int(input_lines[1])
Z = int(input_lines[2])

judge = X//(Y+Z)

if judge*(Y+Z)+Z>X:
    print(str(X//(Y+Z)-1))
else:
    print(str(X//(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)//(z+y))

Solution (Python):
def B_isu(X, Y, Z):
    import math
    
    ans = math.floor((X - Z) / (Y + Z))
    return ans

X,Y,Z = [int(i) for i in input().split()]
print(B_isu(X, Y, Z))

Solution (Python):
data = input().split()
x = int(data[0])
count = 0
while 1:
    x -= int(data[1])+int(data[2])
    if x - int(data[2]) >= 0:
        count += 1
    else:
        break
print(count)

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

Solution (Python):
import sys

XYZ= list(sys.stdin.readline().rstrip().split(" "))

TOTAL_LEN  = int(XYZ[0])
ONE_OCCUPY= int (XYZ[1])
GAP= int(XYZ[2])


MIDDLE = TOTAL_LEN - 2*GAP

HOW_MANY = 0

while MIDDLE > 0:
    MIDDLE = MIDDLE - ONE_OCCUPY
    if MIDDLE == 0:
        HOW_MANY = HOW_MANY + 1
    elif MIDDLE < 0:
        break
    else:
        HOW_MANY = HOW_MANY + 1
        MIDDLE = MIDDLE - GAP



print(HOW_MANY)

Solution (Python):
list = input().split()
x,y,z = int(list[0]),int(list[1]),int(list[2])
x -= z * 2
num = x % (y+z)
if num >= y:
    print((x//(y+z))+1)
else:
    print(x//(y+z))

Solution (Python):
def isu(X, Y, Z):
	
	n_people = int((X - Z) / (Y + Z))
	print(n_people)

C = list(map(int,input().split()))
isu(C[0], C[1], C[2])

Solution (Python):
a, b, c = raw_input().split()
a = int(a)
b = int(b)
c = int(c)
n = int(round((a-c)/(c + b)))
print(n)

Solution (Python):
num = raw_input().strip().split(" ")
num = map(lambda x : int(x), num)

chair = num[0] - num[2]
cnt = 0
while True:
    if (chair - (num[1]+ num[2])) >=0:
        cnt += 1
        chair -= (num[1]+num[2])
    else:
        break
print(str(cnt))

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

Solution (Python):
from math import floor

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

if X % (Y + Z) >= Z:
    print(floor( X / (Y + Z)))
else:
    print(floor( X / (Y + Z) - 1))

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

Solution (Python):
s = input().split()
x = int(s[0])
y = int(s[1])
z = int(s[2])


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

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

print(C)

Solution (Python):
nums = [int(i) for i in input().split()]
x = nums[0]
y = nums[1]
z = nums[2]

capacity = y + 2 * z
ans = 0
while(capacity <= x):
    if capacity == x:
        ans += 1
        break
    else:
        capacity += y + z
        ans += 1
print(ans)

Solution (Python):
import math

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

def ans(num, max):
    result = math.floor(max / num)
    print("{0}".format(result))

def main():
    max_length = X - Z
    each_space = Y + Z
    ans(each_space, max_length)

main()

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())
cnt=z
hum=0
while 1:
    cnt+=y+z
    if cnt>x:
        break
    hum+=1
print(hum)

Solution (Python):




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


if __name__ == '__main__':
    main()

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

seat = x
ans = 0

seat -= z
while True:
    if seat - (y+z) >= 0:
        ans += 1
        seat -= (y+z)
    else:
        break
print(ans)

Solution (Python):
a=input().split()
X=int(a[0])
Y=int(a[1])
Z=int(a[2])
p=int( X/(Y+Z) )
q=int( X%(Y+Z) )
if( q>=Z ):
 print(p)
else:
 print(p-1)

Solution (Python):


def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

x, y, z = read_line(int, int, int)

def f(i):
    return i * y + (i + 1) * z

i = 0
while True:
    if x < f(i + 1):
        break
    i += 1

print(i)

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

ans = (A[0]-A[2])//(A[1]+A[2])
print(ans)

Solution (Python):

import math

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

num = math.floor(chair / (Y+Z))

print(num)

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

Solution (Python):



"""078-b"""

import sys
import pprint
import re

import itertools
pp = pprint.PrettyPrinter(indent=2)

def main():
    """Main function."""
    x, y, z = list(map(int, input().split(' ')))

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


if __name__ == '__main__':
    sys.exit(main())

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

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

counter = 0
sum = Z
while True:
    sum += Y+Z
    if sum > X:
        print(counter)
        break
    else:
        counter += 1

Solution (Python):


from sys import stdin

X, Y, Z = map(int, stdin.readline().split())





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

Solution (Python):
x,y,z = [int(i) for i in input().split()]
def sum(n):
    return y * n + z * (n+1)
ans = (x-z) // (y + z)
print(ans)

Solution (Python):
X, Y, Z = map(int, input().split(' '))
first = Y + 2*Z
follower = Y + Z
total = 0
if first < X:
    
    length = X - first
    num = length // follower + 1
elif first == X:
    num = 1
else:
    num = 0
print(num)

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//(y+z)
if x-n*(y+z) >= z:
    print(n)
else:
    print(n-1)

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

S = int(X / (Y + Z))
T = X % (Y + Z)

if T < Z:
    S -= 1

print(S)

Solution (Python):
def main():
    x, y, z = map(int, input().split())
    x -= 2*z

    i, cnt = 0, 0
    while (1):
        if i%2 == 0:
            x -= y
            if x < 0:
                break
            cnt += 1
        else:
            x -= z
            if x < 0:
                break
        i += 1
    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):


xyz = list(map(int, input().split()))
x = xyz[0]
y = xyz[1]
z = xyz[2]

width = z + y + z

num = 0

while(width <= x):
    width = width + y + z
    num = num + 1

print(num)

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

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
ans = X//(Y+Z)
R = X - ans * (Y + Z)
if R < Z:
    ans -= 1
print(ans)

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

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

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

Solution (Python):


X,Y,Z=list( int(i) for i in input().split() )

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

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

Solution (Python):
import numpy as np


def getInput():
    """

    :return: list of list of str. 1st dim: row, 2nd dim: column.
    """
    separator = ' '
    ret_array = []
    while True:
        try:
            row = input().split(sep=separator)
            ret_array.append(row)
        except EOFError:
            break
    return ret_array


g = getInput()


xyz = np.array(list(map(int, g[0])), dtype=np.int32)
print(np.int32(np.floor((xyz[0] - xyz[2]) / (xyz[1] + xyz[2]))))

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

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

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

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

main()

Solution (Python):
import sys

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

i=0
while(1):
	if S[1]*i+S[2]*(i+1)>S[0]:
		i-=1
		break
	i+=1
print(i)

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):



X, Y, Z = [int(i) for i in input().split()]
print((X-Z)//(Y+Z))

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

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):
from sys import stdin, stdout
from math import floor
def IL():return list(map(int, stdin.readline().split()))

def main():
    
    x,y,z = IL()
    x -= z
    print(floor(x/(y+z)))
if __name__ == "__main__": main()

Solution (Python):
import math
X,Y,Z=map(int,raw_input().split(' '))





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

Solution (Python):
import sys
line = sys.stdin.readline().strip()
x, y, z = map(int, line.split()[:3])
r = (x - z) // (y + z)
print(r)

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

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

Solution (Python):
import sys
x, y, z = list(map(int, sys.stdin.readline().strip().split(" ")))

num = 0
x -= z
while x >= (y+z):
    x -= (y+z)
    num += 1
print(str(num))

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

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

l = 0
c = 0
while True:
    l += z
    if l >= x:
        break
    else:
        l += y
        if l+z > x:
            break
        else:
            c += 1

print(c)

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

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

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

Solution (Python):


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

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

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

x = x - 2 * z
count = 0
while x >= y:
    x = x - y - z
    count += 1

print(count)

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

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

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

Solution (Python):



import copy
import math
A,B,C = input().split(" ")
A = int(A)
B = int(B)
C = int(C)

A = A - C
print(math.floor(A/(B+C)))

Solution (Python):
import sys,collections
sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

x,y,z = Is()

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

Solution (Python):
import numpy as np
import bisect

X , Y ,Z = input().split()
X = int(X)
Y = int(Y)
Z = int(Z)
x = X - Z
print(int(x / (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):
a,b,c=[int(i) for i in input().split()]
s=0
i=0
while s<=a-2*c:
    i=i+1
    s=b*i+c*(i-1)

print(i-1)

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

Solution (Python):
val = [int(x) for x in input().split()]

print((val[0]-val[2])//(val[1] + val[2]))

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

Solution (Python):
import math
xyz = input().split()
x = int(xyz[0])
y = int(xyz[1])
z = int(xyz[2])
ans = (x - z) / (y + z)
print(math.floor(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 - Z) // (Y+Z)

print(ans)

Solution (Python):



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