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

total = z
count = 0
while total < x:
    total += y + 1
    count += 1
if total == x:
    print(count)
elif total > x:
    print(count - 1)

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+Z)))

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
#lis = list(map(int,input().split()))
if (a%(b+c)) == 0:
    print((a//(b+c))-1)
else:
     print((a//(b+c)))

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

Submission status: Wrong Answer

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

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

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x -= z

# data = [0] * x
ans = 0

i = 0
space = 0
# 処理系
while i != x:
    # 初期値代入
    if i == 0:
        # y の幅分だけ変更していく
        for j in range(y):
            # data[i] = 1
            i += 1
        ans += 1
        continue

    if not space == z:
        space += 1
        i += 1
        continue
    else:
        space = 0
        current = i + 1
        if x - current >= y:
            # y の幅分だけ変更していく
            for j in range(y):
                # data[i] = 1
                i += 1
            ans += 1
            continue
        else:
            break

# 出力
print( ans )

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# ABC078 B - ISU

# Y*[人数]+Z*[人数]+1 <=X
# 3*q+1*q+1<=13
# Y*q+Z*q+1<=X
# q<=(X-1)/(Y+Z)

import math
x,y,z = map(int,input().split())
t = (x-1)/(y+z)
print(math.floor(t))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0
while True:
    X -= Z
    if X <= 0:
        print(ans)
        break
    X -= Y
    if X <= 0:
        print(ans)
        break
    ans += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y,z=map(int,input().split())
if x%(y+z)<=z:
  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:
X,Y,Z = map(int,input().split())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(X//(Z+Y))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

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

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())
X+=Z
print(X//(Z+Y))

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

X,Y,Z = I()
print(1+(X-Y)//(Y+Z))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
ans = 0
for i in range(z, 10**5):
    if (x-i) % (y+i) == 0:
        ans = (x-i) // (y+i)
        break
print(int(ans))

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
ans = 0
for i in range(z, 10**5):
    if (x-i) % (y+i) == 0:
        ans = (x-i) / (y+i)
        break
print(int(ans))

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
ans = 0
for i in range(z, x):
    if (x-i) % (y+i) == 0:
        count = (x-i) / (y+i)
        if count >= ans:
            ans = count
print(int(ans))

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

Submission status: Wrong Answer

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

n = x//(y+z)

if x - (y+z)*n >= y:
  print(n+1)
else:
  print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(10**99):
  s += y+z
  count += 1
  if s > x:
    break
  
if s - z <= x:
  print(count)
elif s-z > x:
  print(count-1)

Submission status: Wrong Answer

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

for i in range(10**99):
  s += y+z
  count += 1
  if s > x:
    break
  
if s - z <= x:
  print(count)
else:
  print(count-1)

Submission status: Wrong Answer

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

for i in range(10**6):
  t += y
  if t<=x:
    count += 1
  else:
    break
  t += z
  
print(count)

Submission status: Wrong Answer

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

for i in range(10**6):
  t += y
  if t<=x:
    count += 1
  else:
    exit()
  t += z
  
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0
while x >= y + z:
    ans += 1
    x -= y + z

print(ans)

Submission status: Wrong Answer

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

ans = 0
while x > y + z:
    ans += 1
    x -= y + z

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(cnt)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

t = Z
c = 0
while (True):
  t+=Y 
  if t>=X:
    print(c)
    exit()
  t+=Z
  c+=1

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = int(x/(y+z))
if x%(y+z) <= z:
    ans -= 1
print(ans,x%(y+z))

Submission status: Wrong Answer

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

ans = int(x/(y+z))
if x%(y+z) < z:
    ans -= 1
print(ans,x%(y+z))

Submission status: Wrong Answer

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

ans = int(x/(y+z))
if x%(y+z) == 0:
    ans -= 1
print(ans)

Submission status: Wrong Answer

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

cnt = 0
rest = x

while(True):
    if(rest - (y + z) > z):
        x -= y + z
        cnt += 1
        rest -= (y + z)
    else:
        break


print(cnt)

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())
print((X-Z)//Y+Z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x,y,z = iim()
print((x-2*z)//(z+y))

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x,y,z = iim()
print(x//(z+y))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a , b , c = map(int, input().split())
m = a % (b+c)
ans = a // (b+c)
if m > 0:
    print(ans)
else:
    print(ans-1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(x//(y+z))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def isu(x , y , z):

    ans = x // (y + z)

    return ans if (x % (y + z) * (y + z)) + z <= x else ans - 1
def main():
    x , y , z = map(int , input().split())
    print(isu(x , y , z))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def isu(x , y , z):

    ans = x // (y + z)

    return ans if (x % (y + z) * (y + z)) + z < x else ans - 1
def main():
    x , y , z = map(int , input().split())
    print(isu(x , y , z))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def isu(x , y , z):

    ans = x // (y + z)

    return ans if x % (y + z) != 0 else ans - 1
def main():
    x , y , z = map(int , input().split())
    print(isu(x , y , z))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def isu(x , y , z):

    ans = 1
    count = 0

    while x >= ans:
        ans += (y + z)
        count += 1
    return count - 1

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


if __name__ == '__main__':
    main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Wrong Answer

Solution code:
x,y,z = map(int,input().split())
num = x//(y+z)
mod = x%(y+z)
if 0<=mod<=z:num-=1
print(num)

Submission status: Wrong Answer

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

cnt = 0
x = x - z

while( x > y+z ):
  cnt += 1
  x = x - y -z
  
print(cnt)

Submission status: Wrong Answer

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

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())
num=0
sum=z
for i in range(x) :
    if sum<x :
        sum+=y
        num+=1
        sum+=z
print(num-1)

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

result = X // (Y + Z) - 1
while X < result * Y + (result + 1) * Z:
    result += 1
print(result)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
X, Y, Z = [int(x) for x in input().split()]
ans = 1
X -= Y
ans += (X // (Y + Z))
print(ans)

Submission status: Wrong Answer

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

ans = 0
for i in range(X // Y):
    if Y * i + Z * (i + 1) <= X:
        ans = i
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(num)

Submission status: Wrong Answer

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

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

personal_width = Y + Z
chair_width = X - 2 * Z

number = chair_width // personal_width
amari = X % personal_width

if amari >= X:
    number += 1

print(number)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0

while True:
  X -= (Y + Z)
  if X <= 0:
    break
  else:
    ans += 1
    
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = x // (y+z)
if x - y*a < y:
    print(a)
else:
    print(a+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

X -= Y 

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
total = x // (y + z)
if x - total * (y + z) >= y:
    pass
else:
    total = max(0, total - 1)
print(total)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while s > y + z:
  s = s - y - z
  p += 1
    
print(p)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X, Y, Z = map(int, input().split())
print((X-Y)//(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:
x,y,z=map(int,input().split())
print(int(x-z// y+z))

Submission status: Wrong Answer

Solution code:
x,y,z=map(int,input().split())
print(int(x-z//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:
x,y,z = map(int, input().split())
a = 0 

for i in range(x//y):
  if i <= (x-z)//(y+z):
    a = i
    
print(a)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, y, z = map(int, input().split())
tmp = x - y - z - z
ans = 1 if tmp > 0 else 0

while True:
    if tmp < y + z:
        break
    tmp = tmp - y - z
    ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(49999):
  if (y*i) + z+(i+1) <= x:
    cnt += 1
  
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

p = 5000
while True:
    if x >= (p+1)*z + p*y:
        print(p)
        exit()
    else:
        p -= 1

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
a = n[0]
b = n[1]
c = n[2]

i = 0
l = a

l -= c

while l > b + c:
  i += 1
  l -= b + c

print(int(i))

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
a = n[0]
b = n[1]
c = n[2]

i = 0
l = a

l -= c

while l > b + c:
  i += 1
  l -= b + c

print(int(i))

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
import fractions


class KyoPro:
    AtCoder_Mod = 1000 * 1000 * 1000 + 7

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

    @staticmethod
    def MakeStringFromNumbers(a):
        if len(a) == 0:
            return
        s = str(a[0])

        for i in range(1, len(a)):
            s += ' ' + str(a[i])

        return s

    # 二分探索、配列、目的の値、比較の関数（必要なければNone）
    @staticmethod
    def BinarySearch(ls, target, func):
        if(func is None):
            def func(a, b): return a < b

        def eq(a, b): return (not func(a, b)) and (not func(b, a))

        left = 0
        right = len(ls) - 1

        while(True):
            if(right - left < 10):
                for i in range(left, right + 1):
                    if(eq(ls[i], target)):
                        return True
                return False

            center = (left + right) // 2
            if(eq(ls[center], target)):
                return True
            if(func(ls[center], target)):
                left = center
            if(func(target, ls[center])):
                right = center


class cin:
    InputList = []

    def __init__(self):
        pass

    def Read(self):
        cin.InputList += input().split()

    def ReadInt(self):
        if(len(cin.InputList) == 0):
            self.Read


def main():
    temp = KyoPro.ReadListOfNumbers()
    x = temp[0]
    y = temp[1]
    z = temp[2]

    y += z
    x += z

    print(x // y)


main()

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
import fractions


class KyoPro:
    AtCoder_Mod = 1000 * 1000 * 1000 + 7

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

    @staticmethod
    def MakeStringFromNumbers(a):
        if len(a) == 0:
            return
        s = str(a[0])

        for i in range(1, len(a)):
            s += ' ' + str(a[i])

        return s

    # 二分探索、配列、目的の値、比較の関数（必要なければNone）
    @staticmethod
    def BinarySearch(ls, target, func):
        if(func is None):
            def func(a, b): return a < b

        def eq(a, b): return (not func(a, b)) and (not func(b, a))

        left = 0
        right = len(ls) - 1

        while(True):
            if(right - left < 10):
                for i in range(left, right + 1):
                    if(eq(ls[i], target)):
                        return True
                return False

            center = (left + right) // 2
            if(eq(ls[center], target)):
                return True
            if(func(ls[center], target)):
                left = center
            if(func(target, ls[center])):
                right = center


class cin:
    InputList = []

    def __init__(self):
        pass

    def Read(self):
        cin.InputList += input().split()

    def ReadInt(self):
        if(len(cin.InputList) == 0):
            self.Read


def main():
    temp = KyoPro.ReadListOfNumbers()
    x = temp[0]
    y = temp[1]
    z = temp[2]

    y += z
    x += z

    print(x / y)


main()

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import time
import re
import math
import fractions

def main():
    X,Y,Z=map(int,input().split())
    h=Y*Z+Z
    print(X//h)
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())

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())
ans = X // (Y + 2*Z)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X, Y, Z = [int(x) for x in input().split()]
tmp = X/(Y+Z)
if tmp % 1:
    print(int(tmp))
else:
    print(int(tmp-1))

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 = list(map(int, input().split()))
for i in range(X+1):
    if (X-(i*Z+1)-(i*Y)) == 0:
        print(i)
        exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X,Y,Z = map(int,input().split())
X1 = X - 2*Z
count = 0

while X1 >= Y:
    count += 1
    X1 -= Y
print(count)

Submission status: Wrong Answer

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