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



Sample input:
13 3 1


Sample output:
3

Submission status: Accepted

Solution code:
X, Y, Z = map(int,str(input()).split())
count = 0
while X - Z >= Y + Z :
    X = X - Y - Z
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

if x < y+2*z:
    print(0)
    exit()

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    s = LS()
    t = sorted(s)
    if s[0] == s[1]:
        print("=")
    elif s[0] == t[0]:
        print("<")
    else:
        print(">")

#B
def B():
    x,y,z = LI()
    k = 0
    for i in range(1000000000):
        k += y+z
        if k+z>x:
            print(i)
            quit()

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
ans = 0
X -= Z
while X >= Z + Y:
    X -= Z + Y
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return list(sys.stdin.readline())
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
mod = 1000000007

#A
"""
x, y = LS()
if x > y:
    print(">")
elif x == y:
    print("=")
else:
    print("<")
"""

#B
x, y, z = LI()
print((x-z)//(y+z))

Submission status: Accepted

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

Submission status: Accepted

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

total = 0
count = 0

while total <= x-z:
    total += z + y
    count += 1

print(count-1)

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
ans = 0
length = z
for i in range(x):
    length += y+z
    if length <= x:
        ans += 1
    else:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

L, W, Z = map(int, input().split())

n = (L-Z)//(W+Z)
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
n=1
while 1:
    if y*n+z*(n+1) >x:
        print(n-1)
        break
    n+=1

Submission status: Accepted

Solution code:

INF=1e18
MOD=1e9+7

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
X, Y, Z = map(int, input().split())
X -= Z
print(X // (Y + Z))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1
width = Z + Y + Z
while width + Y + Z <= X :
    width += Y + Z
    ans += 1

print( ans )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y,Z = map(int,input().split())
ans, r = divmod(X,(Y+Z))
if r < Z: ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
ans = 0

for i in range(1,x):
    if (y*i)+(z*(i+1)) > x:
        print(i-1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
operator = True
count = 0

while operator:
    if (y+z)*count+z > x:
        operator = False
        break
    else:
        count += 1

print(count - 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" AtCoder """

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

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


print(ans)

Submission status: Accepted

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

cnt=0
tmp=0
while(1):
    tmp+=y+z
    if tmp>x-z:
        break
    cnt+=1

print(cnt)

Submission status: Accepted

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

X -= Z

print(X // (Y + Z))

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())

def swap(s,pos):
    s[pos]-=1
    s[pos+1]+=1
    print(s)
    if pos == n-2: return s
    if s[pos+2] == 0: swap(s,pos+1)
    return s


#n = ip()                              #入力整数1つ
#left,n= (int(i) for i in input().split())      #入力整数横2つ
n,x,y = (int(i) for i in input().split())    #入力整数横3つ
#n,m,x,y= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)



#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
n-=y
print(n//(x+y))

Submission status: Accepted

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

for i in range(1, 100000):
    if X < i * Y + (i - 1) * Z + 2 * Z:
        break

print(i - 1)

Submission status: Accepted

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

num = 0

for i in range(1, 100000):
    if X < i * Y + (i - 1) * Z + 2 * Z:
        break
    num = i

print(num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
for i in range(x//y,0,-1):
    if i*y+(i+1)*z<=x:
        print(i)
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if x%(a+b) < b:
  print(x//(a+b)-1)
  exit()
print(x//(a+b))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input().split();x,y,z=int(s[0]),int(s[1]),int(s[2])
if x//(y+z)*y+x//(y+z)*z+z<=x:
    print(x//(y+z))
else:
    print(x//(y+z)-1)

Submission status: Accepted

Solution code:
int_x, int_y, int_z = map(int, input().split())

print(int((int_x - int_z) / (int_y + int_z)))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
ans=1
while True:
  if ans*(y+z)+z>x:
    print(ans-1)
    exit()
  ans+=1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x, y, z = map(int, input().split())

    p = 0
    length = 0
    while length <= x:
        p += 1
        length = y * p + z * (p + 1)

    print(p - 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 078
def getIntList(): return [int(x) for x in input().split()]
X,Y,Z = getIntList()
n = (X-Z)//(Y+Z)
print(n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
X,Y,Z=map(int,input().split())
haba=X-Z
mix=Y+Z

print(int((haba)/mix))

Submission status: Accepted

Solution code:
from itertools import permutations

def inpl(): return list(map(int, input().split()))

x, y, z = inpl()
print(x//(y+z) - int(x%(y+z)<z))

Submission status: Accepted

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

Submission status: Accepted

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

ans=0
for i in range(100000):
  if z+i*y+i*z <= x:
    ans=i
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
x,y,z = (int(i) for i in input().split()) 
ans = math.floor((x-z)/(y+z))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split(" "))
if x % (y + z) == z:
    print(int(x / (y + z)))
else:
    print(int(x / (y + z))-1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
count = 0
distance = 0
while distance <= X-Y-2*Z:
    distance += Y+Z
    count += 1
print(count)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
# coding: utf-8
X, Y, Z = map(int, input().split())
print((X-Z) // (Y+Z))

Submission status: Accepted

Solution code:
x,y,z= map(int,input().split())
res = z
cnt = 0
while res<=x:
    res += y+z
    cnt += 1
print(cnt-1)

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
for n in range(10 ** 5, 0, -1):
    if X >= n * (Y + Z) + Z:
        break
print(n)

Submission status: Accepted

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


abc078_b()

Submission status: Accepted

Solution code:
def abc078_b():
    x, y, z = map(int, input().split())
    n = x // (y + z)
    if n * (y + z) + z <= x:
        print(n)
    else:
        print(n - 1)


abc078_b()

Submission status: Accepted

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

rest = X - (Y + 2 * Z)
print(1 + rest // (Y + Z))

Submission status: Accepted

Solution code:
#B ISU
x,y,z = map(float,input().split())
x = x- z
d = y+z
k = 0
while x >= d:
    k =k+1
    x = x- d
    
print(k)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    x, y, z = map(int, input().split())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

# z + y + z + y + ...+z = (z + y) * k + z <= x
# k <= (x - z)/(z + y)
print(int((x - z)/(z + y)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X,Y,Z = map(int,input().split())
a = []
X = X-Z
while X >= Z+Y:
  a.append(1)
  X = X - (Z+Y)
print(sum(a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y,Z=map(int,input().strip().split(" "))
X-=Z

A=X/(Y+Z)

print(int(A))

Submission status: Accepted

Solution code:
X,Y,Z = list(map(int,input().split(" ")))
c = 0
for i in range(1,X):
    r = (Y * i) +(Z * (i+1))
    if r  > X:
        print(i-1)
        break

Submission status: Accepted

Solution code:
x,y,z = map(int, input().split())
width = x-z
ans = 0
while width >= 0:
    width -= y+z
    ans += 1
print(ans-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int, input().split())
a = z
i = 0
while a < x:
    a += y+z
    i += 1
if a > x:
    i -= 1
print(i)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
total = 0
ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y, Z = [int(_) for _ in input().split()]
print((X-Z)//(Y+Z))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = x - z
sum = 0
cnt = 0
while sum <= x:
    sum += y + z
    cnt += 1
print(cnt - 1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
i = 0
base=z
while base + y + z <= x:
    base += y + z
    i += 1
print(i)

Submission status: Accepted

Solution code:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
i = 0
while x - (y + z) * i > 0:
    i += 1

t = x - (y + z) * (i - 1)
if t >= z:
    print(i - 1)
else:
    print(i - 2)

Submission status: Accepted

Solution code:
X, Y, Z = map(int, input().split())
ans = 0
X -= 2 * Z
for i in range(100001):
    if X >= Y:
        ans += 1
        X -= Y + Z
    else:
        break
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y, z = map(int,input().split())
a = x / (y + z)
b = x % (y + z)

print(int(a) if b >= z else int(a) - 1)

Submission status: Accepted

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

l = x - z

print(l // (y + z))

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
d = a - c

print(int(d /(b + c)))

Submission status: Accepted

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

print(1 + (x - y - 2*z) // (y + z))

Submission status: Accepted

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

N, mod = divmod(X, Y+Z)
if mod < Z:
    N -= 1
print(N)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
X = X-Z
while(X > 0):
    X = X-Y-Z
    if X >= 0:
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
x,y,z = map(int, input().split())
print((x-z)//(y+z))

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> None:
    x, y, z = [int(next_str()) for _ in range(3)]

    for i in range(1, 10 ** 9):
        if x < z + (i + 1) * (y + z):
            print(i)
            break


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> None:
    x, y, z = [int(next_str()) for _ in range(3)]

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


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y, z = map(int,input().split())
n = y + 2 * z
ans = 0
for i in range(0,100000):
    n += y + z
    ans += 1
    if n > x:
        print(ans)
        break

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
n=0
while x>=n*y+(n+1)*z:
    n+=1
print(n-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())
space = 2 * z + y
man = 1
while x >= space:
  space += y + z
  man += 1
print(man-1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,Y,Z = map(int,input().split())
answer = 0
X -= Y+2*Z
answer += 1
answer += X//(Y+Z)
print(answer)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

x,y,z = li()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y,Z = map(int,input().split())
#人がn人座る時必要な長さ(n+1)Z+nY<=X
# (Z+Y)n<=X-Z
# n<=(X-Z)/(Z+Y)
print(int((X-Z)/(Z+Y)))

Submission status: Accepted

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

i = 0
now = 0

if x < y:
    print("0")
    exit(0)

while True:
    i += 1

    now = y * i + z * (i + 1)
    if now > x:
        print(i - 1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
i = 0
while x - y*i - z*(i+1) >= 0:
    i += 1
print(i-1)

Submission status: Accepted

Solution code:
X,Y,Z=map(int,input().split())
print((X-2*Z)//(Y+Z)+((X-2*Z)%(Y+Z))//Y)

Submission status: Accepted

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

if X < Y + 2 * Z:
    print(0)
else:
    x = X - (Y + 2 * Z)
    ans = int(x / (Y + Z)) + 1

print(ans)

Submission status: Accepted

Solution code:
X,Y,Z = map(int,input().split())
X -= Y+2*Z
answer = 1
while X >= Y+Z :
    X -= Y+Z
    answer += 1
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,Y,Z = map(int,input().split())
flag = False
for N in range(X):
  if ((Y+Z)*N+Z <= X < (Y+Z)*(N+1)+Z):
    flag = True
    break
print(N)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,Y,Z=map(int,input().split())
ans=0
K=Z
while(True):
    if K+Y+Z>X:
        break
    K+=Y+Z
    ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
j=1
while 1:
    if x < y*j+z*(j+1):
        print(j-1)
        break
    j+=1

Submission status: Accepted

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

res = 0

if x < y:
    print(res)
    exit()

while(True):
    res += 1
    if x < res*y + res*z +z:
        print(res-1)
        break

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    X, Y, Z = map(int, input().split())
    ans = 0
    ans += X // (Y + Z)
    if X % (Y + Z) < Z:
        ans -= 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(x-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#78b
x,y,z=map(int,input().split())
ans = (x-z)//(y+z)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = x-z

print(x//(y+z))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# utf-8:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
https://abc078.contest.atcoder.jp/tasks/abc078_b
"""

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

Submission status: Accepted

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

A-=C

print(A//(B+C))

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
X,Y,Z=map(int,input().split())

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

for i in range(1, 1000001):
    if (Y + Z) * i + Z > X:
        # 座り切れなくなった所で、ひとつ前の値を出力
        print(i - 1)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

X_ = X - Z

print(X_//(Y+Z))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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