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



Sample input:
1 2
3 1
3


Sample output:
YES

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

l=b-a
k=v-w
if w<v:

    if l/k <=t:
        print('Yes')

    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, v = (int(i) for i in input().split(' '))
b, w = (int(i) for i in input().split(' '))
t = int(input())

l1 = a + v * t
l2 = b + w * t

flag = False
if v >= 0:
    if l1 >= l2:
        flag = True
else:
    if l1 <= l2:
        flag = True
print("YES" if flag else "NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

c = a + (v*t)
d = b + (w*t)

if c >= d:
    print("YES")

else :
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Wrong Answer

Solution code:
grid = []
for i in range(3):
    array = list(map(int, input().strip().split()))
    grid.append(array)
if grid[1][0]-grid[0][0]<(grid[0][1]-grid[1][1])*grid[2][0]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

T = int(input())

d = abs(A - B)

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
b = list(map(int, input().split()))
num = int(input())
c = a[0] - b[0]
d = 0
if a[1] <= b[1]:
  print("NO")
else:
  for i in range(num):
    if c <= a[1] - b[1]:
      print("YES")
      d = 1
      break
    else:
      c -= a[1] - b[1]
  if d == 0:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b, w= map(int,input().split())
t = int(input())
A = a+(t*v)
B = b + (t*w)
if a == b:
    print('YES')
elif b < a:
    A = a+(t*v)
    B = b + (t*w)
    if A <= B:
        print('YES')
    else:
        print('No')
else:
    if B <= A:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())
if a+v*t >= b+w*t and a<b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

d = abs(b - a)
u = v - w

if d == 0:
  print("YES")
elif u <= 0:
  print("NO")
elif d % u != 0:
  print("NO")
elif d // u <= t:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

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

tmp_t = 1
while tmp_t <= t:
    if tmp_t * x == y:
        print('YES')
        sys.exit()
    tmp_t += 1
print('NO')

Submission status: Wrong Answer

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

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

    return 'NO'


print(solve())

Submission status: Wrong Answer

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

eva=False

for t in range(1,T+1):
    if B+W*t==A+V*t:
        eva=True
        break
if eva:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a_dis = t*v
b_dis = abs(a-b) + t*w

if a_dis > b_dis:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if v - w != 0:
  dt = (b - a) // (v - w)
  flag = False
  if 0 <= dt and t >= dt:
    flag = True
    
  print("Yes" if flag else "No")
  
else:
  print("No")

Submission status: Wrong Answer

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

T = int(input())

for i in range(T):
    if (A + i*V) == (B + i*W):
        print("YES")
        break
else:
    print("NO")

Submission status: Wrong Answer

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

if (W-V) == 0:
    print("NO")
elif (A-B) % (V-W) != 0:
    print("NO")
else:
    ans = (A-B)//(V-W)
    #print(ans)
    if 1 <= ans <= T:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
av=a
bw=b
ans='NO'

avt=a+t*v
bwt=b+t*w

if avt>=bwt:
    ans='YES'


print(ans)

Submission status: Wrong Answer

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

dist = b - a
time_dif = v - w

if dist > time_dif*t:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

if B - A == 0:
    print('YES')
    exit()
else:
    if V - W == 0:
        print('NO')
        exit()

if 0 <= (B - A) / (V - W) and (B - A) / (V - W) <= T:
    if (B - A) // (V - W) == (B - A) / (V - W):
        print((B - A) // (V - W))
        print((B - A) / (V - W))
        print('YES')
        exit()

print('NO')

Submission status: Wrong Answer

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

cnt=0
for tt in range(t):
    a_dist=v*tt+a
    b_dist=w*tt+b

    res=b_dist-a_dist
    if res==0:
        cnt=1
        break

if cnt==1:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = "No"

move = v*t - w*t
distance = abs(b - a)

if move > 0 and move >= distance:
    ans = "YES"

print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if  a+b*e>=c+d*e:
  print('YES')  
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
from sys import stdin

a=stdin.readline().split()
A,V=int(a[0]),int(a[1])
b=stdin.readline().split()
B,W=int(b[0]),int(b[1])
T=int(stdin.readline())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

count = 1
a = A + count*V
b = B + count*W
while a != b:
  count += 1
  a = A + count*V
  b = B + count*W
  if count < T:
    continue
  else:
    break

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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
        # for line in sys.stdin:
        #     lines.append(line)
        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 x > 0 and t >= x:
        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()

Submission status: Wrong Answer

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

x = 0
for _ in range(t):
  a += v
  b += w
  if a == b:
    x += 1
    break
  if a > b:
    break
    
if x == 1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
A,V=list(map(int,input().split(' ')))
B,W=list(map(int,input().split(' ')))
T=int(input())
if A+T*V>= B+T*W and A<B:
    print('YES')
    exit()
if A+T*V == B+T*W:
    print('YES')
    exit()
if A+T*V> B+T*W and A>B:
    print('NO')
    exit()
else:
    print('NO')
    exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
Oni = input().split(" ")
A = int(Oni[0])
V = int(Oni[1])
child = input().split(" ")
B = int(child[0])
W = int(child[1])
T = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

d = b - a
dv = v - w

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

Submission status: Wrong Answer

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
if v > w and v != w:
    c = abs(abs(b) - abs(a))/ abs(v-w)
else:
    c = 10**20
if int(c) <= t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for t in range(T+1):
    if A == B:
        print('YES')
        break
    A+=V
    B+=W
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
tmp1 = a
tmp2 = b
for _ in range(t):
    tmp1 += v
    tmp2 += w
    if tmp1 >= tmp2:
        print('YES')
        exit()
print('NO')

Submission status: Wrong Answer

Solution code:
input_a = input().split()
a = int(input_a[0])
v = int(input_a[1])
input_b = input().split()
b = int(input_b[0])
w = int(input_b[1])
t = int(input())

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

if relative_velocity <= 0:
    print("NO")
elif  distance / relative_velocity < t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a_len = a 
b_len = b
if a_len >= b_len:
    print('Yes')
for i in range(1,t+1):
    a_len += v 
    b_len += w
    if a_len >= b_len:
        print('Yes')
        exit()
print('No')

Submission status: Wrong Answer

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

for t in range(T):
    if (B-A) <= (V-W)*T:
        print('YES')
        exit()
print('NO')

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
b = list(map(int,input().split()))
T = int(input())

lon = abs(a[0]-b[0])
if (b[1]*T+lon) - a[1]*T <= 0 :
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    if v == w:
        print('NO')
        return 0
    elif abs((a-b)/(v-w)) <= t:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
class A:

    def solve(self):
        name = input()
        print(name[:3])

class B:

    def solve(self):
        [a, v] = [int(x) for x in input().split(" ")]
        [b, w] = [int(x) for x in input().split(" ")]
        t = int(input())

        a_end = a + t * v
        b_end = b + t * w

        if a_end >= b_end:
            print("YES")
        else:
            print("NO")

B().solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
res = False
A = A + V*T
B = B + W*T
if A >= B:
        res = True
if res:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

ret1 = A + V * T
ret2 = B + W * T

if ret1 >= ret2:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
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 >= B-A:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if w >= v:
    print('N0')
    exit()

tmp = b - a
tiji = v -w
for _ in range(t):
    tmp -= tiji
    if tmp == 0:
        print("YES")
        exit()

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())

    if w>= v:
        print("NO")
    else:
        flag = False
        if a == b:
            flag = True

        for i in range(t):
            if b>a:
                a+=v
                b+=w
            else:
                a-=v
                b-=w
            if a==b or flag == True:
                flag=True
                break
        if flag:
            print("YES")
        else:
            print("NO")

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections

def solve(A,V,B,W,T):
    oni = A + T * V
    es = B + T * W
    return "YES" if(oni >= es) else "NO"
def main():
    A,V = map(int,input().split())
    B,W = map(int,input().split())
    T = int(input())
    # solve()
    print(solve(A,V,B,W,T))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

coordinate_ab = b-a
speed_ab = w-v

if coordinate_ab < speed_ab * t:
  print("YES")
else:print("NO")

Submission status: Wrong Answer

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

diff = A - B
if diff > 0:
    diff_v = W - V
else:
    diff *= -1
    diff_v = V - W

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

if diff % diff_v == 0 and diff // diff_v <= T:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

	x=(b-d)
	d=c-a
	if(x==0):
		if(a==c):
			print("YES")
		else:
			print("NO")
	elif(d/x<=t):
		print("YES")
	else:
		print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for second in range(1, t):
    if a + second*v == b + second*w:
        flag = True
        break
if flag:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v =map(int, input().split())
b,w =map(int, input().split())
t=int(input())
if v > w:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a, v = (int(i) for i in input().split(' '))
b, w = (int(i) for i in input().split(' '))
t = int(input())

l1 = a + v * t
l2 = b + w * t

flag = False
if v >= 0:
    if l1 >= l2:
        flag = True
else:
    if l1 <= l2:
        flag = True
print("Yes" if flag else "No")

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))  # 入力のときに N を使う必要はありません
B, W = list(map(int, input().split()))  # 入力のときに N を使う必要はありません
T = int(input())  # 入力のときに N を使う必要はありません

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

d = B - A
s = (V - W) * T

print(d,s)
if d <= s:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if a >= b:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if V * T + A >= W * T + B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
flag=0
if w-v<0:
    if abs(a-b) <= t*abs(v-w):
        flag=1
if flag==1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if v<=w or a>b:
  print("NO")
  exit()
  
if (b-a)%(v-w)==0 and (b-a)/(v-w)<=t:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# import numpy as np
sys.setrecursionlimit(int(pow(10,6)))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


# @lru_cache(None)
a,v=l()
b,u=l()
t=l()[0]
if(b>a):
    rel=v-u
    if(rel<=0):
        print("NO")
        exit()
    else:
        if((b-a)/rel<=t):
            print("YES")
            exit()
        else:
            print("NO")
elif(b==a):
    print("YES")
else:
    rel=u-v
    if(rel<=0):
        print("NO")
        exit()
    else:
        if((a-b)/rel<=t):
            print("YES")
            exit()
        else:
            print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
l = abs(a - b)
u = abs(v - w)
#print(l)
#print(u*t)
if l > u * t:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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