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

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

Solution (Python):
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('YES')
    else:
        print('NO')

Solution (Python):
def main():
    a,v=map(int,input().split())
    b,w=map(int,input().split())
    t=int(input())
    distance=abs(a-b)
    ve=v-w
    if ve<=0:
        print("NO")
        return
    if distance<=ve*t:
        print("YES")
        return
    else:
        print ( "NO" )
        return
main()

Solution (Python):
def main():
    a,v=map(int,input().split())
    b,w=map(int,input().split())
    t=int(input())
    distance=abs(a-b) if a>=b else abs(b-a)
    ve=v-w
    if ve<=0:
        print("NO")
        return
    if distance<=ve*t:
        print("YES")
        return
    else:
        print ( "NO" )
        return



main()

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,v = LI()
    b,w = LI()
    t = I()
    if v <= w:
        print("NO")
        return
    s = abs(b-a)
    k = v-w
    if s <= t*k:
        print("YES")
    else:
        print("NO")
    return


if __name__ == "__main__":
    solve()

Solution (Python):
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<=W):
        print("NO")
        return

    if(A>B and V<=W):
        print("NO")
        return

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

resolve()

Solution (Python):
import sys

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

if v <= w:
  print('NO')
  sys.exit()

a_b_dist = abs(a-b)
v_w_dist = abs(v-w)

if v_w_dist * t < a_b_dist:
  print('NO')
  sys.exit()

print('YES')

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

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

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

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

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

dis=abs(A-B)
time=V-W 

if time<=0:
  print('NO')
else:
  if time*T>=dis:
    print('YES')
  else:
    print('NO')

Solution (Python):
a,v,b,w,t=map(int,open(0).read().split());print('YNEOS'[w>=v or t<-(-abs(a-b)//(v-w))::2])

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

Solution (Python):


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

if v <= w:
    print('NO')
    exit()
if abs(b-a)/(v-w) > t:
    print('NO')
    exit()
print('YES')

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

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


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    
    
    
    
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    if b < a:
        b = a + a - b
    if (b+w*t) - (a+v*t) <= 0:
        print("YES")
    else:
        print("NO")



if __name__ == '__main__':
    main()

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

print('YES' if abs(b-a)-(v-w)*t <= 0 else 'NO')

Solution (Python):
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) <= T * (V - W):
    print("YES")
  else:
    print("NO")

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

if a == b:
    print("NO")

As = v * t + a
Bs = w * t + b

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

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

a = V*T+A
b = W*T+B

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

Solution (Python):
def main():
    A, V = map(int, input().split())
    B, W = map(int ,input().split())
    T = int(input())
    
    if W < V:
        if abs(A - B) <= abs(W - V)*T:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")

if __name__ == "__main__":
    main()

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

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

if dv<=0:
    print("NO")

elif d/dv > T:
    print("NO")
else:
    print("YES")

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

c = abs(a - b)
d = (v - w) * t

if c <= d:
    print('YES')
else:
    print('NO')

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a, v = map(int,input().split())
    b, w = map(int,input().split())
    t = int(input())
    if v <= w or (v-w)*t < abs(a-b):
        print("NO")
    else:
        print("YES")

if __name__=='__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a, v = map(int,input().split())
    b, w = map(int,input().split())
    t = int(input())
    if v <= w or (v-w)*t < abs(a-b):
        print("NO")
    else:
        print("YES")

if __name__=='__main__':
    main()

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
N = int(input())
if W > V:
  print('NO')
else:
  if abs(A-B) <= N*(V-W):
    print('YES')
  else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
Vf = V - W
D = abs(A - B)
Df = D - Vf * T
if Df <= 0:
    print("YES")
else:
    print("NO")

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

Solution (Python):
def main():
    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) <= t * (v - w):
            print("YES")
        else:
            print("NO")


if __name__ == "__main__":
    main()

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

Solution (Python):
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

def main():
    A, V = ril()
    B, W = ril()
    T = ri()
    print('YES' if abs(A - B) <= T * (V - W) else 'NO')

if __name__ == '__main__':
    main()

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

dis0 = abs(b - a)
dis = v - w
if w>=v:
  print("NO")
  exit()

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

Solution (Python):
a, v = list(map(int, input().split(' ')))
b, w = list(map(int, input().split(' ')))
time = int(input())
if a>b:
  x1 = a - v*time
  x2 = b - w*time
  if x1 <= x2:
    print('YES')
  else:
    print('NO')
elif a<b:
  x1 = a + v*time
  x2 = b + w*time
  if x1 >= x2:
    print('YES')
  else:
    print('NO')

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V == W:
  print("NO")
  exit()
if A > B:
  t1 = A
  A = B
  B = t1
if V < W:

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

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

Solution (Python):
x,a=map(int,input().split())
y,b=map(int,input().split())
t=int(input())
if(abs(x-y)<=t*(a-b)):
    print('YES')
else:
    print("NO")

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

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A > B:
    x = A
    A = B
    B = x

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, V = mapint()
B, W = mapint()
T = int(input())

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

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

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

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

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

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

if v<w:
    print("NO")
elif v==w:
    if a==b:
        print("YES")
    else:
        print("NO")
elif v>w:
    t0 = abs((a-b)/(v-w))
    if t0<=t:
        print("YES")
    else:
        print("NO")

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

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A > B:
    x = A
    A = B
    B = x
if V <= W:
    ans="NO"
elif T*V+A-B >= T*W:
    ans="YES"
else:
    ans="NO"
print(ans)

Solution (Python):
import sys

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

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

Solution (Python):



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

    if v <= w:
        print('NO')
        exit()

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


if __name__ == '__main__':
    main()

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

w = abs(A-B)

if w <= (V-W)*T:
    print('YES')
else:
    print('NO')

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
d = abs(a-b)
if w-v >= 0:
    print("NO")
else:
    if t*(v-w) >= d:
        print("YES")
    else:
        print("NO")

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

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

Solution (Python):
import sys
input = sys.stdin.readline


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

    d = v - w

    if abs(a-b) <= t * d:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
d = abs(A-B)
dv = V-W
if dv<=0:
    print("NO")
else:
    if T*dv>=d:
        print("YES")
    else:
        print("NO")

Solution (Python):
import sys
input = sys.stdin.readline


def read():
    A, V = map(int, input().strip().split())
    B, W = map(int, input().strip().split())
    T = int(input().strip())
    return A, V, B, W, T


def solve(A, V, B, W, T):
    is_reached = True
    if A < B:
        a = A + V * T
        b = B + W * T
        is_reached = (a >= b)
    else:
        a = A - V * T
        b = B - W * T
        is_reached = (a <= b)
    return "YES" if is_reached else "NO"


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

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

ans = False

if v > w:
    diff = abs(a - b)
    ans = diff / (v - w) <= t

print("YES" if ans else "NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ok = False
if a < b:
    if a + v*t >= b + w*t:
        ok = True
else:
    if a - v*t <= b - w*t:
        ok = True

if ok:
    print('YES')
else:
    print('NO')

Solution (Python):
import math

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

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

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

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

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline

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

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

    if a <= b:
        if 0 < ((b - a) / (v - w)) <= t:
            print('YES')
        else:
            print('NO')
    else:
        if 0 < ((b - a) / (w - v)) <= t:
            print('YES')
        else:
            print('NO')


if __name__ == '__main__':
    main()

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

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v<w:
  print("NO")
  exit()
diff=abs(a-b)
for _ in range(t):
  diff=diff-v+w
  if diff<=0:
    print("YES")
    exit()
print("NO")

Solution (Python):
A ,V= map(int, input().split())
B ,W= map(int, input().split())
T = int(input())
if V <= W:
    print("NO")

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

Solution (Python):
r = lambda:map(int, input().split())
a, v = r()
b, w = r()
print("YES" if int(input())*(v-w) >= abs(b-a) else "NO")

Solution (Python):
import sys

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (a == b):
    print('YES')
    sys.exit(0)
if (v <= w):
    print('NO')
    sys.exit(0)
res = abs(a - b) / (v - w)
if (res > t):
    print('NO')
else:
    print('YES')
sys.exit(0)

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
flg = abs(a - b) + w * t <= v * t
print(["NO", "YES"][flg])

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
ans = "NO"

if abs(a-b) <= t * (v - w):
    ans = "YES"
    
print(ans)

Solution (Python):
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')
else:
    if A-V*T <= B-W*T:
        print('YES')
    else:
        print('NO')

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

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

a,v=nm()
b,w=nm()
t=ni()

d=abs(a-b)
d2=(v-w)*t

if(d<=d2):
  print('YES')
else:
  print('NO')

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

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

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

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

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
T = int(input())
 
k = b - a
flag = False
 
if k >= 0:
    l = T*v - T*w 
    if (k <= l):
        flag = True
 
if k < 0:
    k = a - b
    l = T*v - T*w
    if (k <= l):
        flag = True
 
 
if (flag == True):
    print('YES')
else:
    print('NO')

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

Solution (Python):
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
    a, v = map(int, readline().rstrip().split())
    b, w = map(int, readline().rstrip().split())
    t = int(readline().rstrip())
    if v <= w:
        print('NO')
        return
    print('YES' if abs(b - a) / (v - w)
          <= t else 'NO')


if __name__ == '__main__':
    main()

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

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




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




distance_AB = abs(A-B)
speed_AB = abs(V-W)

if speed_AB * T >= distance_AB:
    print("YES")
else:
    print("NO")

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

s = a+v*t
u = b+w*t
ss = a - v*t
uu = b - w*t

if b >= a:
  if s >= u:
    print ('YES')
  else:
    print ('NO')
else:
  if ss <= uu:
    print ('YES')
  else:
    print ('NO')

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a<b:
    a+=v*t
    b+=w*t
    if a<b:
        print("NO")
    else:
        print("YES")
else:
    a-=v*t
    b-=w*t
    if a>b:
        print("NO")
    else:
        print("YES")

Solution (Python):
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
if v-w>0:
    if abs(a-b)/(v-w) <= t:
        print('YES')
        exit()
print('NO')

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

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

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

dist = abs(a - b)
vd = v - w

if vd > 0:
    if 0 <= dist/vd/t <= 1:
        print("YES")
    else:
        print("NO")
elif vd == 0 and dist == 0:
    print("YES")
else:
    print("NO")

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

distance = abs(A-B)
speed = V-W
if distance <= speed*T:
    print("YES")
else:
    print("NO")

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

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

Solution (Python):
from sys import stdin
A, V = [int(_) for _ in stdin.readline().rstrip().split()]
B, W = [int(_) for _ in stdin.readline().rstrip().split()]
T = int(stdin.readline().rstrip())
if abs(A-B) <= (V-W)*T:
    print("YES")
else:
    print("NO")

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

if v <= w:
    print('NO')
    exit(0)

n = abs(a - b)
m = abs(v - w)

if n / m <= t:
    print('YES')
else:
    print('NO')

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,v = LI()
    b,w = LI()
    t = I()

    s = abs(a - b)
    k = (v-w) * t
    if k < s:
        return 'NO'

    return 'YES'


print(main())

Solution (Python):
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("YES")
    else:
        print("NO")

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



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

Solution (Python):


import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)

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

    dx = abs(A-B)
    dv = V-W

    if dv*T >= dx:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    main()

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = abs(A-B)
if d-(V-W)*T<=0:
  print("YES")
else:
  print("NO")

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

if V <= W:
  print("NO")
else:
  if (max(A, B) - min(A, B)) / (V - W) <= T:
    print("YES")
  else:
    print("NO")

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

if W>=V:
    print('NO')
    exit()
if abs(A-B)/(V-W) > T:
    print('NO')
    exit()

print('YES')

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

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

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

dist = abs(a-b)
pace = abs(v) - abs(w)

if pace <= 0:
  print('NO')
elif math.ceil(dist / pace) > t:
  print('NO')
else:
  print('YES')

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

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
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)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

a,v = I()
b,w = I()
t = k()
sa = v-w
if sa <= 0:
    print("NO")
    sys.exit()
kyori = abs(b-a)
if (kyori / sa)<=t:
    print("YES")
else:
    print("NO")

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

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

Solution (Python):


"""
   A(V)             B(W)
---------------------------------

"""

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

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

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a <= b:
    print('YNEOS'[a+v*t < b+w*t::2])
else:
    print('YNEOS'[a-v*t > b-w*t::2])

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
diff = abs(A - B)
dspeed = V - W
if dspeed * T >= diff:
    print("YES")
else:
    print("NO")

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

speed = V - W
length = abs(B - A)

if length <= T * speed:
  print('YES')
else:
  print("NO")

Solution (Python):
def solve(a, v, b, w, t):
    return "YES" if 0 < (v-w) and abs(b-a) / (v-w) <= t else "NO"

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

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

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

ans = 'NO'
distance = abs(B-A)
if V == W:
  pass
else:
  t = distance/(V-W)
  if 0 < t <= T:
    ans = 'YES'

print(ans)

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

d = abs(a-b)
s = v-w
if s <= 0: print("NO"); exit()

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

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

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

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

x = abs(a-b)

y = (v - w) * t

if y >= x:
    print('YES')
else:
    print('NO')

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

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

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

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

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

a_t = t*v
b_t = t*w

if a_t >= b_t+abs(a-b):
    print('YES')
else:
    print('NO')

Solution (Python):
a = input().split()
b = input().split()
t = input()

dist = abs(int(a[0])-int(b[0]))
len = int(int(a[1]) - int(b[1]))*int(t)

if (dist > len):
	print("NO")
else:
	print("YES")

Solution (Python):
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
if V!=W:
    t = (B-A)/(V-W)
    if A>B:
        t=-t
    if 0<=t<=T:
        print('YES')
    else:
        print('NO')
else:
    if A!=B:
        print('NO')
    else:
        print('YES')

Solution (Python):
A,a = map(int,input().split(" "))
B,b = map(int,input().split(" "))
c = int(input())
if abs(A-B) <= (a - b) * c:
    print("YES")
else:
    print("NO")

Solution (Python):
import math
import sys
A,V = map(int, input().split())
B,W = map(int, input().split())
T=int(input())
kyo=abs(A-B)
hay=V-W
if hay<=0 :
    print("NO")
    sys.exit()
if T>=math.ceil(kyo/hay) :
    print("YES")
else:
    print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if a > b:
    A = a - v*t
    B = b - w*t
    if A <= B:
        print("YES")
    else:
        print("NO")
else:
    A = a + v*t
    B = b + w*t
    if A >= B:
        print("YES")
    else:
        print("NO")

Solution (Python):
def main():
    A, V = (int(i) for i in input().split())
    B, W = (int(i) for i in input().split())
    T = int(input())
    if A == B:
        print("YES")
    elif V <= W:
        print("NO")
    elif abs(A-B) <= (V-W)*T:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Solution (Python):
import copy

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

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

main()

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

if v <= w:
    print('NO')
elif (abs(a-b) / (v-w)) <= t:
    print('YES')
else:
    print('NO')

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

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
x = abs(b - a)
ans = ''
if v <= w:
  ans = 'NO'
else:
  if x / (v - w) <= t:
    ans = 'YES'
  else:
    ans = 'NO'
print(ans)