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: Wrong Answer

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

Submission status: Wrong Answer

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

print((X-Y-2*Z)//(Y+Z) + 1 if X-Y-2*Z > 0 else 0)

Submission status: Wrong Answer

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

ans = 0
remain = x
while True:
  if remain < y+z:
    break
  remain -= y+z
  ans +=1
if remain ==0:
  ans -= 1
print(ans)

Submission status: Wrong Answer

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

ans = 0
remain = x
while True:
  if remain < y+z:
    break
  remain -= y+z
  ans +=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = input().split()
x = int(i[0])
y = int(i[1])
z = int(i[2])
flag = True
n = 0
while(flag):
    n = n + 1
    if x<= n*y + (n+1)* z:
        flag = False
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
temp = input().split()

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

l = X
p_num = 0

while l > Y+Z:
    p_num += 1
    l -= (Y+Z)

print(p_num)

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
A=A-1
ans=A//(B+C)

print(ans)

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
per = y + z
ans = x // per
if x % per == 0 or ans + z > x:
    print(ans - 1)
else:
    print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x,y,z=map(int,input().split())
l=[]
for i in range(x):
    if (x-(z+y)*i+z)>=0:
        l.append(i)
print(max(l))

Submission status: Wrong Answer

Solution code:
x,y,z=map(int,input().split())
l=[]
for i in range(int(x/(z+y))):
    if (x-(z+y)*i+z)>=0:
        l.append(i)
print(max(l))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X, Y, Z = map(int, input().split())
def solve():
  for i in range(int(X/Y)+1):
    if(X < i*Y+(i+1)*Z):
      print(i-1)
      return

solve()

Submission status: Wrong Answer

Solution code:
X, Y, Z = map(int, input().split())
def solve():
  for i in range(int(X/Y)):
    if(X < i*Y+(i+1)*Z):
      print(i-1)
      return

solve()

Submission status: Wrong Answer

Solution code:
import sys

def main():
    input = sys.stdin.readline
    x, y, z = map(int, input().split())

    print(x // ( y + z))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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()
    ans = 0
    k = 0
    while k+y+z < x:
        k += y+z
        ans += 1
    print(ans)

#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: Wrong Answer

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

Submission status: Wrong Answer

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

total = 0
count = 0

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    print(p - 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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)==0))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X, Y, Z = map(int,input().split())
cnt = 0
x = X
for i in range(X):
  if(x > 0):
    x -= Y+Z
    cnt += 1
print(cnt-1)

Submission status: Wrong Answer

Solution code:
X, Y, Z = map(int,input().split())
cnt = 0
for i in range(X):
  if(X > 0):
    X -= Y+Z
    cnt += 1
print(cnt-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(sum(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
 
x, y, z = stdin.readline().split()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((x + 3*z) // (y+z))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print((x+z) % (y+z))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(res)

Submission status: Wrong Answer

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

for i in range(20**5):
    if X - Y*i - Z*i <= 0:
        break
    res = i

print(res)

Submission status: Wrong Answer

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

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

print(res)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8

import math
import re
import sys
 
args = sys.argv

X = 12
Y = 3
Z = 1
# 人数
a = (X-Z)/(Y+Z)

a = int(a)

Submission status: Wrong Answer

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

print((c - b * 2) // (a + b))

Submission status: Wrong Answer

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

print(c // (a + b))

Submission status: Wrong Answer

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

print((a + b) // c)

Submission status: Wrong Answer

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

print(x, y, z)

hasi = y + z

naka = y + z 

#座れる人数初期値
cnt = 0

#はしに座れる人数
#cnt+=x//(hasi)
#print(cnt)


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



x-=z
#中に座れる人数
cnt += x // naka

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y,z = list(map(int,input().split()))
ans = x//(y+z)
num = x%(y+z)
if num >= y:
    ans+=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = int(x / (y+z))
    # print(tmp)
    # print(int(tmp))
    if tmp * (y+z) >= x:
        # print("t")
        print(int(tmp))
    else:
        print(int(tmp) - 1)

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

main()

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = x / (y+z)
    # print(tmp)
    # print(int(tmp))
    if tmp == int(tmp):
        # print("t")
        print(int(tmp))
    else:
        print(int(tmp) - 1)

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

main()

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = int(x / (y+z))
    if tmp * (y+z) < x:
        print(tmp)
    else:
        print(tmp - 1)

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

main()

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = int(x / (y+z))
    if tmp < x:
        print(tmp)
    else:
        print(tmp - 1)

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

main()

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = int(x / y / z)
    if tmp < x:
        print(tmp)
    else:
        print(tmp - 1)

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

main()

Submission status: Wrong Answer

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

def cal(x,y,z):
    tmp = x / y / z
    if tmp < x:
        print(tmp)
    else:
        print(tmp - 1)

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

main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
X,Y,Z = map(int,raw_input().split())
if X%(Y+Z) == 0:
    print((X/(Y+Z)-1))
else:
    print((X/(Y+Z)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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 + 2*c))
    print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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:
    print(maxSize);
    total = total+1;
print (total-1);

Submission status: Wrong Answer

Solution code:
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*(spaceSize+humanSize) <= chairSize:
    print(maxSize);
    total = total+1;
print (total-1);

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
I = input()
s = I.split(" ")
# print(s)
L = list(map(int, s))
X = L[0]
Y = L[1]
Z = L[2]
 
n = int((X - Y) / (Y + Z))
print(n)

Submission status: Wrong Answer

Solution code:
I = input()
s = I.split(" ")
# print(s)
L = list(map(int, s))
X = L[0]
Y = L[1]
Z = L[2]
import math

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

Submission status: Wrong Answer

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

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

print(pe_num)

Submission status: Wrong Answer

Solution code:
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())
isu(x, y, z)

Submission status: Wrong Answer

Solution code:
# coding:utf-8

line_list = input().split(" ")

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

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

Submission status: Wrong Answer

Solution code:
#!/user/bin/python
# coding: UTF-8

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

length = Z
num = 0
while length < X:
    length = length + Y + Z
    num = num + 1

ans = num - 1
print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def B_isu(X, Y, Z):
    import math
    # k(Y+Z)+Z<=Xを満たす最大のkが答え。0.001は除算の誤差でkが1狂うかもしれないので
    ans = math.floor((X - Z) / (Y + Z) + 0.001)
    return ans

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

judge = X//(Y)
if judge*(Y+Z)>=Z:
    print(str(X//(Y+Z)-1))
else:
    print(str(X//(Y+Z)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
#isuzen ningen ningenkankaku
x,y,z=map(int,input().split())
cnt=z
hum=0
while 1:
    if cnt>x:
        break
    else:
        cnt+=y+z
    hum+=1
print(hum)

Submission status: Wrong Answer

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

chair = num[0] - num[2]
cnt = 0

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

Submission status: Wrong Answer

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

seat = x
seat -= z
ans = 0
for i in range(x):
    if seat < 0:
        break
    seat -= (y+z)
    ans += 1
print(ans)

Submission status: Wrong Answer

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

seat = x
seat -= z
ans = 0
for i in range(x):
    if seat <= 0:
        break
    seat -= (y+z)
    ans += 1
print(ans)

Submission status: Wrong Answer

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

seat = x
seat -= z
ans = 0
for i in range(x):
    seat -= (y+z)
    ans += 1
    if seat <= 0:
        break
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
x,y,z=map(int,input().split())
l=[z]
per=0
while sum(l)<=x:
    l.append(y)
    l.append(z)
    #print(l)
    #print(sum(l))
    if sum(l)<=x:
        per+=1
print(per)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def answer(x: int, y: int, z: int) -> int:
    return len(range(y + z * 2, x + 1, y + z))


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def answer(x: int, y: int, z: int) -> int:
    return (x - z) // (y + z)


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


if __name__ == '__main__':
    main()

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

X -= Z
print(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,input().split())
for ans in range(1,100000):
    if ans*y+(ans+1)*z <= x < (ans+1)*y+(ans+2)*z:
        print(ans)
        exit()

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:
lst = input().split()
x = int(lst[0])
y = int(lst[1])
z = int(lst[2])

x -= z

print(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,input().split())
print((x-z)//(y+z))

Submission status: Accepted

Solution code:
X,Y,Z = list(map(int,input().split()))
out = 0
now = 0
if X>=Y+Z+Z:
    out += 1
    now += Y+Z+Z
    while X>=now+Y+Z:
        now += Y+Z
        out += 1
    print(out)

Submission status: Accepted

Solution code:

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

i=0
while True:
    need= i*Y + (i+1)*Z
    if need>X:
        break
    i+=1

print(i-1)

Submission status: Accepted

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

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())
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 = map(int, input().split())

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
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:
x, y, z = map(int, input().split())
for i in range(100000):
    if (i+1)*z + i*y > x:
        print(i-1)
        break

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())
#lis = list(map(int,input().split()))
print((a-c)//(b+c))

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 = list(map(int, input().split()))
b = x-z
c = y+z

print(b//c)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    x, y, z = map(int, input().split())
    x -= y + z * 2
    ans = 0
    if x < 0:
        return ans
    while x >= 0:
        ans += 1
        x -= y + z
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


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:
a = list(map(int,input().split()))
# b = list(map(int,input().split()))

x = 0
count=0

while a[0]-a[2]>= x:
    x += a[1]
    x += a[2]
    count+=1

print(count-1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x, y, z = map(int, readline().split())

    rem = x - z
    ans = 0
    while rem >= (y + z):
        rem -= (y + 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:
x, y, z = map(int, input().split())
print((x - z) // ( y + z))

Submission status: Accepted

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

X -= Z

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

Submission status: Accepted

Solution code:
def main():
    X, Y, Z = map(int, input().split())
    rest = X - Z
    c = 0
    while rest > 0:
        rest = rest - Y - Z
        if rest < 0:
            print(c)
            return
        elif rest == 0:
            print(c+1)
            return
        else:
            c += 1
main()

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())
n=0
while True:
  if n*y+(n+1)*z>x:
    print(n-1)
    exit()
  n+=1

Submission status: Accepted

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

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

print(result-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())
print((x - z) // (y + z))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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=input().split()
a=int(a)
b=int(b)
c=int(c)
print((a-c)//(b+c))

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

ans = 0

for i in range(x):
    
    if y*i+z*(i+1) <= x:
        ans=max(ans, i)
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 = list(map(int, input().split()))
x -= z
y += z
print(x//y)

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 = [int(i) for i in input().split()]
ans = x // (y + z)
if x - (ans * (y + z)) < z:
    ans -= 1
print(ans)

Submission status: Accepted

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

print(cnt)