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):
  print("NO")
else:
  x = (B-A)/(V-W)
  print(x)
  if(x <= T and int(x)==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())

if v < w and a >= b:
    print("YES")
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())
if W >= V:
  f = False
else:
  t = (B - A) / (V - W)
  s = (B - A) // (V - W)
  if s == t and t <= T:
    f = True
  else:
    f = False

print("YES" if f else "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 V-W !=0 and 0<D/(V-W)<T:
  print("YES")
elif 10**9-A<V*T and A<B:
  print("YES")
elif abs(-10**9-A)<V*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())

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

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

Submission status: Wrong Answer

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

a,v = LI()
b,w = LI()
T = I()

low = 0
high = T

while(low <= high):
    mid = (low + high) // 2
    val = b - a + (w-v)*mid
    if(val == 0):
        print('YES')
        break
        
    elif(val > 0):
        low = mid + 1
    else:
        high = mid - 1

if(val != 0):
    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 == b:
    print('NO')
    exit()
elif b > a:
    if v <= w:
        print('NO')
        exit()

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

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

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

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
        l = abs(a-b)
        s = abs(v-w)
        if l == 0:
            flag = True

        for i in range(t):
            l = abs(l- s)
            if l == 0:
                flag = True
        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())
x = abs(b-a)
y = (w-v)*t
if(x>=y):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def iput(): return int(input())
def mput(): return map(int, input().split())
def lput(): return list(map(int, input().split()))

def solve():
    a, v = mput()
    b, w = mput()
    t = iput()
    bit = 0
    if a == b:
        bit = 1
    huga = abs(a - b) / abs(v + w)
    if b > a:
        if v > w:
            if ((b-a)/(v-w))%1 == 0 and t >= ((b-a)/(v-w)) >= 0:
                bit = 1
    else:
        if w > v:
            if ((a-b)/(w-v))%1 == 0 and t >= ((a-b)/(w-v)) >= 0:
                bit = 1
    if huga % 1 == 0 and t >= huga >= 0:
        bit = 1
    if bit == 1:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:

from decimal import *
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()
    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())

def solve(A, B, V, W, T):
    la = A+V*T
    lb = B+W*T
    if A<B :
        return la>=lb
    else:
        return lb>=la



A, V = rrm()
B, W = rrm()
T = rri()
ans = solve(A, B, V, W, T)
if 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())

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

if a >= b and b_2 >= a_2:
  print("YES")
  exit()
elif b >= a and a_2 >= b_2:
  print("YES")   
  exit()
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

def main():
  a, v = I()
  b, w = I()
  t = int(input())
  if v <= w:
    print('NO')
  else:
    if abs(a-b) // (v-w) <= t:
      print('YES')
    else:
      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())

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

if v>0 and w>0:
    if oni > nige:
        print("YES")
    else:
        print("NO")
elif v<0 and w<0:
    if oni < nige:
        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 + a) >= (B +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())

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

print("NO")

Submission status: Wrong Answer

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

A += int(1e9)
B += int(1e9)

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

if(a<=v2):
    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()

B = B - A
A = 0

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

Submission status: Wrong Answer

Solution code:
import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections


a,s1=list(map(int,stdin.readline().split()))
b,s2=list(map(int,stdin.readline().split()))
T = int(stdin.readline())

if a+s1*T>=b+s2*T:

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

Submission status: Wrong Answer

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

if a == b:
  print("YES")
else:
  if v == w:
    print("NO")
  else:
    x = (b - a) // (v - w)
    if (b - a) % (v - w) != 0:
      print("NO")
    elif x <= t and x >= 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())

t = 0
while A != B and t < T:
    if A < B:
        A += V
        B += W
    if A > B:
        A -= V
        B -= W
    t += 1

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

n=b-d
m=c-a

if n<=0:
    print('NO')
elif m<(b*e-d*e):
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
AV = input().split()
BW = input().split()
T = input().split()
A = int(AV[0])
V = int(AV[1])
B = int(BW[0])
W = int(BW[1])
T = int(T[0])
if 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())


diff1 = (A - B)
diff2 = (V - W)*T

if ( diff1 < diff2):
  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())

l = b-a
v_l = v-w
if (l <= v_l * t):
  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
    for _ in range(T+1):
        if pA == pB:
            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())


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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")

# https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_B
import sys
sys.setrecursionlimit(1000000)

A,V = map(int,sys.stdin.readline().split())
B,W = map(int,sys.stdin.readline().split())
T = int(sys.stdin.readline().rstrip())

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

def oni(a,b,v,w,t):
    for i in range(t):
        if a+v*i >= b+w*i and a<b:
            return("YES")
    return("NO")

print(oni(a,b,v,w,t))

Submission status: Wrong Answer

Solution code:
from decimal import *
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
getcontext().prec=20
if W==V:
    if (A==B):
        print("YES")
    else:
        print("NO")
else:
    if (Decimal(0)<=Decimal(A-B)/Decimal(W-V)<=Decimal(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())

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2
from fractions import Fraction

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

if w == v:
    if a!=b:
        print('NO')
    else:
        print('YES')

elif w > v:
    if a!=b:
        print('NO')
    else:
        print('YES')
else:
    # w< v
    if a == b:
        print('YES')
    elif a > b:
        ans = (a-b)/(v-w)
        if (a-b)%(v-w) == 0:
            print('YES' if ans <= t else 'NO')
        else:
            print('NO')
    else:
        ans = (a-b)/(w-v)
        if (a-b)%(w-v) == 0:
            print('YES' if ans <= t 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())
if V == W:
    print("NO")
else:
    if abs(B - A) // (V - W) > 0 and abs(B - A) // (V - W) <= T:
        print("YES")
    elif B + W * T >= 10 ** 9 or B - W * T <= -1 * (10 ** 9):
        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 + T * V) >= (B + T * W):
    print("YES")
    exit()

print("NO")

Submission status: Wrong Answer

Solution code:
def tag(a,b,v,w,t):
    it = a+(v*t)
    other = b+(w*t)
    if it >= other:
        return "YES"
    return "NO"

if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    print(tag(a,b,v,w,t))

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
K=int(input())
Apos=A
Bpos=B
count=0
rev=False
if B>A:
    pass
else:
    rev=True

if rev==False:

    
        
    Apos=Apos+V*K
    Bpos=Bpos+W*K
    if Apos>=Bpos:
        print("YES")
        exit()
    
        

else:
    Apos=Apos-V*K
    Bpos=Bpos-W*K
    if Apos>=Bpos:
        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())

oni = a + (v*t)
child = b + (w*t)

if oni >= child:
  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()


if a < b:
    if v < w:
        print('NO')
    else:
        if (b-a) % (v-w) == 0 and 1 <= (b-a) // (v-w) <= t:
            print('YES')
        else:
            print('NO')

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N,S = map(int,input().split())
n,s = map(int,input().split())
T = int(input())


ans1 = N + S*(T -1)
ans2 = n + s*(T -1)

if ans1 - ans2 < s:
  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())
ans="NO"
if v != w and 0 <= abs(a-b)/(v-w) < t and (a-b)%(v-w) == 0:
  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())
c = a + t * v
d = b + t * w
if(a >= b):
  if(c <= d):
    print("YES")
  else:
    print("NO")
else:
  if(c >= d):
    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")
else:
    diff = abs(A-B)
    if V*T - W*T  >diff:
        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('YES')
if a+(b*e)<=c+(d*e):
    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=input().split()
b,w=input().split()
t=int(input())
a=int(a)
v=int(v)
b=int(b)
w=int(w)

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

if __name__ == '__main__':
    main()

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 w <= 0:
        pass
    elif l1 >= l2:
        flag = True
else:
    if w >= 0:
        pass
    elif 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(W>=V or A>=B):
    print('NO')
else:
    velocity = V - W
    distance = B - A
    if(distance>velocity*T):
        print('NO')
    else:
        print('YES')

Submission status: Wrong Answer

Solution code:
A,Av= map(int, input().split())
B,Bv= map(int,input().split())
T = int(input())

if abs(B-A)>(Av-Bv)*T :
  print("No")
else:
  print("Yes")

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

dis = A - B
adis = V*T - W*T

if dis >=  adis:
    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 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")

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

if (W-V) == 0:
    print("NO")
elif (B-A) % (W-V) != 0:
    print("NO")
else:
    ans = abs((B-A)//(W-V))
    #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())
dv = V - W
dist = abs(B - A)
if dv * T > dist:
    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 W >= V:
    print("NO")
else:
    velocity = V - W
    distination = abs(A - B)
    time = math.ceil(velocity / distination)
    # print("time: {}".format(time))
    if T >= time:
        print("YES")
    else:
        if A >= B:
            if B - velocity * T < MIN:
                print("YES")
            else:
                print("NO")
        else:
            if B + velocity * T > MAX:
                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'

if w>v:
    ans='No'
elif w==v:
    if a==b:
        ans='Yes'
    else:
        ans='No'
else:
    for i in range(1,t+1):
        if abs(a-b)==i*abs(v-w):
            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())

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

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

l = b - a
x = v - w
s = t * x

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

else:
    if(l <= 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())

for i in range(1,t + 1):
    at_a = a + v * i
    at_b = b + w * i
    if at_a == at_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())
l = b-a
s = v-w
if s <= 0:
  print('NO')
else:
  if l%s==0:
    if l//s<=t:
      print('YES')
    else:
      print('NO')
  else:
    if l//s+1<=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())

Demon = A
Kid = B
Judge = 0

for i in range(T):
    if Demon < Kid:
        Demon += V
        Kid += W
    
    else:
        Demon -= V
        Kid -= W
    
    if Demon == Kid:
        Judge = 1
        break
    
if Judge == 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())

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

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

Submission status: Wrong Answer

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

  a = int(a) # Oni cordinate
  v = int(v) # Oni Speed
  b = int(b) # Nige Cordinate
  w = int(w) # Nige Speed

  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'

print(method())

Submission status: Wrong Answer

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

dis=abs(b-a)
speed=v-w
if speed==0:
    if dis==0:
        print("YES")
        exit(0)
    else:
        print("No")
        exit(0)


time =dis/speed
#print(time)
if time <0:
    print("NO")

elif time <=t:
    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())

print('Yes' if np.log(a+v*t) >= np.log(b+w*t) else '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 b > a:
    dif = b - a
    if w >= v:
        print("NO")
        sys.exit()
    nowdif = v - w
    for i in range(1,t +1):
        dif -= nowdif
        if dif == 0:
            print("YES")
            sys.exit()

elif b < a:
    dif = a - b
    if v >= w:
        print("NO")
        sys.exit()
    nowdif = w - v
    for i in range(1,t +1):
        dif -= nowdif
        if dif == 0:
            print("YES")
            sys.exit()
else:
    print("YES")
    sys.exit()

print("NO")

Submission status: Wrong Answer

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


diff1 = abs(B - A)
diff2 = (V - W)*T

if ( diff1 < diff2):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

    for i in range(1,t+1):
        if a+v*i == b+w*i:
            return print('YES')
    return 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())

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

Submission status: Wrong Answer

Solution code:
a, x = map(int,input().split())
b, y = map(int,input().split())
t = int(input())

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

Submission status: Wrong Answer

Solution code:
#デフォルト
import itertools
from collections import defaultdict
import collections
import math
import sys
sys.setrecursionlimit(200000)
mod = 1000000007

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

sub = abs(b - a)
if sub == 0:
    print("YES")
else:
    ss = v - w
    if ss < 1:
        print("NO")
    else:
        if sub % ss == 0 or ss % sub == 0:
            if sub / ss <= 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 abs(abs(a)-abs(b)) <= (t*v) - (t*w):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a,b=(int(x) for x in input().split())
c,d=(int(x) for x in input().split())
g=int(input())
f=b-d
e=a-c
if(f*g>e):
    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())

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

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

Submission status: Wrong Answer

Solution code:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

A, V = ri_()
B, W = ri_()
T = ri()
f = abs(A - B) <= abs(V - W) * T
print('YES' if f else 'NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
L = b - a
s = v - w
if L < 0 or s <= 0 or (L/s > t and L % s != 0) or L // s > t:
    result = "NO"
else:
    result = "YES"
print(result)

Submission status: Wrong Answer

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


if a > b and v >= w:
    print("NO")
    exit(0)
elif a < b and v <= w:
    print("NO")
    exit(0)


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

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

Submission status: Wrong Answer

Solution code:
ai, am = map(int, input().split())
bi, bm = map(int, input().split())
tim = int(input())

if am-bm != 0:
    syo, jyoyo = divmod(ai-bi, am-bm)

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