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):
def main():
    import sys
    input = sys.stdin.readline
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if W >= V:
        print("NO")
        sys.exit()
    x = abs(A-B)
    v = V-W
    if x > T*v:
        print("NO")
    else:
        print("YES")

if __name__ == '__main__':
    main()

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

speed_dif = (v - w) * t
dis_dif = abs(a - b)

if dis_dif <= speed_dif:
    print('YES')
else:
    print('NO')

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

kyo = abs(b - a)
ti = v - w

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


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

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

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

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

A = int(A)
V = int(V)
B = int(B)
W = int(W)

T = int(input())



def solve():

    distance = abs(B-A)
    closer = abs(V-W)

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

    time = distance/closer
    if time <= T:
        print("YES")
        return
    else:
        print("NO")
        return


solve()

Solution (Python):

def main():
    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')
    


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

Solution (Python):
AV = input().split()
BW = input().split()
T = int(input())

if(int(AV[0]) > int(BW[0])):
  T *= -1

a = int(AV[0]) + int(AV[1]) * T
b = int(BW[0]) + int(BW[1]) * T

if(T >=0 and a >= b):
  print('YES')
elif(T <= 0 and a <= b):
  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 = abs((A - B))
y = (V - W)

if y <= 0:
    print("NO")
    sys.exit()

z = x / y

if z <= T:
    print("YES")
else:
    print("NO")

Solution (Python):
line = input().split()
line2 = input().split()
lim = int(input())

apos = int(line[0])
aspeed = int(line[1])
bpos = int(line2[0])
bspeed = int(line2[1])

distance = abs(bpos - apos)
deltaspeed = aspeed - bspeed

if deltaspeed <= 0:
  print("NO")
if deltaspeed > 0:
  time = distance/deltaspeed
  if time <= lim:
    print("YES")
  else:
    print("NO")

Solution (Python):
a,u = map(int,input().split())
b,v = map(int,input().split())
t = int(input())
if v >= u:
  print('NO')
  quit()
dis = (u-v) * t
f = abs(a-b)
if f <= dis:
  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 W >= V:
        print('NO')
    elif abs((A - B) / (W - V)) <= T:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Solution (Python):
a=input().split()
b=input().split()
t=int(input())
dis=abs(int(a[0])-int(b[0]))
p=-(int(b[1])-int(a[1]))
if p<=0: 
    print("NO")
else:
    if dis/p>t:
        print("NO")
    else:
        print("YES")

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):
def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())

    if v == w:
        print('NO')
        return 0
    if v-w < 0:
        print('NO')
        return 0
    if abs(b-a)/(v-w) <= 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())

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

result = 'NO'

if a == b:
    result = 'YES'
elif a < b and b + w * t <= a + v * t:
    result = 'YES'
elif b < a and b - w * t >= a - v * t:
    result = 'YES'

print(result)

Solution (Python):
A,V=map(int, input().split())
B,W=map(int, input().split())
T,=map(int, input().split())
x=abs(B-A)
v=V-W
if(x<=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 V - W > 0:
  if abs(B - A) - T * abs(V - W) <= 0:
    result = "YES"
  else:
    result = "NO"
else:
  result = "NO"
print(result)

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

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

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())
    y=0
    d=abs(A-B)
    if V!=W:
        t=d/(V-W)
        if 0<=t<=T:
            y=1
    
    if y==1:
        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 (b >= a):
  aa=a+v*t
  bb=b+w*t
  if (bb-aa >0):
    print ('NO')
  else:
    print ('YES')
else:
  aa=a-v*t
  bb=b-w*t
  if (bb-aa <0):
    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:
  av = a - (v * t)
  bw = b - (w * t)
  if av <= bw:
    print('YES')
  else:
    print('NO')

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

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

d = b - a
d = int(d)
dv = v - w
dv = int(dv)
d = abs(d)
if dv > 0 and abs(d) <= abs(dv) * T:
    print('YES')
else:
    print('NO')

Solution (Python):
AV = [int(x) for x in input().split()]
BW = [int(x) for x in input().split()]
A = AV[0]
V = AV[1]
B = BW[0]
W = BW[1]
T = int(input())
T = float(T)
D = abs(A-B)
S = V-W
if S>0:
    T1 = float(D/S)
    if T1<=T:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

Solution (Python):
A = list(map(int, input().split()))
B = list(map(int, input().split()))
T = int(input())
x=abs(A[0]-B[0])
v=A[1]-B[1]

if v*T>=x:
    print('YES')
else:
    print('NO')

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

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

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


if 'unittest' not in globals():
    resolve()

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

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

oni = v*t
nige = w*t
sa = abs(b-a)

if oni - nige >= sa:
    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*T)-(W*T):
  print('NO')
  exit()

tt =T/2
if tt%2 != 0:
    tt += 0.5

tt = int(tt)

for i in range(1,tt):
  if tt*V+A < tt*W+B:
    break
  if V*i+A >= W*i+B:
    print('YES')
    exit()

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

Solution (Python):
A,V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())
 
  
if A < B:
  if (A + V*T) >= (B + W*T):
    print("YES")
  else:
    print("NO")
elif 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')
else:
    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 w >= v:
  print("NO")
elif (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 w > v:
        print("NO")
    else:
        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")
else:
    dx = abs(A - B)
    dv = V - W
    t = dx / dv
    if t <= 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:
    a_2 = t * v + a
    b_2 = t * w + b

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

    if a_2 <= b_2:
        print("YES")
    else:
        print("NO")

Solution (Python):
a=[input() for i in range(3)]

oni=[int(i) for i in a[0].split()]
hito=[int(i) for i in a[1].split()]
t=int(a[2])

kyori=abs(oni[0]-hito[0])
spe=(oni[1]-hito[1])

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

else:

	if kyori>spe*t:
		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:

    dist_a = a + t*v

    dist_b = b + t*w

    if dist_a>=dist_b:
        print('YES')
    else:
        print('NO')
else:

    dist_a = a - t*v

    dist_b = b - t*w

    if dist_a<=dist_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):
    print('NO')
elif((v-w)*t < abs(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) < 0:
    child = max(a,b) - min(a,b)
else:
    child = abs(b-a)

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

n = child/mother
if n>0 and n<=t:
    print('YES')
else:
    print('NO')

Solution (Python):
num_input = [input() for i in range(3)]
a = int(num_input[0].split()[0])
v = int(num_input[0].split()[1])
b = int(num_input[1].split()[0])
w = int(num_input[1].split()[1])
t = int(num_input[2].split()[0])

hoge=b-a
if hoge<0:
    hoge=hoge*-1

if v-w<=0:
    ans="NO"
elif t*(v-w)>=hoge:
    ans="YES"
else:
    ans="NO"
    
print(ans)

Solution (Python):
from decimal import *
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
getcontext().prec=20
if A==B:
    print("YES")
elif A<B:
    if (V>W):
        if 0<=B-A<=T*(V-W):
            print("YES")
        else:
            print("NO")
    elif (V<=W):
        print("NO")
else:   
    if V>W:
        if 0<=A-B<=T*(V-W):
            print("YES")
        else:
            print("NO")
    elif (V<=W):
        print("NO")

Solution (Python):



from fractions import gcd














import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a,v = readInts()
b,w = readInts()
t = I()
ab = abs(a-b)
sa = abs(w - v)
if sa == 0:
    print('NO')
    exit()
if a == b:
    print('YES')
elif a < b and v <= w:
    print('NO')
elif a > b and v <= w:
    print('NO')
elif ab/sa <= t:
    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)
sa =abs(V-W)

if V<=W:
  print('NO')
else:
  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 a<b:
    new_a = a + v*t
    new_b = b + w*t
    if new_a >= new_b:
        print("YES")
    elif new_a < new_b:
        print("NO")
elif a>b:
    new_a = a - v*t
    new_b = b - w*t
    if new_a <= new_b:
        print("YES")
    elif new_a > new_b: 
        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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, V = map(int, readline().split())
B, W = map(int, readline().split())
T = int(readline())
if W >= V:
  print('NO')
  sys.exit()
if (abs(A-B)/(V-W)) <= T: 
  print('YES')
else:
  print('NO')

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

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

Solution (Python):
if __name__ == '__main__':
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    l =abs(a - b)
    s=abs(v - w)

    if w >= v or l / s > t:
        print("NO")
    else:
        print("YES")

Solution (Python):
def onigokko():
    A,V = map(int, input().split())
    B,W = map(int, input().split())
    T = int(input())
    
    if B < A:
        swap = A
        A = B
        B = swap
    
    tikaduku = V - W
    
    
    if tikaduku < 1:
        return 'NO'
    
    kyori = B - A
    
    if kyori <= tikaduku * T:
        return 'YES'
    
    return 'NO'

print(onigokko())

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

ans = "NO"

if(A<B):
    if(A+V*T >= B+W*T):
        ans = "YES"
elif(A>B):
    if(A+(-1)*V*T <= B+(-1)*W*T):
        ans = "YES"
print(ans)

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


if a<=b:

    dist_a = a + t*v

    dist_b = b + t*w

    if dist_a>=dist_b:
        print('YES')
    else:
        print('NO')
else:

    dist_a = a - t*v

    dist_b = b - t*w

    if dist_a<=dist_b:
        print('YES')
    else:
        print('NO')

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

def main():
    A,V = map(int,input().split())
    B,W = map(int,input().split())
    T = int(input())
    
    if A < B:
        if W >= V:
            print("NO")
            exit()
        Areach = A + V*T
        Breach = B + W*T
        if Areach < Breach:
            print("NO")
        else:
            print("YES")
    else:
        if W >= V:
            print("NO")
            exit()
        Areach = A - V*T
        Breach = B - W*T
        if Breach < Areach:
            print("NO")
        else:
            print("YES")

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

Solution (Python):
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
flag=0
ky=abs(a-b)
if b==a:
    flag=1
elif w>=v:
    pass
elif abs((b-a)/(v-w))<=t:
    flag=1
if flag==1:
    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:
    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 w>=v:
    print("NO")
else:
    V=v-w
    X=abs(a-b)
    if X/V<=t:
        print("YES")
    else:
        print("NO")

Solution (Python):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
dif = abs(a-b)
if (v-w)*t >= dif:
    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) - ( v - w) * t
if dis <= 0:
  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)<= (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 = "YES"
if(V<=W):
  ans = "NO"
elif(abs(A-B)>T*abs(V-W)):
  ans = "NO"
print(ans)

Solution (Python):
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())

n=abs(c-a)
m=b-d
if m<=0:
    print('NO')
elif e>=n/m:
    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)
v = V-W

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

Solution (Python):
def aaa(a,v,b,w,t):
  if v <= w:
    return False
  if abs(b-a) / (v-w) <= t:
    return True
  return False
  

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

ret = "YES" if aaa(a,v,b,w,t) else "NO"
print(ret)

Solution (Python):
AV = list(map(int,input().split()))
BW = list(map(int,input().split()))
T = int(input())

A = AV[0]
V = AV[1]
B = BW[0]
W = BW[1]

pos_A = A
pos_B = B

if A <= B:
    pos_B = B + T*W
    pos_A = A + T*V
    if pos_A >= pos_B:
        print('YES')
    else:
        print('NO')
else:
    pos_B = B - T*W
    pos_A = A - T*V
    if pos_A <= pos_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) :
    end_A = A + V * T
    end_B = B + W * T
    if (end_B <= end_A) :
        print("YES")
    else :
        print("NO")
else :
    end_A = A - V * T
    end_B = B - W * T
    if(end_A <= end_B) :
        print("YES")
    else :
        print("NO")

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

distance = abs(b-a)
speed = v-w

result = distance - speed * t
if result <= 0:
    print(ans[0])
elif result > 0:
    print(ans[1])

Solution (Python):
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
if W >= V:
  print('NO')
elif 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)<=0:
    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:
  print("NO")
else:
  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*T-W*T:
  print('YES')
else:
  print('NO')

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

behind = abs(B - A)
move = V - W

if behind <= move * 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)
if abs(a-b)%(v-w) == 0:
  f = abs(a-b)//(v-w)
else:
  f = abs(a-b)//(v-w)+1
if f <= t:
  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())

flag = 0
if v > w and a<b:
    if a+v*t >= b+w*t:
        flag = 1
elif v > w and a>b:
    if a-v*t <= b-w*t:
        flag = 1
    

if flag ==1:
    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 a==b:
    print('YES')
    sys.exit()
if a<b:
    w=abs(w)
    v=abs(v)
    if (a+v*t)>=(b+w*t):
        print('YES')
        sys.exit()
    else:
        print('NO')
else:
    w=(abs(w)*(-1))
    v=(abs(v)*(-1))
    if (a+v*t)<=(b+w*t):
        print('YES')
        sys.exit()
    else:
        print('NO')

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    a, v = list(map(int,sys.stdin.readline().split()))
    b, w = list(map(int,sys.stdin.readline().split()))
    t = int(sys.stdin.readline())
    dist = abs(a - b)
    if v <= w:
        print('NO')
        return 0

    vw = v - w
    if vw * t >= dist:
        print('YES')
    else: print('NO')


    return 0

if __name__ == "__main__":
    main()

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

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

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

if A > B:
    V *= -1
    W *= -1

A_d = V * T + A
B_d = W * T + B

if A < B:
    if A_d >= B_d: 
        print("YES")
    else:
        print("NO")
elif A > B:
    if A_d <= B_d: 
        print("YES")
    else:
        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:
    if A+T*V>=B+T*W:
        print('YES')
    else:
        print('NO')

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

Solution (Python):
def solve():
	posA, speedA = map(int, input().split())
	posB, speedB = map(int, input().split())
	T = int(input())
	if posA < posB:
		if posA + speedA * T >= posB + speedB * T:
			return "YES"
	else:
		if posA - speedA * T <= posB - speedB * T:
			return "YES"
	return "NO"

def main():
	print(solve())


if __name__ == '__main__':
	main()

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

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

if Y <= 0:
    print('NO')
    exit()

if Y == 0:
    print('NO')
else:
    if Y*T >= X:
        print('YES')
    else:
        print('NO')

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

tiji = abs(W-V)
kyori = abs(A-B)

migiiku = False
tukamae = False
if B>A:
    migiiku=True

if W>=V and A!=B:
    print('NO')
elif T*tiji < kyori:
    print('NO')
else:
    for i in range(1,T+1):
        if migiiku:
            A +=V
            B +=W
        else:
            A -= V
            B -= W
        
        if A==B:
            tukamae = True
            break
    
    if tukamae:
        print('YES')
    else:
        print('YES')

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

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

c = abs(b-a)
x = v - w


if x <= 0:
    print("NO")
    exit()

if c <= 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 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")

Solution (Python):

"""
Created on Sat Jun 13 21:30:21 2020

@author: NEC-PCuser
"""


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


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

if dis == 0:
    print("YES")
elif soutai_v <= 0:
    print("NO")
else:
    amari = dis % soutai_v
    shou = dis // soutai_v

    if shou > T or (shou == T and amari != 0):
        print("NO")
    else:
        print("YES")

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

Solution (Python):
[A,V]=[int(i) for i in input().split()]
[B,W]=[int(i) for i in input().split()]
T=int(input())
if W-V>0 or abs(B-A)>T*abs(W-V):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)+W*T<=V*T:
    print("YES")
else:
    print("NO")

Solution (Python):
avl=input().split()
bwl=input().split()
t=int(input())
a=int(avl[0])
v=int(avl[1])
b=int(bwl[0])
w=int(bwl[1])

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

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

B,W = map(int, input().split())

T=int(input())

kyori=abs(B-A)
idousa=V-W

if idousa>0:
  if T>=kyori/idousa:
    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())

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

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

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

if abs(a-b) <= 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 W>=V:
    print('NO')
    exit(0)

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