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:
def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if W-V != 0 and 1 <= (A-B)/(W-V) <= 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())

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

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

Submission status: Wrong Answer

Solution code:
[a,v]=raw_input().split()
[b,w]=raw_input().split()
t=int(raw_input())
if int(a)+int(v)*t>=int(b)+int(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:
  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")

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

distance = b-a
if(distance <= 0):print("YES");exit()
if((distance - (v-w)*t) <= 0):print("YES")
else:print("NO")

Submission status: Wrong Answer

Solution code:
# 幅優先探索（行きがけ）
import collections
import sys


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


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

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

    ans = 'NO'
    if V!=W:
        time = (B-A)/(V-W)
        if 0 <= time <= T:
            ans = 'YES'

    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
R=10**9
L=(-1)*(10**9)
T=int(input())

ans="NO"
if A<B:
    p=min(A+T*V,R)
    q=min(B+T*W,R)
    if p>=q:
        ans="YES"
else:
    p=max(A-T*V,L)
    q=max(B-T*W,L)
    if p<q:
        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 a > b:
    a = a - v * t
    b = a - w * t
    print('YES' if a < b else 'NO')
elif a < b:
    a = a + v * t
    b = a + w * t
    print('YES' if a > b else 'NO')

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
ans2 = n + s*T

if ans1 < ans2:
  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) <= (v-w)*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 w >= v:
    print("NO")
elif abs(b-a) % abs(w-v) != 0:
    print("NO")
elif abs(b-a) % abs(w-v) > t:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

A, V = MAP()
B, W = MAP()
T = INT()


if A + T*V >= B + T*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())
for i in range(t):
    if a+v*i == b+w*i:
        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())
ans = 0
if v == w:
    pass
elif v>w and abs(a-b)//(v-w) <= t :
    ans = 1
print(["No","Yes"][ans])

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return x if y == 0 else gcd(y, x%y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

A, V = LI()
B, W = LI()
T = I()

flag = False

s = abs(A-B)

if s == 0:
    flag = True
else:
    if W >= V:
        flag = False
    else:
        t = V - W

        if T >= t:
            flag = True

YESNO(flag)

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
A,V = [int(x) for x in stdin.readline().rstrip().split()]
B,W = [int(x) for x in stdin.readline().rstrip().split()]
T= int(stdin.readline().rstrip())
ans = False
for i in range(1,T+1):
    if V*i + A == W*i+B:
        ans = True
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())

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

if T*(V-W) >= 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())
result='NO'
for i in range(t):
    if b-a==0:
        result='YES'
    a+=v
    b+=w
print(result)

Submission status: Wrong Answer

Solution code:
oni, oni_spd = list(map(int, input().split()))
child, child_spd = list(map(int, input().split()))
T = int(input())

dist = child - oni
ofs_spd = oni_spd - child_spd

if ofs_spd * T >= dist:
  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 (a-b)<=t*(v-w):
    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:
        if abs(a-b) % abs(v-w) == 0 and 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())

a_max = A + V*T
b_max = B + W*T
if a_max >= b_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())

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

Submission status: Wrong Answer

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,v = mi()
b,w = mi()
t = ii()

dis = abs(a-b)

if dis <= abs(v-w)*1000000000:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

A, V = input_int()
B, W = input_int()

T = one_int()

speed = (V-W)

kyori = (B-A)

if speed*T >= kyori:
    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 = 0

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    a, v = rli()
    b, w = rli()
    t = ri()
    if t*(v-w) >= abs(a-b):
        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())

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

distance = abs(A-B)
speed = V - W

if speed != 0:
    if distance / speed <= 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+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())
x=a+v*t
y=b+w*t
if x>=y:
    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())
sa_sp = W - V
if sa_sp >= 0:
    print("NO")
    exit()
sa_kyo = abs(A-B)
need = sa_kyo / sa_sp
if need <= 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())

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

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

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

Submission status: Wrong Answer

Solution code:
import sys, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby

n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

A, V = nn()
B, W = nn()
T = n1()

if V <= W:
    print("No")
else:
    if (W - V) * T >= abs(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())

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

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

Submission status: Wrong Answer

Solution code:
import sys 
from copy import deepcopy
from collections import deque
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def R(x):
    r = round(x)
    if r+0.5 <= x:
        r += 1
    return r

def main():
    tmp = deque(LI())
    a,v = tmp.popleft(),tmp.popleft()
    tmp = deque(LI())
    b,w = tmp.popleft(),tmp.popleft()
    t = I()
    dist = abs(a-b)
    vect = v-w
    if vect<0:  
        print('NO')
    elif vect == 0 and dist==0:
        print('YES')
    else:
        if dist<vect*t:
            print('YES')
        else:
            print('NO')
    return

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

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

if V <= W:
    if A == B:
        print('YES')
        exit()
    else:
        print('NO')
        exit()
else:
    t = abs(A-B)/V-W
    if T >= 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")
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<=0:
  print("NO")
else:
  if abs(a-b)//(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()))
t = int(input())
aw = a[0]+a[1]*t
bw = b[0]+b[1]*t
if aw >= bw:
  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 (V - W) * T >= (B - A) else 'NO')

Submission status: Wrong Answer

Solution code:
# coding:utf-8
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

for i in range(t):
    A = a + (v * i)
    B = b * (w * i)

    if A == B:
        print('YES')
        exit()

print('NO')

Submission status: Wrong Answer

Solution code:
import math
import itertools
import collections
import bisect
import heapq

def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7

a,v = MAP()
b,w = MAP()
t = IN()

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

if v  * t > w * t + d:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

    if V > W:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
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())
a, v = M()
b, w = M()
t = I()
a_now = a
b_now = b
ans = 'NO'
for i in range(t):
    a_now += v
    b_now += w
    if a_now == b_now:
        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 (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())
av=a+v*t
bw=b+w*t
if av>=bw:
    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 v-w!=0 and (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())

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

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 = [int(_) for _ in input().split()]
B, W = [int(_) for _ in input().split()]
T = int(input())

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

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

flg = False
for i in range(t):
    a = a + v
    b = b + w
    if(a == b):
        flg = True
        break

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

    try:
        need = (b - a) / (v - w)
    except ZeroDivisionError:
        need = 10 ** 10
    if 0 <= need <= 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())
if a+v*t >= b+w*t:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#import math
#=input()
#=int(input())
a,v=map(int,input().split())
b,w=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]
t=int(input())

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

for i in range(T):
    A += V
    B += W
    if A == B:
        print('YES')
        exit(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 v>w:
  if b-a<=(v-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())
ans = "NO"
a += v*t
b += w*t
if a>=b:
    ans = "YES"
print(ans)

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())    
print('YES' if V>W and  abs(B-A)//(V-W) <= T else 'NO')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if abs(a-c)>e*abs(b-d):
  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")
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 W >= V:
    print("NO")
    exit(0)

if (abs(B - A) // abs(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())
def do():
    if w >= v:
        print("NO")
        return 0
    d = abs(a - b)
    x = v - w
    if d % x != 0:
        print("NO")
        return 0

    reachTime = x / d
    if reachTime <= t:
        print("YES")
        return 0
    else:
        print("NO")
        return 0
do()

Submission status: Wrong Answer

Solution code:
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
# import math
from fractions import gcd

MOD = 10 ** 9 + 7
# MOD = 998244353
# sys.setrecursionlimit(10**8)

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
    print("No")
    exit()

dis = t*(v-w)
if dis >= 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())
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_sum = A + V * T
B_sum = B + W * T

if A_sum >= B_sum:
    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(b-a) < (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())
print("NO" if V==W or abs(A-B)/abs(V-W) > T else "YES")

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
if d<=s*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:
    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())
dist=b-a
dist2=(v-w)*t
if dist>dist2:
	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 abs(A-B)- (V-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())
if a > b:
    a,v,b,w = b,w,a,v
x = a+v*t
y = b+w*t
if x<y:
    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())

kyori = B-A
tikaduki = V-W
if T*tikaduki <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 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 (t*w)+b <= (t*v)+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 a == b:
    print('YES')
    exit()

for _ in range(t):
    a += v
    b += w
    if a == b:
        print('YES')
        exit()

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#東京海上日動　プログラミングコンテスト2020 b
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
dis = abs(a-b)
move = abs(w-v)
if dis <= move * 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 t in range(T):
    if A == B:
        print("YES")
        exit()
    elif A < B:
        A += V
        B += W
    else:
        A -= V
        B -= W
    
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 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())

sa=b-a
st=v-w

if sa>st*t:
  print("NO")
else:
  print("YES")