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())
if (v-w)*t>=abs(b-a):
    print("YES")
else:
    print("NO")

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

Solution (Python):
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
def adj(n): return [[] for _ in range(n)]

a,v = imap()
b,w = imap()
t = iinput()

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

Solution (Python):
ax, av = map(int, input().split())
bx, bv = map(int, input().split())
t = int(input())
 
x = abs(ax - bx)
v = av - bv
dis = v * t
 
if dis >= x:
  print("YES")  
else:
  print("NO")

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



A,V = LI()
B,W = LI()
T = I()

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

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

l  = abs(a-b)

if (v - w) * t >= l:
    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()
dis = abs(A - B)
step = abs(W - V)
print("YES" if dis <= step * T else "NO")

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d1=abs(a-b)
d2=(v-w)*t
if d1<=d2:
  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)
sub = w-v

if(-(sub*t)>=dis):
    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 = list(map(int, input().split()))
b = list(map(int, input().split()))
t = int(input())
diff = (a[1]-b[1])*t 
adiff = abs(a[0]-b[0]) 
if diff >= adiff:
  print('YES')
else:
  print('NO')

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

Solution (Python):
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

    a, v = map(int, readline().split())
    b, w = map(int, readline().split())
    t = int(readline())
    b -= a
    b = abs(b)
    print('YES' if t * v >= t * w + b else 'NO')


if __name__ == '__main__':
    main()

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 speed<=0:
    print("NO")
else:
    if distance/speed <=t:
        print("YES")
    else:
        print("NO")

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

L = abs(A - B)
v = V - W

if L <= (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())

diff_x=abs(A-B)
diff_a=max(V-W,0)

if T*diff_a>=diff_x:
  print('YES')
else:
  print('NO')

Solution (Python):
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

a,v=map(int,input().split())
b,w = map(int,input().split())
V  = v-w
t = int(input())
d = abs(a-b)
if V <= 0:
  if d == 0:print("YES")
  else:
    print("NO")
  exit()
def ceil(x,y):
  return (x-1)//y+1
if ceil(d,V) <= t:
  print("YES")
else:
  print("NO")

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

Solution (Python):
numsA = [int(e) for e in input().split()]
numsB = [int(e) for e in input().split()]
T = int(input())
if abs(numsA[0]-numsB[0])<=(numsA[1]-numsB[1])*T:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, v = rm()
b, w = rm()
t = ri()
if v - w == 0:
  print('NO')
  exit()
if 0 <= 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)*T >= abs(B-A):
    print('YES')
else:
    print('NO')

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
k=abs(a-b)
if 0<=k<=(v-w)*t and 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"
if a > b: a,b = a*(-1), b*(-1)
if a == b: ans = "YES"
elif a < b:
    if v > w and (b-a) <= (v-w)*t: ans = "YES"
print(ans)

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,b,w,t=map(int,open(0).read().split())
if (a<b and a+v*t>=b+w*t)or(b<a and 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())

dis = abs(A - B)
if V <= W:
  print('NO')
else:
  if (dis / (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())
v=V-W
l=abs(A-B)
if l<=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 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())

print('YES' if abs(b-a) <= (v-w) * t else '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):
import sys
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
x = 0

if A > B:
    x = A
    A = B
    B = x


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

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

Solution (Python):
ABVW = [map(int, input().split()) for _ in range(2)]
AB, VW = [list(i) for i in zip(*ABVW)]
T = int(input())
 
x = abs(AB[0] - AB[1])
y = (VW[0] - VW[1])*T
if abs(AB[0] - AB[1]) - (VW[0] - VW[1])*T <= 0:
    print("YES")
else:
    print("NO")

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 else 'NO')

Solution (Python):
x,y = input().split()
q,w = input().split()
a =int(x)
b=int(y)
c= int(q)
d =int(w)
e =int(input())

if c-a >0:
  if c-a <=e*(b-d):
    print('YES')
   
  else:
    print('NO')
    
else:
  if a-c<=e*(b-d):
    print('YES')
   
  else:
    print('NO')

Solution (Python):
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())




if(a_speed < b_speed):
  caught = 'NO'
else:
  diff = abs(a_now - b_now)
  speed = a_speed - b_speed
  
  if(diff == 0):
    caught = 'NO'
  elif(speed == 0):
    
    caught = 'NO'
  else:
    q = diff / speed
    
    if(q <= t):
      caught = 'YES'
    else:
      caught = 'NO'

print(caught)

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

    print("NO")

Solution (Python):
ABVW = [map(int, input().split()) for _ in range(2)]
AB, VW = [list(i) for i in zip(*ABVW)]
T = int(input())
 
x = abs(AB[0] - AB[1])
y = (VW[0] - VW[1])*T
if x <= y:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7

a, v = MAP()
b, w = MAP()
t = INT()

if a == b:
    YES()
    exit()
if w >= v:
    NO()
    exit()

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

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

Solution (Python):
x1, v1 = map(int, input().split(' '))
x2, v2 = map(int, input().split(' '))
t = int(input())

p = abs(x2 - x1)
q = (v1 - v2) * t
if p <= q:
	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 and 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())

v = V - W
if v <= 0:
	print("NO")
else:
	if abs(A - B) <= T * v:
		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 -1 < ((b - a) / (v - w)) < 1:
        print('NO')
    elif 1 <= (abs(b - a) / (v - w)) <= t:
        print('YES')
    else:
        print('NO')

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

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

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

lange = abs(B - A)
s = V - W

res = 0

if s != 0:
    tmp = lange / s
    if tmp <= T and tmp >= 0:
        res = 1

if (res == 0):
    print("NO")
else:
    print("YES")

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

x = abs(a - b)
y = v - w
z = y * t

if z >= 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:
    print('NO')
else:
    if 1 <= (abs(b - a) / (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())
ans="NO"
if v>w:
  if abs(b-a)/abs(w-v)<=t:
    ans="YES"
print(ans)

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    dist = abs(a - b)
    speed = v - w
    if speed <= 0:
        print("NO")
    elif speed * t >= dist:
        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 A < B:
    ans = A+V*T >= B+W*T
else:
    ans = A-V*T <= B-W*T

if ans:
    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 1 <= (abs(b - a) / (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(B-A)+(W-V)*T > 0:
  print("NO")
else:
  print("YES")

Solution (Python):



def run(a, vt, b, wt):
    if a < b:
        if b + wt <= a + vt:
            return 'YES'
        else:
            return 'NO'
    else:
        if a - vt <= b - wt:
            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*T, B, W*T))


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(A-B)<=(V-W)*T else '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):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")
    import sys
    sys.exit()


if abs(B-A)/(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()
  
dis = abs(a-b)
vdis = v-w
time = dis/vdis
if time <= 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*t-w*t>=abs(-b+a):
  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):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) <= 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())
X = abs(A-B)
Y = V-W
if (V<=W):
  print('NO')

elif ((X/Y)<=T):
  print('YES')
else:
  print('NO')

Solution (Python):
import sys

la = list(map(int, input().split()))
lb = list(map(int, input().split()))
t = int(input())


dis = abs(la[0] - lb[0])

if la[1] - lb[1] > 0:
    if dis / (la[1] - lb[1]) <= t:
        print("YES")
        sys.exit()
print("NO")

Solution (Python):
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')

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

v = a[1]
w = b[1]

if v <= w:
    print('NO')
else:
    s = v - w
    d = abs(b[0] - a[0])
    if d / s <= t:
        print('YES')
    else:
        print('NO')

Solution (Python):
def tag(a,b,v,w,t):
    res = (v*t)-(abs(b-a)+(w*t))
    if res>=0:
        return "YES"
    return "NO"

if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    print(tag(a,b,v,w,t))

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

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


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

Solution (Python):
A, V = [int(n) for n in input().split()]
B, W = [int(n) for n in input().split()]
T = int(input())
 
if V <= W:
    print('NO')
    exit()
    
d = abs(A - B)

if V > W and 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 W>=V:
  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())
dl = abs(a - b)
dv = v - w
if dv > 0 and (dl+dv-1) // abs(dv) <= 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()

D = abs(A - B)
X = V - W

if D / X <= 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 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())
x=abs(A-B)
y=V-W
z=y*T
if z>=x:
  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

oni = a + v * t
nige = b + w * t

if oni >= nige:
    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)
d2 = (v-w)*t
msg = "YES" if d <= d2 else "NO"
print(msg)

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v*t >= abs(b - a) + 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")
elif (abs(A-B)/abs(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")
    import sys
    sys.exit()
import math
if abs(B-A)/(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())
dv = V - W
dist = abs(B - A)
if dv*T >= dist:
        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>0 and abs(a-b) <= t*(v-w)):
    print("YES")
else:
    print("NO")

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 and abs(A-B)/(V-W)<=T:
    Flag = True
else:
    Flag = False
    
if Flag:
    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) <= 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 v <= w:
    print('NO')
    exit()

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()
if 0 < abs((B-A))/(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) <= t*(v-w)):
    print("YES")
else:
    print("NO")

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

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

d = abs(A - B)

if V > W and 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 (v-w)*t >= abs(a-b):
    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 A == B:
        print('YES')
        return

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

    if d <= dv * T:
        print('YES')
    else:
        print('NO')
    return


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) <= 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:
    a -= v * t
    b -= w * t
    print('YES' if a <= b else 'NO')
elif a < b:
    a += v * t
    b += w * t
    print('YES' if a >= b else 'NO')

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

Solution (Python):
import numpy as np
import sys



def xnxn(n=0, flag="v"):
    """
    args:
        int n: a number of lows to read
    example:
        input   1
        retrun  1

        input   1 2 3
        return  [1,2,3]
        input   1 2 3
                4
        return  [[1,2,3],
                [4]]
    """
    if n == 0:
        temp = list(map(int, input().split()))
        if len(temp) == 1:
            if flag == "l":
                return temp
            else:
                return temp[0]
        elif len(temp) > 1:
            return temp
    else:
        temp = [list(map(int, input().split())) for _ in range(n)]
        return temp


a, v = xnxn()
b, w = xnxn()
t = xnxn()


















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


else:
    
    
    b_f = b-t*w
    a_f = a-t*v

    if b_f < a_f:
        print("NO")
    else:
        print("YES")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
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 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:
    A2 = A + T*V
    B2 = B + T*W

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

    if A2 <= B2:
        print("YES")
    else:
        print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
m = min(a,b)
M = max(a,b)
dis = M - m

if dis <= (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 B > A:
    Dis = B - A
    VtoW = V - W
else:
    Dis = A - B
    VtoW = V -W

result = VtoW * T

if Dis <= result:
    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):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a-b) <= t*(v-w):
    print('YES')
else:
    print('NO')

Solution (Python):
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())

def run():
	if A < B:
		c = (B + W*T) - (A + V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c =  (A - V*T) - (B - W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())

Solution (Python):
import sys
a,v=map(int,input().split())
c,w=map(int,input().split())
d=int(input())
if(w>v):
	print("NO")
else:
    x=0
    y=0
    if(a<=c):
        x=a+d*v
        y=c+d*w
        if(x>=y):
            print("YES")
        else:
            print("NO")
    else:
        x=a-d*v
        y=c-d*w
        if(x<=y):
            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:
    if abs(a-b)<=(v-w)*t:
        print("YES")
        sys.exit()
print("NO")

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a<b and v<=w:
    print("NO")
elif a>b and v<=w:
    print("NO")
elif a<b:
    if -((a-b)//(v-w))<=t:
        print("YES")
    else:
        print("NO")
else:
    if -((-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 a<=b:
  
  if a+t*v >= b+t*w:
    print('YES')
  else:
    print('NO')
else:
  if a-t*v<=b-t*w:
    print('YES')
  else:
    print('NO')

Solution (Python):
import sys
 
A, V = [int(x) for x in input().strip().split(" ")]
B, W = [int(x) for x in input().strip().split(" ")]
T = int(input().strip())
 
if V <= W:
    print("NO")
    sys.exit(0)
 
distance = abs(A - B)
diff = abs(V - W)
 
t, distance = divmod(distance, diff)
T -= t
if distance == 0 and T >= 0:
    print("YES")
    sys.exit(0)
elif T > 0:
    print("YES")
    sys.exit(0)
print("NO")
sys.exit(0)

Solution (Python):

AV = input()
BW = input()
T = int(input())
A = int(AV.split(" ")[0])
V = int(AV.split(" ")[1])
B = int(BW.split(" ")[0])
W = int(BW.split(" ")[1])
if (A <= B) and (A+V*T >= B+W*T):
    print("YES", end="")
elif (A > B) and (A-V*T <= B-W*T):
    print("YES", end="")
else:
    print("NO", end="")

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

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

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

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

Solution (Python):

a = input().split()
b = input().split()
c = input()

A = int(a[0])
V = int(a[1])
B = int(b[0])
W = int(b[1])
T = int(c)

if (B>A):
	if(W>=V):
		print("NO")
	else:
		times = (B-A) / (V-W)
		if(times <= T):
			print("YES")
		else:
			print("NO")
else:
	if(W>=V):
		print("NO")
	else:
		times = (A-B) / (V-W)
		if(abs(times) <= 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()

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

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

if A == B:
  print("YES")
elif 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())

ans='NO'
kyo=abs(a-b)
so=abs(v-w)

if w>v:
    ans='NO'
elif w==v:
    ans='NO'
elif w<v:
    if kyo>t*so:
        ans='NO'
    elif kyo<=t*so:
        ans='YES'
        
            
        
            

print(ans)

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

point_div = abs(a-b)
speed_div = v-w
if speed_div * t >= point_div:
    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:
    v = -v
    if w > 0:
        w = -w
if a < b and  w < 0:
    w = -w



A = t * v + a
B = t * w + b

if A > B:
    if  a < b:
        print("YES")
    else:
        print("NO")
elif A == B:
    print("YES")
elif A < B :
    if a < b:
        print("NO")
    else:
        print("YES")

Solution (Python):
in1 = input().split()
in2 = input().split()
in3 = input()
oni = int(in1[0])
onispeed = int(in1[1])
kid = int(in2[0])
kidspeed = int(in2[1])
time = int(in3)
pase = onispeed - kidspeed
flg = True 
if kid - oni < 0:
  flg = False 

if flg:
  oniend = (pase * time) + oni
  if (pase <= 0) or (oniend < kid):
    print("NO")  
  else:
    print("YES")
else:
  oniend = oni - (pase * time)
  if (pase <= 0) or (oniend > kid):
    print("NO")  
  else:
    print("YES")

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

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


if dis <= speed*T:
  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)
v_difference = v-w
if v_difference <= 0:
  print('NO')
elif distance > v_difference * t:
  print('NO')
else:
  print('YES')