Problem:


Score : 200 points

Problem Statement

Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second.
The other child is now at coordinate B, and she can travel the distance of W per second.

He can catch her when his coordinate is the same as hers.
Determine whether he can catch her within T seconds (including exactly T seconds later).
We assume that both children move optimally.

Constraints

-10^9 \leq A,B \leq 10^9

1 \leq V,W \leq 10^9

1 \leq  T \leq 10^9

A \neq B

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A V
B W
T

Output

If "it" can catch the other child, print YES; otherwise, print NO.

Sample Input 1

1 2
3 1
3

Sample Output 1

YES

Sample Input 2

1 2
3 2
3

Sample Output 2

NO

Sample Input 3

1 2
3 3
3

Sample Output 3

NO



Sample input:
1 2
3 1
3


Sample output:
YES

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

if b<a:
  if a+t*v <= b+t*w:
    print('YES')
  else:
    print('NO')
else:
  if b+t*w <= a+t*v:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T =int(input())
    AB = abs(A-B)
    if V < W:
        ans='No'
    elif AB <= (V-W)*T:
        ans='Yes'
    else:
        ans='No'
    print(ans)
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def resolve():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    for i in range(T):
        if A > B:
            A -= V
            B -= W
        elif A < B:
            A += V
            B += W
        else:
            return print('YES')

    print('NO')

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A == B:
    print('YES')
elif A < B:
    if A + T * V >= B + T * W:
        print('YES')
    else:
        print('NO')
else:
    print('NO')
# else: # A > B
#     if B + T * W >= A + T * V:
#         print('YES')
#     else:
#         print('NO')

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

a_mov = v*t + a
b_mov = w*t + b
# print(a_mov,b_mov)
if b_mov <= a_mov:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

a_len = a 
b_len = b
if a_len >= b_len:
    print('YES')
    exit()
for i in range(1,t+1):
    a_len += v 
    b_len += w
    if a_len >= b_len:
        print('YES')
        exit()
print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
 
d = abs(b - a)
u = v - w
 
if d == 0:
  print("YES")
elif u <= 0:
  print("NO")
elif d // u <= t:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a > b:
    a, b = b, a
    v, w = w, v
    
if a + (v * t) >= b + (w * t):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys

A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if V == W:
  print("NO")
  sys.exit()
t= (B-A)%(V-W)
a = (B-A)//(V-W)
if t == 0:
  if A <= B and 0<= a <= T:
    print('YES')
  elif A >= B and -T <= a <= 0:
    print('YES')
  else:
    print('NO')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
x=a+v*t
y=b+w*t
if x>y or x==y:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#鬼
a,v=map(int,input().split())

#逃げている
b,w=map(int,input().split())

#t秒以内
t=int(input())

if a<b and v<w:
    print("NO")
    exit()

if b<a and w<v:
    print("NO")
    exit()

if w==v:
    print("NO")
    exit()

if (a-b)%(w-v)!=0:
    print("NO")
    exit()

if (a-b)%(w-v)>t:
    print("NO")
    exit()




print("YES")

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if w>=v:
    print("NO")
    exit()
x=abs(a-b)
n=x//(v-w)
if x/(v-w)==n and 1<=n<=t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v=input().split()
b,w=input().split()
t=int(input())
a=int(a)
v=int(v)
b=int(b)
w=int(w)

l=b-a
k=v-w
if w<v and b>a:
    if l/k <=t:
        print('Yes')

    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,v = input().split()
b,w = input().split()
t = input()

a_kyori = int(t) * int(v) + int(a)
b_kyori = int(t) * int(w) + int(b)

if a_kyori >= b_kyori:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())
if a+v*t >= b+w*t and a<b or a+v*t <= b+w*t and a>b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a==b:
    print("YES")
    sys.exit()
if a<b and a+v*t>=b+w*t:
    print("YES")
elif a>b and a-v*t<b-w*t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
[a, v] = raw_input().split()
[b, w] = raw_input().split()
t = int(raw_input())
if int(a) < int(b):
    if int(a) + int(v) * t >= int(b) + int(w) * t:
        print 'YES'
    else:
        print 'NO'
else:
    if int(a) - int(v) * t >= int(b) - int(w) * t:
        print 'YES'
    else:
        print 'NO'

Submission status: Wrong Answer

Solution code:
# N = int(input())
A, V = [int(i) for i in input().split()]
B, W = [int(i) for i in input().split()]
T = int(input())
if A < B:
    if A + V * T >= B + W * T:
        print("YES")
    else:
        print("NO")
elif B > A:
    if A - V * T <= B - W * T:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if w-v==0:
    if a-b==0:
        print("YES")
    else:
        print("NO")
elif w-v>0:
    print("NO")
else:
    if abs(a-b)//abs(w-v)<=t:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
L = b - a
s = v - w
if L < 0 or s <= 0 or L % s != 0 or L//s > t:
    result = "NO"
else:
    result = "YES"
print(result)

Submission status: Wrong Answer

Solution code:
import sys
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
dist=b-a
speed=v-w
if speed<=0:
    print("No")
    sys.exit()
if dist/speed<=t:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

x_diff = abs(B - A)
v_diff = V - W

if v_diff > 0:
    if int(x_diff + v_diff - 1)/ v_diff <= T:
        print('YES')
    else:
        print('NO')
else:
    if x_diff == 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if (b + (w * t)) - (a + (v * t)) > 0:
        print('NO')
else:
        print('YES')

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
dis=abs(a-b)
speed=v-w
if speed<=0 or dis//speed >= t:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

if a + v * t > b + w * t:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python


def run(a, v, b, w, t):
    if a == b:
        return 'Yes'
    elif b < a:
        if a - (v * t) <= b - (w * t):
            return 'Yes'
        else:
            return 'No'
    else:
        if b + (w * t) <= a + (v * t):
            return 'Yes'
        else:
            return 'No'


def main():
    A, V = list(map(int, input().split()))
    B, W = list(map(int, input().split()))
    T = int(input())

    print(run(A, V, B, W, T))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def read_input(trans=int):
    return list(map(trans, input().split()))


# 1行
A, V = read_input()
B, W = read_input()
T = int(input())

if W > V:
    print("No")
elif (V-W)*T >= abs(B-A):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A , V = map(int, input().split())
B , W = map(int, input().split())
T = int(input())
flag = 0

if (V - W) <= 0:
    flag = 0
else:
    if ((V - W) * T) >= (A - B):
        flag = 1

if flag == 1:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

if a > b:
    print("NO")
    exit()
a_b = b-a
v_w = v-w
t_2 = v_w * t
if t_2 >= a_b:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if (B-A)>T*(V-W):
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
a,v=[int(_) for _ in input().split()]
b,w=[int(_) for _ in input().split()]

T=n=int(input())

if (abs(a-b)<=v-w*T):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

A_ = A + V * T
B_ = B + W * T
if A_ >= B_:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if(V <= W ):
    print("NO") 
    exit()

t = V - W
if(abs(B-A) / t <= T and abs(B-A) % t == 0):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def main():
  a, v = map(int,input().split())
  b, w = map(int,input().split())
  t = int(input())
  ans = True
  vect = v - w
  if a == b:
    ans = True
  elif vect <= 0:
    ans = False
  else:
    if vect * t > abs(a - b):
      ans = True
    else:
      ans = False
  if ans:
    print("YES")
  else:
    print("NO")   
            


main()

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if B - A == 0:
    print('YES')
    exit()
else:
    if V - W == 0:
        print('NO')
        exit()

if 0 <= (B - A) / (V - W) and (B - A) / (V - W) <= T:
    if (B - A) // (V - W) == (B - A) / (V - W):
        print('YES')
        exit()

print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

# if (b - a) <= (v-w)*t:
#     print("YES")
# else:
#     print("NO")

if b+w*t > a+v*t:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A - B == 0:
    print('YES')
elif V <= W:
    print('NO')
else:
    print('YES' if abs(A-B+V-W-1)//abs(V-W) <= T else 'NO')

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
    print("no")
else:
    if abs(A - B) / (V - W) <= T:
        print("yes")
    else:
        print("no")

Submission status: Wrong Answer

Solution code:
A,V=map(int, input().split())
B,W=map(int, input().split())
T,=map(int, input().split())
x=B-A
v=V-W
if(x<v*T):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
c = 1
if a > b:
    c = -1

if (c == 1 and a + c*v*t >= b + c*w*t) or (c == -1 and a + c*v*t <= b + c*w*t):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,V = [int(v) for v in input().split()]
B,W = [int(v) for v in input().split()]
T = int(input())

A += int(1e9)
B += int(1e9)

if V * T + A >= W * T + B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

if A==B:
    print('YES')
elif W>=B:
    print('NO')
elif abs(A-B)>T*(V-W):
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

if V != W and V > W and T > (abs(A - B) / abs(V - W)):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
r = abs(a - b)

if (w - v) * t >= r:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

if A == B:
    print('Yes')
    sys.exit()

if A > B:
    if V >= W:
        print('NO')
    else:
        length = abs(A-B)
        s = abs(V-W)
        if length/s <= T:
            print('YES')
        else:
            print('NO')
else:
    if W >= V:
        print('NO')
    else:
        length = abs(A-B)
        s = abs(V-W)
        if length/s <= T:
            print('YES')
        else:
            print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int,input().split())
b, w = map(int,input().split())
t= int(input())

l = b-a
dv = v-w
if dv == 0:
    if l == 0:
        print("YES")
    else:
        print("NO")
elif l > 0:
    if dv*t >= l:
        print("YES")
    else:
        print("NO")
else:
    if dv*t <= l:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(float,input().split())
b,w = map(float,input().split())
t = float(input())

if b<a:
    u = a
    b = a
    a = u

if b+w*t <= a+v*t:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

for i in range(t+1):
  if v * i + a == w * i + b:
    print('YES')
    exit()
print('NO')

Submission status: Wrong Answer

Solution code:
a = [list(map(int, input().split())) for i in range(2)]
s = int(input())
if (a[0][1] <= a[1][1]):
    print("NO")
    exit()
if (a[1][0] - a[0][0]) -(a[0][1] - a[1][1])*s <= 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
#逃げるほうが早い
if V <= W:
  print('NO')
  exit()
else:
  soutaikyori=abs(A-B)
  soutaiV=V-W
  #距離を詰めきれない
  if soutaikyori * soutaiV > T:
    print("NO")
    exit()
  else:
  #距離を詰めきれる
    #割り切れる
    print("YES")
    exit()
    """
    if soutaikyori%soutaiV==0:
      print("YES")
    else:
      #割り切れない
      amari = soutaikyori%soutaiV
      nokorizikan=T-soutaikyori/soutaiV

      print("")
    """

Submission status: Wrong Answer

Solution code:
N,S = map(int,input().split())
n,s = map(int,input().split())
T = int(input())

if n < N:
  print("NO")
  exit(0)
ans1 = N + S*T
ans2 = n + s*T

if ans1 < ans2:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
AV = input().split()
BW = input().split()
T = input().split()
A = int(AV[0])
V = int(AV[1])
B = int(BW[0])
W = int(BW[1])
T = int(T[0])
if abs(A-B) < (V - W) * T:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, v = map(int,input().split())
b, w = map(int, input().split())
t = int(input())


if a > b and v >= w:
    print("NO")
    exit(0)
elif a < b and v <= w:
    print("NO")
    exit(0)


if v > w:
    if (v-w) * t >= b-a:
        print("YES")
    else:
        print("NO")

else:
    if (w-v) * t >= a-b:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(input())

if v - w != 0:
  dt = (b - a) // (v - w)
  flag = False
  if 0 <= dt and t >= dt:
    flag = True
    
  print("YES" if flag else "NO")
  
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

if a < b:
    result = 'YES' if a + t * v > b + t * w else 'NO'
else:
    result = 'YES' if a + t * v < b + t * w else 'NO'

print(result)

Submission status: Wrong Answer

Solution code:
# coding:utf-8
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ds = w - v
dd = abs(b - a)

if ds >= 0:
    print('NO')
    exit()
else:
    ans = dd / ds
    if ans <= t:
        print('YES')
        exit()

print('NO')

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

res = A + V*T - (B + W*T)
if A < B and res >= 0:
    print('YES')
elif B < A and res <= 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections


a,s1=list(map(int,stdin.readline().split()))
b,s2=list(map(int,stdin.readline().split()))
T = int(stdin.readline())

if a+s1*T>=b+s2*T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if abs(A + V*T) >= abs(B + W*T) :
    print('Yes')
else :
    print('No')

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

if A == B:
    print("YES")
    exit()

if V == W:
    print("NO")
    exit()

time = (A - B) / (W - V)
if 0 <= time and time <= T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a > b:
    print("YES")
    exit()

if a+v * t >= b+w * t and v > w:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

coordinate_ab = b-a
speed_ab = v-w

if coordinate_ab < speed_ab * t:
  print("YES")
else:print("NO")

Submission status: Wrong Answer

Solution code:
point_a, speed_a = map(int, input().split())
point_b, speed_b = map(int, input().split())
time = int(input())

point_a += speed_a * time
point_b += speed_b * time

if point_a >= point_b:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:

a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

a_len = a 
b_len = b
if a_len >= b_len:
    print('YES')
for i in range(1,t+1):
    a_len += v 
    b_len += w
    if a_len >= b_len:
        print('YES')
        exit()
print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    if a + v * t >= b + w * t:
        print("YES")
    else:
        print("NO")
else:
    if a + v * t >= b + w * t:
        print("NO")
    else:
        print("YES")

Submission status: Wrong Answer

Solution code:
A,V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())
P = "NO"

while B >= A and T >= 0:
    if A == B:
        P = "YES"
        break
    A = A + V
    B = B + W
    T = T - 1
    
print(P)

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
distance = abs(b-a)
speed = abs(v-w)*t
if(distance <= speed):print("YES")
else:print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
if A + V * T >= B + W * T:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A,V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())
x = A - B
v = abs(V - W)
if v <= 0:
        print('NO')
else:
    for t in range(1,T+1):
        x -= v
        if x == 0:
            print('YES')
            break
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V-W <= 0:
  print("NO")
elif B-A <= 0:
  print("NO")
else:
  if ((B-A)/(V-W)) <= T:
    print("YES")
  else:
    print("NO")

Submission status: Wrong Answer

Solution code:
[a, v] = raw_input().split()
[b, w] = raw_input().split()
t = int(raw_input())
if abs(int(a)) < abs(int(b)):
    if int(a) + int(v) * t >= int(b) + int(w) * t:
        print 'YES'
    else:
        print 'NO'
else:
    if int(a) - int(v) * t >= int(b) - int(w) * t:
        print 'YES'
    else:
        print 'NO'

Submission status: Wrong Answer

Solution code:
a_info = list(map(int, input().split()))
b_info = list(map(int, input().split()))
time = int(input())

a_last = a_info[0] + a_info[1] * time
b_last = b_info[0] + b_info[1] * time

if a_last >= b_last:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())


if (V-W) * T >= B - A:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
if v > w and v != w:
    c = abs(b - a)/ abs(v-w)
else:
    c = 10**20
if int(c) <= t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a + v * t >= b + w * t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
n = 0

for i in range(t):
    a += v
    b += w
    if (b - a) == 0:
        print("YES")
        n=1
        break

if n == 0:
    print("NO")

Submission status: Wrong Answer

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

b,w=map(int,input().split())

t=int(input())

total_a=a+v*t
total_b=b+w*t
if a<b:

    if total_a>=total_b:
        print("YES")

    else:
        print("NO")
elif a==b:
        print("YES")

else:
    if total_b>=total_a:
        print("YES")

    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
l = a + t * v
r = b + t * w
if l >= r:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")

# https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_B
import sys
sys.setrecursionlimit(1000000)

A,V = map(int,sys.stdin.readline().split())
B,W = map(int,sys.stdin.readline().split())
T = int(sys.stdin.readline().rstrip())

if W-V>=0:
    print("NO")
    exit()
if abs(A-B)//(V-W)<=T:
    print("YES")
    exit()
print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

sa = abs(a - b)
sas = abs(v - w)
if w >= v:
    if sa == 0:
        print("YES")
        exit(0)
    else:
        print("NO")
        exit(0)

if sa % sas == 0:
    if sa // sas <= t:
        print("YES")
        exit(0)
print("NO")

Submission status: Wrong Answer

Solution code:

A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

sa = abs(A-B)
d = abs(V-W)

if sa <= min(V,W):
    print("NO")
    exit()
if sa <= d*T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
for i in range(0, t+1):
    if v*i + a == w*i + b:
        print("YES")
        exit()
print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

AtoB = B - A
VtoW = V - W

if VtoW <= 0:
    print('NO')
elif AtoB % VtoW == 0 and AtoB - VtoW * T <= 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = 0

for i in range(t+1):
    a_place = a + v*i
    b_place = b + w*i
    if a_place == b_place:
        ans += 1
        break
        
if ans >= 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())

if A+V*T > B+W*T:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v-w > 0 and abs(a-b) <= t*(v-w):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A == B:
  print('YES')
  exit(0)
print(T*V+A)
print(T*W+B)
if ((T*V+A) - (T*W+B) >=0):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if A+V*T>=B+W*T:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
T = int(input())
if b-a < (v-w)*T:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
# N = int(input())
A, V = [int(i) for i in input().split()]
B, W = [int(i) for i in input().split()]
T = int(input())
if A < B:
    if A + V * T >= B + W * T:
        print("YES")
elif B > A:
    if A - V * T <= B - W * T:
        print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

# if (b - a) <= (v-w)*t:
#     print("YES")
# else:
#     print("NO")

if b+w*t >= a+v*t:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:

a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
if a == b:
    flag = 1
if a < b:
    b_ = w*t + b
    a_ = v*t + a
    if a_ >= b_:
        flag = 1
    else:
        flag = 0
elif a > b:
    b_ = -w*t + b
    a_ = -v*t + a
    if a_ <= b_:
        flag = 1
    else:
        flag = 0
if flag == 0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

flag = False
for i in range(t+1):
    if a + v*i == b + w*i:
        flag = True

if flag :
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
def iput(): return int(input())
def mput(): return map(int, input().split())
def lput(): return list(map(int, input().split()))

def solve():
    a, v = mput()
    b, w = mput()
    t = iput()
    bit = 0
    if a == b:
        bit = 1
    huga = abs(a - b) / abs(v + w)
    if abs(v - w) != 0:
        hoge = abs(a - b) / abs(v - w)
        if hoge % 1 == 0 and t >= hoge >= 0:
            bit = 1
    if huga % 1 == 0 and t >= huga >= 0:
        bit = 1
    if bit == 1:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=b-a
rv=v-w
if rv>0:
    if t>=(d/rv):
        print("YES")
elif d==0:
     print("YES")    
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if (A + T * V) < (B + T * W):
    print("NO")
    exit()

S = (B - A) // V

for i in range(S, T + 1):
    if (A + i * V) == (B + i * W):
        print("YES")
        exit()

print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if (V-W)<=0:
    print ("NO")
    exit(0)
if A > B:
    if (A-B) // (V-W) <= T:
        print("YES")
    else:
        print("NO")
else: 
    if (B-A) // (V-W) <= T:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

aa = A + V*T
bb = B + W*T
if A < B:
    if aa >= bb:
        print("YES")
    else:
        print("NO")
else:
    if aa <= bb:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if B > A:
    if W >= V:
        print('NO')
        exit()
    else:
        if B-A > (V-W)*T:
            print('NO')
            exit()
        else:
            print('YES')
else:
    if V >= W:
        print('NO')
        exit()
    else:
        if A-B > (W-V) * T:
            print('NO')
        else:
            print('YES')

Submission status: Wrong Answer

Solution code:
numsA = [int(e) for e in input().split()]
numsB = [int(e) for e in input().split()]
T = int(input())
result_A = numsA[0]+numsA[1]*T
result_B = numsB[0]+numsB[1]*T

if result_A >= result_B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int, input().split())
B,W = map(int, input().split())
T = int(input())

Ap = A + V*T
Bp = B + W*T

if Ap >= Bp:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
from decimal import *
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

if W==V:
    print("NO")
else:
    if (0<=(A-B)<=T*(W-V))or(0>=(A-B)>=T*(W-V)):
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

oni = a + (v*t)
child = b + (w*t)

if oni > child:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

a = a + t*v
b = b + t*w
        
if a >= b:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#鬼
a,v=map(int,input().split())

#逃げている
b,w=map(int,input().split())

#t秒以内
t=int(input())

if a<b and v<w:
    print("NO")
    exit()



if w==v:
    print("NO")
    exit()

if (a-b)%(w-v)!=0:
    print("NO")
    exit()

if (a-b)%(w-v)>t:
    print("NO")
    exit()




print("YES")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

d = B - A
s = (V - W) * T

if d <= s:
  print("YES")
else:
  print("NO")