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:
    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 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 = list(map(int, input().split()))
b = list(map(int, input().split()))
t = int(input())
count = 0
for i in range(1, t+1):
  if (a[0]+a[1]*i) == (b[0]+b[1]*i):
    count = 1
    break
if count == 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 0<=A<=B:
    if A+T*V>=B+T*W:
        print('YES')
    else:
        print('NO')
elif A<=0<=B:
    if T*V+A+A>=B+T*W:
        print('YES')
    else:
        print('NO')
else:
    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())
if abs(B-A)<=T*(V-W):
  print('Yse')
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 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())
if v<=w:
  print('NO')
else:
  if a+v*t>=b+w*t:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = [list(map(int, input().split())) for i in range(2)]
s = int(input())
if (a[0][1] <= a[1][1]):
    print("NO")
    exit()
if (a[1][0] - a[0][0]) /(a[0][1] - a[1][1]) <= s:
    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())

    x = V - W
    c = abs(B - A)
    ans = c - x * T

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

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

Submission status: Wrong Answer

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

ans = "NO"

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

Submission status: Wrong Answer

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

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())

# print(a_now, a_speed, b_now, b_speed, t)

# t秒の間、aとbの移動を繰り返し、座標が同じ場所があればYESで終了、
# 最後まで同じ座標にならなければNO
caught = False
for i in range(t):
  # print("aは{0}, bは{1}".format(a_now, b_now))
  if(a_now == b_now):
    caught = True
    break
  else:
    a_now += a_speed
    b_now += b_speed

    
if(caught):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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


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


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


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


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

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

Submission status: Wrong Answer

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

if V<=W:
 	print("NO")
else:
	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())
AD = A
BW = B
cando = "NO"
for i in range(1, T + 1):
    AD += V
    BW += W
    if AD == BW:
        cando = "YES"
        break
print(cando)

Submission status: Wrong Answer

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

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

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

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

if dist < vel:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

kyori = abs(a - b)
sokudo = abs(v-w)

if ((a > b and v < w) or (a < b and v > w)) and kyori < t * sokudo:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

import sys
import math


debug = False

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

def parse_input(lines_as_string = None):

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

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

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


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

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

    return result    


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

if __name__ == '__main__':

    main()

Submission status: Wrong Answer

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

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

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

flag = False
for i in range(t+1):
    if v*i-w*i ==b-a:
        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())
for i in range(1, t+1):
    b += w
    if a - v <= b <= a + v:
        print('YES')
        exit()
    a += v
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:
    if (b - a) % (v - w) != 0:
      print("NO")
    elif (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())
sa = W-V
if sa == 0:
    if A != B:
        print('NO')
    else:
        print('YES')
    exit()
if W>V:
    print('NO')
    exit()
if (abs(B-A)/(W-V)) <= T:
    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())
dist=b-a
speed=v-w
if speed<=0:
    print("NO")
    sys.exit()
if dist/speed<=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+v*t-b-w*t

if c<0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

position_diff = b-a
pace_diff = v-w

if pace_diff < 0:
    print('NO')
elif pace_diff * t > position_diff:
    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(0)

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

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

Submission status: Wrong Answer

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

lon = abs(a[0]-b[0])
if a[1]*T - b[1]*T >= lon :
    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 = B-A
v = V-W
v2 = v*T

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

if (w - v) * t >= r:
  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 = V * T + A
b = W * T + B

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

Submission status: Wrong Answer

Solution code:
a = [int(i) for i in input().split()]
b = [int(j) for j in input().split()]
t = int(input())

if (a[0]<b[0]) & (b[1]*t + (b[0]-a[0]) - a[1]*t) < 0:
    print("YES")
elif (a[0]>b[0]) & (b[1]*t + (a[0]-b[0]) - a[1]*t) > 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
ans = "Yes"
if(V>=W):
  ans = "No"
elif(abs(A-B)>T*abs(V-W)):
  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())

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


if x <= 0:
    print("NO")
    exit()

if c % x == 0 and c // x <= t:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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


    if(V <=  W):
        print("NO")
    else:
        X = abs(V - W)

        if (abs(A - B) // X <= T) & (abs(A - B) % X == 0):
            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("NO")
else:
    #追いかける距離と追いつく距離のあまりが0か判断
    if abs(b-a)%abs(v-w) == 0:
        #商がt以内だったら
        if abs(b-a)//abs(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 A<B:
    if A+V*T>=B+W*T:
        print("YES")
    else:
        print("NO")
if A>B:
    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)+(v*t)>=abs(b)+(w*t):print("YES")
else:print("NO")

Submission status: Wrong Answer

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

if v == w:
    print("NO")
elif a < b and v <= w:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

A = int(a[0])
V = int(a[1])

b = input().split()

B = int(b[0])
W = int(b[1])

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 v-w <= 0:
    print('NO')
    exit()
print('YES' if (b-a)/(v-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())
av=a+v*t
bv=b+w*t

if a>b:
    if av<=bv:
        print("YES")
    else:
        print("NO")
else:
    if av>=bv:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    A,V=map(int,input().split())
    B,W=map(int,input().split())
    T=int(input())
    y=0
    if W==V:
        if A==B:
            y=1
    else:
        if (A-B)/(V-W)%1==0 and 0<=-(A-B)/(V-W)<=T:
            y=1
    
    if y==1:
        print("YES")
    else:
        print("NO")
    
    
    
if __name__=="__main__":
    main()

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

main()

Submission status: Wrong Answer

Solution code:
# B

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

state_before = A <= B

after_A = A + V * T
after_B = B + W * T

state_after = after_A <= after_B

if state_before ^ state_after:
    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-b
g=v-w
if g<=0:
    print("NO")
    exit()
if c%g==0 and abs(c)<=g*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 = list(map(int, input().split(' ')))
b, w = list(map(int, input().split(' ')))
t = int(input())

if a > b:
    print('NO')
    exit()

if w > v:
    print('NO')
    exit()

catchup_speed = v - w
start_dis = b - a

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

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

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

Submission status: Wrong Answer

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

    if A < B :
        pos_b = min(B + W*T, 10**9)
        pos_a = A + V*T
        if pos_a >= pos_b:
            print("YES")
        else:
            print("NO")

    else:
        pos_b = max(B - W*T, (-10)**9)
        pos_a = A - V*T
        if pos_a <= pos_b:
            print("YES")
        else:
            print("NO")



if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

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

flag = False
for i in range(T):
  if A+V*(i+1) == B+W*(i+1):
    flag = True

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

Submission status: Wrong Answer

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

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

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

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

dist=abs(a-b)
diff_sp=(v-w)
if diff_sp <= 0:
  if dist == 0:
    print("YES")
  else:
    print("NO")
else:
  if diff_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())
L = b - a
s = v - w
if L < 0 or s <= 0 or L/s > t:
    result = "NO"
else:
    result = "YES"
print(result)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import string
import math

a = list(map(int,input().split()))
b = list(map(int,input().split()))
t = int(input())
flg = False
for i in range(t):
    if(a[0] > b[0]):
        a[0] -= a[1]
        b[0] -= b[1]
    else:
        a[0] += a[1]
        b[0] += b[1]
    print(a[0],b[0])
    if(a[0]==b[0]):
        flg = True
        break

if(flg):
    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 abs(a - b) + (w * t) < (v * t):
    print("YES")
else:
    print("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())
# 文字列の入力
#s = input()
#開業されたN個要素を受け付ける
#input_list = [list(map(int, input().split())) for i in range(N)]

#print()

ans = "NO"

for t in range(T):
    #print(t, A, B)
    if A == B:
        ans = "YES"
        break
    elif A > B:
        A = A-V
        B = B-W
    elif A < B:
        A = A+V
        B = B+W

print(ans)

Submission status: Wrong Answer

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

position_A = a + (v * t)
position_B = b + (w * t)

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

kyori=abs(B-A)

idousa=V-W

if idousa>0:
  if kyori % idousa ==0:
    if T>=(kyori//idousa):
      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 W >= V:
  f = False
else:
  t = (B - A) / (V - W)
  if int(t) == t:
    f = True
  else:
    f = False
print("YES" if f else "NO")

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
from decimal import *
# read = sys.stdin.buffer.read
# readline = sys.stdin.buffer.readline
# readlines = sys.stdin.buffer.readlines
input = sys.stdin.readline

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

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