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 V == W or V - W <= 0:
    print("No") 
    
elif abs(A - B) // (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())


for i in range(T):
    if V == W:
        print('NO')
        break
    elif A > B and V > W:
        print('NO')
        break
    elif B > A and W > V:
        print('NO')
        break
            
    elif abs((V-W))*i == abs((B-A)):
        print('YES')
        break

else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
import sys
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

e1=pow(10, -9)
e2=pow(10, 9)

if (a<e1)or(e2<a)or(b<e1)or(e2<b)or(v<1)or(e2<v)or(w<1)or(e2<w)or(t<1)or(e2<t)or(a==b):
    sys.exit(0)

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

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

Submission status: Wrong Answer

Solution code:
import sys
a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(input())
if v-w==0:
  if a==b:
    print("YES")
  else:
    print("NO")
  sys.exit()
temp=(b-a)/(v-w)
if temp<0 or temp>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 v <= w:
    print("No")
elif a < b and a + v*t < b + w*t:
    print("No")
elif a > b and a - v*t > b - w*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())

a = A
b = B

for i in range(1, T + 1, 1):
    a += V
    b += W

    if a == b:
        print("YES")
        break

if (a != b):
    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())
 
for i in range(1,T+1):
    if A < B and V <= W:
        print("NO")
        break;
    d = (B-A)-((V-W)*i)
    if d == 0:
        print("YES")
        break;
    elif (B-A)-((V-W)*(T+1)) == 0:
        print("YES")
        break;
    elif (B-A)-((V-W)*(T+1)) > 0:
        print("NO")

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
k=0
for i in range(t):
  if a+i*v==b+i*w:
    print("YES")
    k=1
    break
  elif (a+i*v-b-i*w)>w+b:
    break
  elif (b+i*w-a-i*w)>v+a:
    break
if k==0:
  print("NO")

Submission status: Wrong Answer

Solution code:
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


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


a, v = invr()
b, w = invr()
t = inp()
if a < 0 and b < 0:
    a = a*-1
    b = b * -1


if abs(v - w) > 0:
    t2 = (a - b) / (w - v)
    if b < a:
        t2 = -(a-b) / (w + v)

    if t2 >= 0 and t2 <= t:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
s1 = input().split()
intA = int(s1[0])
intV = int(s1[1])

s2 = input().split()
intB = int(s2[0])
intW = int(s2[1])

s3 = input().split()
intT = int(s3[0])

if (intW >= intV ) :
    if (intB > intA) :
        print('NO')
        exit()

if (intV >= intW ) :
    if (intA > intB) :
        print('NO')
        exit()

if (intB > intA) :
    if (intV > intW) :
        intDiv1 = abs(intA  - intB)
        intSpd1 = abs(intW - intV)
        if (intDiv1 > intSpd1 * intT) :
            print('NO')
            exit()

if (intA > intB) :
    if (intW > intV) :
        intDiv2 = abs(intB - intA)
        intSpd2 = abs(intV - intW)
        if (intDiv2 > intSpd2 * intT) :
            print('NO')
            exit()
print('YES')

Submission status: Wrong Answer

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

for t in range(1,T+1):
  if A+(V*t) == W*t:
    print("YES")
    exit()
print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
velocity = w-v
dist = b-a
if velocity == 0:
    print('NO')
elif (a < b) and (v < w):
    print('NO')
elif (a>b) and (v>w):
    print('NO')
elif abs(dist) % abs(velocity) == 0 and abs(dist // velocity) <= t :
    print('YES')
else :
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
import sys
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

e1=pow(10, -9)
e2=pow(10, 9)

if (a<e1)or(e2<a)or(b<e1)or(e2<b)or(v<1)or(e2<v)or(w<1)or(e2<w)or(t<1)or(e2<t)or(a==b):
    sys.exit(0)

ab = abs(b-a)-abs(w-v)*t

if ab<=0:
    print("YES")
else :
    print("NO")

Submission status: Wrong Answer

Solution code:
A = input().split()
A_pos = int(A[0])
A_v = int(A[1])

B = input().split()
B_pos = int(B[0])
B_v = int(B[1])

T = int(input())

if(A_v <= B_v):
  print("No")
else:
  dif_v = A_v - B_v
  if(dif_v * T >= B_pos - A_pos):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math

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

if A>B:
    C=A
    A=B
    B=C

if A==B:
    print("YES")
else:

    if V<=W:
        print("NO")
    else:
        x=(1-(A-B)/(V-W))
        xint=math.floor(1-(A-B)/(V-W))
        A=A+(xint-1)*V
        B=B+(xint-1)*W

        if (xint-1)>T:
            print("NO")
        else:
            for i in range (2):
                if A<B:
                    A=A+V
                    B=B+W
                else:
                    A=A-V
                    B=B-W
                if xint-1+i>T:
                    ans=0
                
                    break
                if A==B:
                    ans=1
                    break
                

            print("YES" if ans==1 else "NO")

Submission status: Wrong Answer

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

cnt=0
for tt in range(1,t+1):
    res = (w - v) * tt + (b - a)
    if res == 0:
        cnt=1

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

Submission status: Wrong Answer

Solution code:
import sys

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


dis = 0
if la[0] >= 0 and lb[0] >= 0:
    dis =  abs(la[0] - lb[0])
elif la[0] <= 0 and lb[0] <= 0:
    dis =  abs(la[0] - lb[0])
else:
    dis = abs(la[0])+abs(la[0])

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

Submission status: Wrong Answer

Solution code:
def main():
    A, V = map(int,input().split())
    B, W = map(int,input().split())
    T = int(input())
    if A+V*T < B+W*T:
        print('NO')
        exit(0)
    for a,b in zip(range(A, A+V*T+T, V),range(B, B+W*T+T, W)):
        if a == b:
            print('YES')
            exit(0)
        if a > b:
            print('NO')
            exit(0)
    print('NO')
main()

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+1):
  a = i * V
  b = i * W
  if (A + a) == (B + b):
    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 a<b:
  if v>w:
    c=(b-a)/(v-w)
    if t>=c:
      print('YES')
    else:
      print('NO')
  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):
  ans = t + 1
else:
  ans = (b - a) / (v - w)


if t > ans:
  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")
  exit()
  
amax = a + v*t
amin = a - v*t
bmax = b + w*t
bmin = b - w*t

if amax >= bmax or amin <= bmin:
  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:
    print("NO")
elif V < W:
    if T * (W - V) <= B - A and B - A < 0:
        print("YES")
    else:
        print("NO")
else:
    if 0 < B - A and B - A <= T * (V - W):
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


distance = abs(b-a)

ds = v - w


print(distance)
print(ds)


ans = ""
if (ds * t) < (distance):
  ans = "NO"
else:
  ans = "YES"
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

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

t, mod = divmod((A - B) ,(W - V))
if mod != 0:
    print('NO')
    exit()
if t > T:
    print('NO')
    exit()

print('YES')

Submission status: Wrong Answer

Solution code:
import sys
a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(input())
if v-w==0:
  if a==b:
    print("YES")
  else:
    print("NO")
  sys.exit()
temp=(b-a)/(v-w)
if temp<0 or temp>t or int(temp)!=temp:
  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())
v=V-W
l=B-A
if l>0:
  if l <= v*T:
    if l%v==0:
      print("YES")
  else:
    print("NO")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
import math

def a():
    s = input()
    print(s[:3])


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


def c():
    print('')



def d():
    print('')


b()

Submission status: Wrong Answer

Solution code:
#import math
#import numpy as np
#import torch
#import torch.nn as nn
#import matplotlib.pyplot as plt
#from decimal import Decimal

#N=int(input())
A,V = map(int,input().split())
B,W = map(int,input().split())
T=int(input())
#A = list(map(int,input().split()))
#S=str(input())

if V<=W:
    print('NO')
else:
    L=abs(A-B)
    if L%(V-W)==0:
        if L/(V-W)<=T:
            print('YES')
        else:
            print('NO')
    else:
        c=0
        while T>0:
            T-=1
            c+=1
            L=L+V+W
            if L/(V-W)<=T:
                print('YES')
                exit()
            if V*T<L:
                print('NO')
                exit()
            if c>10**6:
                print('YES')
                exit()

        print('NO')

Submission status: Wrong Answer

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

iter = False
#while iter == False:
if a < b:
  if a + t*v > b + t*w:
    iter =True
 
elif a > b:
  if a - t*v < b - t*w:
    iter = True

elif a == b:
  iter = True
  


if iter == True:
  print("YES")
else:
  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 (v-w) > 0:
        x = (b-a)/(v-w)
    else:
        return 'NO'
    
    if x > 0 and x <= t and x*v + a == x*w + b:
        return 'YES'

    return 'NO'


print(solve())

Submission status: Wrong Answer

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


if a + v * t >= b + 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())

distance = b - a
speed_remainder = v - w

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
oni = list(map(int,input().split()))
child =list(map(int,input().split()))
time = int(input())

if oni[0]<child[0]:
    oni_kyori = oni[0]+oni[1]*time
    child_kyori = child[0]+child[1]*time

    if oni_kyori<child_kyori:
        print('NO')
    else:
        print('YES')
else:
    oni_kyori = oni[0]-oni[1]*time
    child_kyori = child[0]-child[1]*time

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

Submission status: Wrong Answer

Solution code:
import math
import sys
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

e1=pow(10, -9)
e2=pow(10, 9)

if (a<e1)or(e2<a)or(b<e1)or(e2<b)or(v<1)or(e2<v)or(w<1)or(e2<w)or(t<1)or(e2<t)or(a==b):
    sys.exit(0)



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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

if V == W:
    print('No')
    exit()

t, mod = divmod((A - B) ,(W - V))
if mod != 0:
    print('No')
    exit()
if t > T:
    print('No')
    exit()

print('Yes')

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())
-10^9<=a,b<=10^9
1<=v,w<=10^9
1<=t<=10^9
a!=b
x=b-a
y=v-w
if x<=0:
    z=y/-x
else:
    z=y/x
if z<=t:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#import math
#import numpy as np
#import torch
#import torch.nn as nn
#import matplotlib.pyplot as plt
#from decimal import Decimal

#N=int(input())
A,V = map(int,input().split())
B,W = map(int,input().split())
T=int(input())
#A = list(map(int,input().split()))
#S=str(input())

if V<=W:
    print('NO')
else:
    L=abs(A-B)
    if L%(V-W)==0:
        if L/(V-W)<=T:
            print('YES')
        else:
            print('NO')
    else:
        c=0
        while T>0:
            T-=1
            c+=1
            L=L+V+W
            if L/(V-W)<=T:
                print('YES')
                exit()
            if V*T<L:
                print('NO')
                exit()
            if c>10**6:
                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 W-V!=0:
	if (A-B)/(W-V)>0 and (A-B)/(W-V)==(A-B)//(W-V):
		print("YES")
	else:
		print("NO")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
a = input().split(" ")
b = input().split(" ")
c = int(input())
l = int(a[0])
r = int(a[1])
k = int(b[0])
s = int(b[1])
if (l < 0) and (k < l):
    r = -r
    s = -s
if (((r * c) + l) >= ((s * c) + k)):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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


distance = abs(b-a)

ds = v - w


ans = ""
if (ds * t) <= (distance):
  ans = "NO"
else:
  ans = "YES"
print(ans)

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

if A < B and (V-W)*T >= B-A and (B-A) % (V-W) == 0 or A == B:
    print('YES')
elif B > A and (W-V)*T >= B-A and (A-B) % (W-V) == 0:
    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:
    print("NO")
    exit()

md = (B - A) % (W - V) 
if V < W:
    if md == 0 and T * (W - V) <= B - A and B - A <= 0:
        print("YES")
    else:
        print("NO")
else:
    if md == 0 and 0 <= B - A and B - A <= T * (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())
k=0
for i in range(t):
  if a+i*v==b+i*w:
    print("YES")
    k=1
    break
  elif (a+i*v-b-i*w)>w:
    break
  elif b+i*w-a-i*w>v:
    break
if k==0:
  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) <= (V - W) * T :
    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())
 
for i in range(1,T+1):
    if A < B and V <= W:
        print("NO")
        break;
    d = (B-A)-((V-W)*i)
    d2 = (A+V*(i-1))-(B+W*(i-1))
    if d == 0:
        print("YES")
        break;
    elif d < d2:
        print("NO")
        break;

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = int(input())
e = a[1]-b[1]

aa = a[0]+a[1]*c
bb = b[0]+b[1]*c
d = aa-bb
if e == 0 or e <= 0:
  print("NO")
else:
  if aa == bb:
    print("YES")
  elif aa > bb:
    if d % e == 0:
      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 a+v*t >= b+w*t:
  if a < b and w < v and (b-a)%(v-w)==0 and int((a-b)%(w-v)) <= t:
    print("YES")
  elif a > b and w > v and (a-b)%(w-v)==0 and int((a-b)%(w-v)) <= t:
    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())


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

Submission status: Wrong Answer

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


if v < u:
  print('No')
elif a + v * t >= b + u * t :
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math

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

MAX = 10**9
MIN = -(10**9)

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

if (V % 2 == 0) and (W % 2 == 0):
    if abs(A - B) % 2 == 1:
        print("NO")
        exit()

if (V % 2 == 1) and (W % 2 == 1):
    if abs(A - B) % 2 == 0:
        print("NO")
        exit()

if A >= B:
    A_after_T = max(MIN, A-V*T)
    B_after_T = max(MIN, B-W*T)
    if A_after_T <= B_after_T:
        print("YES")
    else:
        print("NO")
else:
    A_after_T = min(MAX, A+V*T)
    B_after_T = min(MAX, B+W*T)
    if A_after_T >= B_after_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())

try:
    print("Yes" if abs(A - B) // (V - W) <= T  and abs(A - B) // (V - W) >= 0 else "No")
except ZeroDivisionError:
    print("No")

Submission status: Wrong Answer

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

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

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

if a < b:
    if at >= bt:
        print('YES')
    else:
        print('NO')
elif a > b:
    if bt >= at:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
def main():
    A,V = [int(x) for x in input().split()]
    B,W = [int(x) for x in input().split()]
    T = int(input())
    pA = A
    pB = B
    if pA > pB:
        print('NO')
        return
    for _ in range(T):
        if pA <= pB and pB+W <= pA+V:
            print('YES')
            return
        pA += V
        pB += W
    print('NO')

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

Ans = [B + W * (i + 1) - A - V * (i + 1) for i in range(T)]

if Ans.count(0) != 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 B<A and B+W*T>=A+V*T:
  print("YES")
elif A<B and 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 a >=0 and b>=0 :

    if a+v*t >= b+ w*t:

        print("YES")
    else:
        print("NO")
elif a <0 and b >=0:

    if -a+v*t >= b + w*t:

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

if abs(a - b) > (v - w) * t:
    print("NO")
    
if abs(a - b) <= (v - w) * t and abs(a - b) % (v - w) == 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 (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 = A-B
B = 0

if A+V*T >= B+W*T:
  for i in range(1,T+1):
    if A+V*i == B+W*i:
      print("YES")
      exit()
  print("NO")
else:
  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 (v-w) > 0:
        x = (b-a)/(v-w)
    else:
        return 'NO'
    
    if x <= t and x*v + a == x*w + b:
        return 'YES'

    return 'NO'


print(solve())

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

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

direct_right = True
A_point = A
B_point = B
for i in range(1,T+1) :
   if direct_right : 
      A_point = A_point+(V) 
      B_point = B_point+(W)
      if A_point == B_point:
         print("YES")
         exit()
      if A_point > B_point:
         direct_right = False
   else: 
      A_point = A_point-(V) 
      B_point = B_point-(W)
      if A_point == B_point:
         print("YES")
         exit()
      if A_point < B_point:
         print("NO")
         exit()

print("NO")

Submission status: Wrong Answer

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

if a == b:
    print('No')
    exit()

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

Submission status: Wrong Answer

Solution code:
a = input().split()
b = input().split()
t = input()

move_a = int(a[1]) * int(t) + int(a[0])
move_b = int(b[1]) * int(t) + int(b[0])

if move_a >= move_b:
    print("YES")
else:
    print("NO")

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('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 V-W == 0:
    print("NO")
    import sys
    sys.exit()
import math
t = math.floor((B-A)/(V-W))
# print("t=",t)
# print("A+Vt=", A+V*t)
# print("B+Wt=", B+W*t)

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

Submission status: Wrong Answer

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

  a_can_plus = min(a + v * t, 10 ** 8)
  a_can_minus = max(a - v * t, -10 ** 8)
  b_can_plus = min(b + w * t, 10 ** 8)
  b_can_minus = max(b - w * t, -10 ** 8)
  # print(a_can_plus)
  # print(a_can_minus)
  # print(b_can_plus)
  # print(b_can_minus)

  if v - w < 0: 
    ans  = False
  elif (v - w) * t >= abs(a - b):
    ans = True
  elif a > b:
    if b_can_minus < a_can_minus:
      ans = False
    else:
      ans = True  
  elif a < b:
    if a_can_plus < b_can_plus:
      ans = False
    else:
      ans = True
      
  if ans:
    print("YES")
  else:
    print("NO")            


main()

Submission status: Wrong Answer

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

if V > W:
    if int(A-B) % int(W-V) == 0:
        if B > A:
            AT = A
            BT = B
            for i in range(T):
                if BT > AT:
                    AT = AT + V 
                    BT = BT + W 
                    
                    if AT == BT:
                        P = "YES"
                        break
                elif AT > BT:
                    AT = AT - V
                    BT = BT - W
                    if AT == BT:
                        P = "YES"
                        break
        if B < A:
            AT = A
            BT = B
            for i in range(T):
                if BT < AT:
                    AT = AT - V
                    BT = BT - W 
                    if AT == BT:
                        P = "YES"
                        break
                elif AT < BT:
                    AT = AT + V
                    BT = BT + W
                    if AT == BT:
                        P = "YES"
                        break
                    
print(P)

Submission status: Wrong Answer

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

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

ret = "NO"
if pos_a >= pos_b:
    ret = "YES"

print("{}".format(ret))

Submission status: Wrong Answer

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