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 = [int(i) for i in input().split()]
b, w = [int(i) for i in input().split()]
t = int(input())

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

Solution (Python):

import sys


def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if A < B:
        a = V * T + A
        b = W * T + B
        if a >= b:
            print('YES')
        else:
            print('NO')
    elif A > B:
        a = -(V * T) + A
        b = -(W * T) + B
        if a <= b:
            print('YES')
        else:
            print('NO')


if __name__ == '__main__':
    main()

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

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

Solution (Python):
i=(input().split())
j=(input().split())
k=(input())

A=int(i[0])
V=int(i[1])
B=int(j[0])
W=int(j[1])
T=int(k)

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

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

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

d = sa // sas

if d >t:
    print("NO")
if d == t:
    if sa % sas == 0:
        print("YES")
    else:
        print("NO")
if d < t:
    if sa - (d*sas) -sas <=0:
        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)
sokudo = w - v
if kyori + sokudo * t <= 0:
    print("YES")
else:
    print("NO")

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

def zettaiti(A):
    if A>=0:
        return A
    else:
        return -1*A

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

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



diff = max(A, B) - min(A, B)

speed = V - W

if diff / speed <= T:
    print("YES")
else:
    print("NO")

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


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

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

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

yes = "YES"
no = "NO"

if (a == b):
    print(yes)
    sys.exit()

if (w >= v):
    print(no)
    sys.exit()

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

if ((distance - (diff_spd * t)) > 0):
    print(no)
    sys.exit()

print(yes)

Solution (Python):


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

    if B>A:
        d1 = V*T+A
        d2 = W*T+B
        if (d1 >= d2):
            print('YES')
        else:
            print('NO')
    else:
        d1 = -V*T+A
        d2 = -W*T+B
        if (d2 >= d1):
            print('YES')
        else:
            print('NO')
if __name__ == '__main__':
    main()

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    a, v = LI()
    b, w = LI()
    t = II()
    if (v - w) * t >= abs(a - b):
        print("YES")
    else:
        print("NO")
    return



if __name__ == '__main__':
    solve()

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

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

Solution (Python):
import sys
import math
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
u=v-w
if u<=0:
  print("NO")
  sys.exit()

t2=abs(b-a)/u
if math.ceil(t2)<=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(B - A)
hayasa = V - W

if hayasa > 0 and hayasa * T >= distance:
  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("NO")
else:
  print("YES")

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

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

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

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

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


vt = v * t
wt = w * t



if vt - wt >= ab:
    print("YES")
else:
    print("NO")

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
A_low =A
A_high =A
B_low = B
B_high=B
A_low=A_low-(V*T)
A_high=A_high+(V*T)
B_low=B_low-(W*T)
B_high=B_high+(W*T)
if((B_low>=A_low) and (B_high<=A_high)):
    print("YES")
    exit()
    
print("NO")

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

sa=b-a
st=v-w

if sa<0:
  sa=-1*sa
if sa>st*t:
  print("NO")
else:
  print("YES")

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

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

result = abs((B - A)) + (W * T) - V * T

if result <= 0:
    print('YES')
else:
    print('NO')

Solution (Python):

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

  a = int(a) 
  v = int(v) 
  b = int(b) 
  w = int(w) 

  if a < b:
    distance = b - a
    relative_speed = v - w
    if relative_speed <= 0:
      return 'NO'
    else:
      if (distance / relative_speed) > t:
        return 'NO'
      else:
        return 'YES'
  else: 
    distance = a - b
    relative_speed = v - w
    if relative_speed <= 0:
      return 'NO'
    else:
      if (distance / relative_speed) > t:
        return 'NO'
      else:
        return 'YES'

print(method())

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

def lcm(x, y):
    return (x * y) // math.gcd(x, y)
def solve(A,V,B,W,T):
    diff = abs(A - B)
    time = (V - W) * T
    return "YES" if(diff <= time) else "NO"
def main():
    A,V = map(int,input().split())
    B,W = map(int,input().split())
    T = int(input())
    
    print(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:
    at = a + v*t
    bt = b + w*t
    if at >= bt:
        print("YES")
    else:
        print("NO")

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

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


if(a > b):
    c = a - t * v
    d = b - t * w
    if(c <= d):
        print("YES")
    else:
        print("NO")
elif(a == b):
    print("YES")
else:
    c = a + t * v
    d = b + t * w
    if(c >= d):
        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)
if C>(V-W)*T:
    print("NO")
else:
    print("YES")

Solution (Python):
import sys

a,b=map(int,input().split())
c,d=map(int,input().split())
t=int(input())
if(d>b):
	print("NO")
else:

    p1=0
    p2=0
    if(a<=c):
        p1=a+t*b
        p2=c+t*d
        if(p1>=p2):
            print("YES")
        else:
            print("NO")
    else:
        p1=a-t*b
        p2=c-t*d
        if(p1<=p2):
            print("YES")
        else:
            print("NO")

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
res = False
if B > A:
    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 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,b= list(map(int,input().split()))

c,d = list(map(int,input().split()))
time = int(input())
if b <= d:
    print("NO")
else:
    dis = abs(a-c)
    ans = dis/(b-d)
    if ans <= time:
        print("YES")
    else:
        print("NO")

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD
combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''
def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''
"
def gcd(a, b):
    while b:
        
        
        a, b = b, a % b
    return a

"
def lcm(a, b):
    return a * b // gcd (a, b)

"
def divisor(n):
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table











'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
'''
引数endに任意の文字列を指定すると、その文字列が改行の代わりに最後に挿入される。例えば連続するprint()の出力を改行なしで単純に連結したい場合は空文字列''を指定すればよい。

print('abc', end='---')
print('xyz')


print('abc', end='')
print('xyz')

source: print_basic.py
なお、デフォルトで改行されるのは引数endのデフォルト値が改行文字'\n'に設定されているから。
'''

def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    a,v=map(int, input().split(" "))
    b,w=map(int, input().split(" "))
    t=int(input())
    dis=max(a,b)-min(a,b)
    disv=v-w
    
    if disv<=0:
        print("NO")
        sys.exit()
    
    
    
    if dis//disv<=t-1:
        print("YES")
        sys.exit()
    if dis%disv==0 and dis/disv<=t:
        print("YES")
        sys.exit()
    print("NO")
    sys.exit()
    
    
    
    
    
    
    


    
    
     

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')
    
    
    
    

    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

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

if A > B:
  T = -T

posA = A + V*T
posB = B + W*T


if T <= 0:
  if posA <= posB:
    print('YES')
  else:
    print('NO')
else:
  if posA >= posB:
    print('YES')
  else:
    print('NO')

Solution (Python):
def LI():
    return list(map(int, input().split()))

a, v = LI()
b, w = LI()
t = int(input())

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

kyori = max(A-B, B-A)

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

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

x=b-a
if x<0:
    x= -x
y=v-w

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

dist = max(a, b) - min(a, b)
chase = v * t - w * t   


if w >= v:
    ans = 'NO'
else:
    if dist <= chase:
        ans = 'YES'
    else:
        ans = 'NO'


print(ans)

Solution (Python):
a_v = input()
b_w = input()
t = input()
t_int = float(t)
a_v_list = a_v.split()
a = a_v_list[0]
a_int = float(a)
v = a_v_list[1]
v_int = float(v)
b_w_list = b_w.split()
b = b_w_list[0]
b_int = float(b)
w = b_w_list[1]
w_int = float(w)
d = abs(a_int-b_int)
if v_int > w_int:
  spd = v_int - w_int
  chacet = d / spd
  if chacet > t_int:
    print("NO")
  else:
    print("YES")
else:
  print("NO")

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (a, v) = [int(e) for e in lines[0].split(' ')]
    (b, w) = [int(e) for e in lines[1].split(' ')]
    (t, ) = [int(e) for e in lines[2].split(' ')]

    return (a, v, b, w, t)


def solve(a, v, b, w, t):
    

    x = v - w
    if a < b and x > 0 and t * x >= b - a:
        result = 'YES'
    elif b < a and x > 0 and t * x >= a - b:
        result = 'YES'
    else:
        result = 'NO'

    return result    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

if v*t - 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())  

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

Solution (Python):
input1 = list(map(int, input().split()))
input2 = list(map(int, input().split()))
T = int(input())
A = input1[0]
V = input1[1]
B = input2[0]
W = input2[1]





if W >= V:
    catch = False
else:
    if abs(B-A)/(V-W) <= T:
        catch = True
    else:
        catch = False

print("YES" if catch == True else "NO")

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

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

Solution (Python):






"""Module docstring
"""

import functools
import heapq
import itertools
import logging
import math
import os
import random
import string
import sys
from argparse import ArgumentParser
from collections import defaultdict, deque
from copy import deepcopy
from io import BytesIO, IOBase
from typing import Dict, List, Optional, Set, Tuple


def solve(a: int, v: int, b: int, w: int, t: int) -> bool:
    if w >= v and a != b:
        return False
    if a > b:
        return a - v * t <= b - w * t
    return a + v * t >= b + w * t


def do_job(stdin, stdout):
    "Do the work"
    LOG.debug("Start working")
    
    A, V = map(int, stdin.readline().split())
    B, W = map(int, stdin.readline().split())
    T = int(stdin.readline().strip())
    
    
    
    result = solve(A, V, B, W, T)
    print("YES" if result else "NO", file=stdout)


def print_output(testcase: int, result, stdout) -> None:
    "Formats and print result"
    if result is None:
        result = "IMPOSSIBLE"
    print("Case 
    
    


BUFSIZE = 8192


class FastIO(IOBase):
    
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def configure_log() -> None:
    "Configure the log output"
    log_formatter = logging.Formatter("L%(lineno)d - " "%(message)s")
    handler = logging.StreamHandler(IOWrapper(sys.stderr))
    handler.setFormatter(log_formatter)
    LOG.addHandler(handler)


LOG = None

if not LOG:
    LOG = logging.getLogger("template")
    configure_log()


def main(argv=None):
    "Program wrapper."
    if argv is None:
        argv = sys.argv[1:]
    parser = ArgumentParser()
    parser.add_argument(
        "-v",
        "--verbose",
        dest="verbose",
        action="store_true",
        default=False,
        help="run as verbose mode",
    )
    args = parser.parse_args(argv)
    if args.verbose:
        LOG.setLevel(logging.DEBUG)
    stdin = IOWrapper(sys.stdin)
    stdout = IOWrapper(sys.stdout)
    do_job(stdin, stdout)
    stdout.flush()
    for h in LOG.handlers:
        h.flush()
    return 0


if __name__ == "__main__":
    sys.exit(main())

Solution (Python):
import numpy as np
a,v = map(int,input(). split ())
b,w = map(int,input(). split ())
T = int(input())

dis = abs(a-b)
dif = v-w
temp = dif*T
if temp >= dis:
    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 (V-W)*T>=B-A:
    print("YES")
elif A>B and (V-W)*T>=A-B:
    print("YES")
else:
    print("NO")

Solution (Python):
def funct(a, b, v, w, t):
    x = abs(a - b)
    s = v - w
    if(s <= 0): return False
    else:
        if(x // (v - w) < t or (x % (v - w) == 0 and x // (v - w) <= t)):
            return True
        else:   return False    
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if(funct(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 B > A and A+V*T >= B+W*T:
  print('YES')
elif B < A and A-V*T <= B-W*T:
  print('YES')
else:
  print('NO')

Solution (Python):
s = input().split()
A = int(s[0]) 
V = int(s[1]) 
s = input().split()
B = int(s[0]) 
W = int(s[1]) 
T = int(input())

AB = abs(A-B)
speed_dif = V - W

if AB == 0:
    print("YES")
elif speed_dif <= 0:
    print("NO")
else:
    time = AB / speed_dif
    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 abs(b - a) + t * (abs(w) - abs(v)) > 0:
    print("NO")
else:
    print("YES")

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

if A > B:
    if T*(V-W) >= A - B:
        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())

flag = False
if a < b:
    l1 = a + v * t
    l2 = b + w * t
    if l1 >= l2:
        flag = True
else:
    l1 = a + (v * -1) * t
    l2 = b + (w * -1) * t
    if l1 <= l2:
        flag = True
print("YES" if flag else "NO")

Solution (Python):
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)


def dump_impl(*objects):
    print(*objects, file=sys.stderr)


def dump_dummy(*objects):
    pass


dump = dump_impl if "DEBUG" in sys.argv else dump_dummy

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

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

Solution (Python):
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if(V<=W):
    print("NO")
else:
    if((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:
    dis = b - a
else:
    dis = a - b

dif = v-w

if w > v:
    print("NO")
elif dis <= dif*t:
    print("YES")
else:
    print("NO")

Solution (Python):
from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, factorial
from itertools import permutations, combinations, combinations_with_replacement
from operator import mul
from functools import reduce
import bisect

MOD = 10**9 + 7
INF = float('inf')

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

dist = abs(A-B)
vel = (V-W)*T

if dist <= vel:
    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):


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

length = abs(a-b)
diff = (v-w)*t

if length <= diff:
    print('YES')
else:
    print('NO')

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

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

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