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

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

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

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

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

Solution (Python):

import sys
import math

YES = "YES"  
NO = "NO"  


def solve(A: int, V: int, B: int, W: int, T: int):
    if V <= W :
        print(NO)
        exit()
    
    x_dif = abs(A-B)
    v_dif = abs(W-V)

    if math.ceil(x_dif / v_dif) <= T:
        print(YES)
    else:
        print(NO)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    V = int(next(tokens))  
    B = int(next(tokens))  
    W = int(next(tokens))  
    T = int(next(tokens))  
    solve(A, V, B, W, T)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

D = abs(B - A)
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())

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

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    a, v = nm()
    b, w = nm()
    t = ni()
    df_x = abs(b-a)
    df_v = v - w
    if df_v * t >= df_x:
        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(b-a) - (v-w)*t <= 0):
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

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


main()

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

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

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

Aleft = A-V*T
Aright = A+V*T
Bleft = B-W*T
Bright = B+W*T

if Aleft <= Bleft and Bright <= Aright:
    print("YES")
else:
    print("NO")

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

import sys
d = abs(b - a)
if d == 0:
    print('YES')
    sys.exit()
vv = v - w 
if vv <= 0:
    print('NO')
    sys.exit()

tt = d/vv
if tt <= 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())
ans = ''
if(a < b):
  pa = a + v * t
  pb = b + w * t
  if(pb <= pa):
    ans = 'YES'
  else:
    ans = 'NO'
else:
  pa = a - v * t
  pb = b - w * t
  if(pa <= pb):
    ans = 'YES'
  else:
    ans = 'NO'
print(ans)

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

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

Solution (Python):
if __name__ == "__main__":
    A, V= list(map(int, input().split()))
    B, W= list(map(int, input().split()))
    T = int(input())
    C = abs(A-B)
    X = V-W
    if C <= T*X:
        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 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)<=t*(v-w):
  print('YES')
else:
  print('NO')

Solution (Python):
a,asp=map(int, input().split(" "))
b,bsp=map(int, input().split(" "))
t=(int)(input())
if asp > bsp:
  print("YES") if abs(b-a)/(asp-bsp) <= t else print("NO")
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):
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())

dis = abs(A-B)

if V > W:
  if dis/(V-W) > T:
    print('NO')
  else:
    print('YES')
else:
  print('NO')

Solution (Python):
A,V=map(int,input().split())
B,W=map(int,input().split())
T = int(input())
sa=abs(A-B)
ksa=V-W
tsa=ksa*T

if sa<=tsa:
    print('YES')
else:
    print('NO')

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

flug = False
if V != W:
    dist = abs(A - B)
    speed = V - W
    second = dist / speed
    if 0 <= second <= T:
        flug = True
if flug: 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*T - V*T) <= 0:
    print('YES')
else:
    print('NO')

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

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

gap = abs(a - b)
velocity_gap = v - w

is_reached = gap <= (velocity_gap * t)
print('YES' if is_reached 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()
d=abs(B-A)
v=V-W
if d/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)
move =  v-w
if dis <= move * t:
    print('YES')
else:
    print('NO')

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

delta_v = V - W
if delta_v <= 0:
    print('NO')
elif (abs(A - B) + delta_v - 1) // delta_v > T:
    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):

import sys

YES = "YES"  
NO = "NO"  


def solve(A: int, V: int, B: int, W: int, T: int):
    distance = abs(A - B)
    velocity_diff = V - W
    if velocity_diff * T >= distance:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    V = int(next(tokens))  
    B = int(next(tokens))  
    W = int(next(tokens))  
    T = int(next(tokens))  
    solve(A, V, B, W, T)

if __name__ == '__main__':
    main()

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

def hantei(A,B,V,W,T):
    if V <= W:
        return('NO')
    else:
        if abs(B - A)/(V - W) <= T:
            return('YES')
        else:
            return('NO')
    
print(hantei(A,B,V,W,T))

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

if (V-W) != 0 and T >= (abs(A-B)/(V-W)) >= 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) * 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())

bfr = abs(a - b)
aft = (v * t - w * t)
if aft >= bfr:
    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:
        return False
    if abs(B-A)/(V-W) <= T:
        return True
    return False
if main():
    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+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):

import sys
input = sys.stdin.readline
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

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

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    A, V = readnums()
    B, W = readnums()
    T = readint()
    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')


if __name__ == "__main__":
    main()

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

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

Solution (Python):









import os
import sys




def main():
    a,v=map(int,input().split()) 
    b,w=map(int,input().split()) 
    t = int(input())
    sub=abs(a-b)
    if v<=w:
        print('NO')
        return 
    if sub>t*(v-w):
        print("NO")
        return
    print("YES")



if __name__ == "__main__":
    main()

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

relative_v = V - W
dist = abs(A - B)

if relative_v <= 0:
    print("NO")
elif dist <= relative_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:
    maxA = A + V * T
    maxB = B + W * T
    if maxA >= maxB:
        print("YES")
    else:
        print("NO")
else:
    maxA = A - V * T
    maxB = B - W * T
    if maxA <= maxB:
        print("YES")
    else:
        print("NO")

Solution (Python):

import sys


input = sys.stdin.readline
def IS(cb): return cb(input().strip())
def IL(cb): return [cb(s) for s in input().strip().split()]
def IR(cb, rows): return [IS(cb) for _ in range(rows)]
def ILL(cb, rows): return [IL(cb) for _ in range(rows)]


def solve():
    A, V = IL(int)
    B, W = IL(int)
    T = IS(int)

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

solve()

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

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

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

c = vel*T

if dis <= c:
  print("YES")
else:
  print("NO")

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

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

ans = abs(b-a) / (v-w)

if ans <= t:
    print('YES')
else:
    print('NO')

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


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

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

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

diffVW = V - W  
diffAB = abs(A - B)  

if diffVW <= 0:
    print("NO")
    exit(0)
else:
    diffVW = abs(diffVW)

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

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

if (t * s) >= 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")
    exit()

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

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

Solution (Python):
import math
a,v = [int(x) for x in input().split(' ')]
b,w = [int(x) for x in input().split(' ')]
t = int(input())

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

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

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

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

if __name__ == '__main__':
    result = main()
    print(result)

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

if abs(B-A)-(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())

dis = abs(A-B)
  
if (0 <= dis and dis <= T*(V-W)) or dis == 0:
  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:
  AT = A + V*T
  BT = B + W*T
  if(BT <= AT):
    ans = 'YES'
else:
  AT = A - V*T
  BT = B - W*T
  if(BT >= AT):
    ans = 'YES'
    
print(ans)

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

Solution (Python):
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,v = ma()
b,w = ma()
t = ni()
if w>=v:
    print("NO")
    exit()
d = abs(a-b)
if d + 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 = a+v*t
y = b+w*t
if a < b:
    x = a+v*t
    y = b+w*t
    if x < y:
        print('NO')
    else:
        print('YES')
else:
    x = a-v*t
    y = b-w*t
    if x > y:
        print('NO')
    else:
        print('YES')

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 1000000007



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

    if V == W:
        print("NO")
        return
        
    if A < B:
        t = (B-A)/(V-W)
    else:
        t = (A-B)/(V-W)
    
    if 0 < t and t <= 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())

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

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  


def solve(A: int, V: int, B: int, W: int, T: int):
    if V<=W:
        print(NO)
        return

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


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    V = int(next(tokens))  
    B = int(next(tokens))  
    W = int(next(tokens))  
    T = int(next(tokens))  
    solve(A, V, B, W, T)

if __name__ == '__main__':
    main()

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

Solution (Python):
A,V,B,W,T = map(int, open(0).read().split())
d = V - W
if d <= 0:
    print('NO')
else:
    if d * 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 a == b:
    print('YES')
    exit()
if b - a > 0:
    if (v - w) * t >= b - a:
        print('YES')
        exit()
    else:
        print('NO')
        exit()
else:
    if (v - w) * t >= a - b:
        print('YES')
        exit()
    else:
        print('NO')
        exit()

print('NO')

Solution (Python):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')


def main():
    a, v = ria()
    b, w = ria()
    t = ri()

    if a == b:
        ws('YES')
        return

    if v <= w:
        ws('NO')
        return

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

Solution (Python):
'''     
        
        
        

import sys
import math


def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin = open("input.txt","r")  
    sys.stdout = open("output.txt","w")  
    sys.stderr = open("output.txt","w")  

a, v = get_ints()
b, w = get_ints()
t = int(input())
if a < b:
    f1 = a + (v*t)
    f2 = b + (w*t)
else:
    f2 = a - (v * t)
    f1 = b - (w * t)
if f2 > f1:
    print("NO")
else:
    print("YES")



'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

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

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

a_mini = a-t*v
a_maxi = a+t*v
b_mini = b-t*w
b_maxi = b+t*w
if (a_mini <= b_mini <= a_maxi) and (a_mini <= b_maxi <= a_maxi):
    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:
    A = A+T*V
    B = B+T*W
    if A>=B:
        print('YES')
        exit()
else:
    A = A-T*V
    B = B-T*W
    if A<=B:
        print('YES')
        exit()
print("NO")

Solution (Python):

import collections
import sys


def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())


def main():
    A, V = LI()
    B, W = LI()
    T = I()

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


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

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

judge = (abs(A - B) - T * (V - W) <= 0)

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

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


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

Solution (Python):
import io,sys
sys.setrecursionlimit(10**6)


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

    l = abs(a-b)
    p = v-w

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

Solution (Python):
def main():

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

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


if __name__ == '__main__':
    print(main())

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

t = int(input())


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

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

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

t = int(input())

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

print(['NO', 'YES'][x >= d])

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

L = abs(A - B)
S = V - W
if S * 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)*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 a > b:
    if a - v * t <= b - w * t:
        print('YES')
    else:
        print('NO')
elif a == b:
    print('YES')
else:
    if a + v * t >= b + w * t:
        print('YES')
    else:
        print('NO')

Solution (Python):
import sys
import os
import itertools
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

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

    if T*W+abs(A-B)<=T*V:
        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 w>=v:
  print("NO")
  exit()

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

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:
        out='YES'
    else:
        out='NO'

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

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

Solution (Python):


def solve():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if V-W >0 and abs(A-B)/(V-W) <= T:
        return 'YES'
    return 'NO'

if __name__ == '__main__':
    print(solve())