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:
#! python3
# coding:utf-8

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

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

Submission status: Wrong Answer

Solution code:
#! python3
# coding:utf-8

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

for i in range(1,t+1):
    if w > v:
        print("NO")

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

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

a,v=nm()
b,w=nm()
t=ni()

if v<=w:
  print('NO')
  exit()

if abs(b-a)%(v-w)!=0:
  print('NO')
  exit()

if abs((b-a)//(v-w)) > t:
  print('NO')
  exit()

print('YES')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

a,v=nm()
b,w=nm()
t=ni()

if v<=w:
  print('NO')
  exit()

if abs(b-a)%(v-w)!=0:
  print('NO')
  exit()

if abs(b-a)//(v-w) > t:
  print('NO')
  exit()

print('YES')

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

a,v=nm()
b,w=nm()
t=ni()

if v<=w:
  print('NO')
  exit()

if (b-a)%(v-w)!=0:
  print('NO')
  exit()

if(b-a)//(v-w) > t:
  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())
eqa=0
eqb=0
if v <= w:
    print("No")
else:
    eqa= a+(v*t)
    eqb=b+(w*t)
    if eqa < eqb:
        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())
eqa= a+(v*t)
eqb=b+(w*t)
if eqa < eqb:
    print("NO")

else:
    print("YES")

Submission status: Wrong Answer

Solution code:
import sys
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
count= 0
for i in range(1, T+1):
    if i *(V-W) >= B-A: 
        print("YES")
        count +=1
        sys.exit()
    else:
        pass
print("NO")

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
count= 0
for i in range(1, T+1):
    if i *(V-W) >= B-A: 
        print("YES")
        count +=1
        break
    else:
        pass
        
if count == 0:
    print("NO")
else: pass

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:
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:
a,b=map(int, input().split()) 
c,d=map(int, input().split()) 
e=int(input())

if a + b*e >= c + d*e:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
    a, v = map(int, readline().rstrip().split())
    b, w = map(int, readline().rstrip().split())
    t = int(readline().rstrip())
    print('YES' if not(v == w) and (b - a) / (v - w)
          <= t and (b - a) / (v - w) > 0 else '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 abs(a-b)<(v-w)*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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V <= W:
    print("NO")
    sys.exit()



# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

if speed_AB * T < distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()



# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

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

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

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

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

if speed_AB * T >= distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W <= V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(A-B)

if speed_AB * T < distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = (V-W)

if speed_AB * T >= distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = (V-W)

if speed_AB * T <= distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

if speed_AB * T < distance_AB:
    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())

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(A-B)

if speed_AB * T < distance_AB:
    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())

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

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

distance = abs(A-B)
speed = abs(V-W)
if distance <= 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())

if v <= w:
    print('NO')
    exit(0)

n = abs(a - b)
m = abs(v - w)

if n // m <= 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')
    exit(0)
if a == b:
    print('YES')
    exit(0)

n = abs(a - b)
m = v - w
if n // m <= 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')
    exit(0)

n = abs(a - b)
m = v - w
if n // m <= 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')
    exit(0)

n = abs(a - b)
m = abs(v - w)
if n % m == 0:
    if n // m <= t or m // n <= 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 v <= w:
    print('NO')
    exit(0)

n = abs(a - b)
m = abs(v - w)
if n % m == 0:
    if n // m < 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 v <= w:
    print('NO')
    exit(0)

n = abs(a - b)
m = abs(v - w)
if n % m == 0:
    if n // m <= 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 v - w < 0:
    if b <= a:
        print("NO")
    else:
        if 1 <= (b-a)/(v-w) <= t:
            print("YES")
        else:
            print("NO")
elif w == v:
    if a == b:
        print("YES")
    else:
        print("NO")
else:
    if 1 <= (b-a)/(v-w) <= t:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


if v==w:
    if a==b:
        print("YES")
    else:
        print("NO")
else:
    x = (b-a)/(v-w)
    if x.is_integer == False:
        print("NO")
    else:
        if 1 <= 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())

for i in range(t+1):
    if (b-a) == i*(v-w):
        print("YES")
        break
else:
    print("NO")

Submission status: Wrong Answer

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

if 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 B<A:
    print("NO")

else:
    if W>=V:
        print("NO")
    else:
        if (B-A)/(V-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:
  print("No")
else:
  if (max(A, B) - min(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:
  print("No")
else:
  if (max(A, B) - min(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 < B:
    if A+T*V < B+T*W:
        print('NO')
    else:
        print('YES')
else:
    if B-T*W < A-T*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:
    print('YES')
elif A < B:
    if A+T*V < B+T*W:
        print('NO')
    else:
        print('YES')
else:
    if B-T*W < A-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 A < B:
    if A+T*V < B+T*W:
        print('NO')
    else:
        print('YES')
else:
    if B-T*W < A-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 A+T*V < B+T*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 A+T*V < B+T*W:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/tokiomarine2020/tasks/tokiomarine2020_b

"""
   A(V)             B(W)
---------------------------------

"""

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) < 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())
if a <= b:
    print('YNEOS'[a+v*t < b+w*t::2])
else:
    print('YNEOS'[a-v*t >= b-w*t::2])

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('YNEOS'[a+v*t < b+w*t::2])
else:
    print('YNEOS'[a-v*t < b-w*t::2])

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
print('YNEOS'[a+v*t < b+w*t::2])

Submission status: Wrong Answer

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

diff_x = B - A
diff_v = V - W

if diff_v == 0:
    if diff_x == 0:
        print("YES")
    else:
        print("NO")
elif diff_x%diff_v == 0 and 0 < diff_x//diff_v <= T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

last_A = V * T + A
last_B = W * T + B

print('YES' if last_A >= last_B else "NO")

Submission status: Wrong Answer

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

speed = V - W
length = B - A

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

if length <= T * speed:
  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())

speed = V - W
length = B - A

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

if length / speed <= T:
  print('Yes')
else:
  print("No")

Submission status: Wrong Answer

Solution code:
def solve(a, v, b, w, t):
    return "YES" if 0 < (v-w) and abs(b-a) / (v-w) < t else "NO"

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

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)
s = v-w
if s <= 0: print("NO"); exit()

if d % s: print("NO"); exit()
u = d // s

print("YES" if u <= t else "NO")

Submission status: Wrong Answer

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

d = abs(a-b)
s = v-w
if s <= 0: print("NO"); exit()

u = d // s
print("YES" if u <= 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) >= 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) > 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())
if abs((v - w) * t) >= 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())
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 (w - v) * 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 v-w != 0:
    ct, ca = divmod(b-a, v-w)
    if 0<v-w and ca==0 and ct<=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:
    syo, jyoyo = divmod(b-a, v-w)
    print('YNEOS'[not(a==b or (jyoyo == 0 and 0<syo and syo<t))::2])
else:
    if a==b:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

if v-w != 0:
    syo, jyoyo = divmod(b-a, v-w)
    print('YNEOS'[not(jyoyo == 0 and 0<syo and syo<t)::2])
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 < v-w:
    syo, jyoyo = divmod(b-a, v-w)
    print('YNEOS'[jyoyo != 0 or t<syo::2])
else:
    print('NO')

Submission status: Wrong Answer

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

dist = abs(int(a[0])-int(b[0]))
leng = int(int(a[1]) + int(b[1]))

if (dist > leng):
	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:
    t = (B-A)/(V-W)
    if A>B:
        t=-t
    if 0<=t<=T:
        print('Yes')
    else:
        print('No')
else:
    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())
c=0
if A<B:
    for t in range(T+1):
        if V*t+A==W*t+B:
            print('Yes')
            c=1
            break
else:
    for t in range(T+1):
        if V*t-A==W*t-B:
            print('Yes')
            c=1
            break
if c==0:
    print('No')

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
B = b + w * t
A = a + v * t
if(A - B > 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())
B = b + w * t
A = a + v * t
if(A - B >= 0):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
import math
import sys
A,V = map(int, input().split())
B,W = map(int, input().split())
T=int(input())
kyo=abs(A-B)
hay=V-W
if hay<=0 :
    print("NO")
    sys.exit()
if T>=math.floor(kyo/hay) :
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
arr1 = list(map(int,input().strip().split()))
arr2 = list(map(int,input().strip().split()))
time = int(input())
flag = 0

for i in range(time):
  if arr1[0]+arr1[1]*i >= arr2[0]+arr2[1]*i:
    flag += 1
if flag != 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
arr1 = list(map(int,input().strip().split()))
arr2 = list(map(int,input().strip().split()))
time = int(input())

oni = arr1[0]+arr1[1]*time
nige = arr2[0]+arr2[1]*time
print(oni)
print(nige)
if oni >= nige:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
arr1 = list(map(int,input().strip().split()))
arr2 = list(map(int,input().strip().split()))
time = int(input())

oni = arr1[0]+arr1[1]*time
nige = arr2[0]+arr2[1]*time
if oni <= nige:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
arr1 = input().strip().split()
arr2 = input().strip().split()
time = input().strip().split()

if int(arr1[0])+int(arr1[1])*int(time[0]) >= int(arr2[0])+int(arr2[1])*int(time[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())

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

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

Submission status: Wrong Answer

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

    for i in range(T):
        A = A + V
        B = B + W
        if A == B:
            print('YES')
            return
    print('NO')
main()

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      if (d/e).is_integer() == True:
      	print("YES")
      else:
        print("NO")
    else:
      print("NO")
else:
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      if (d/e).is_integer() == True:
      	print("YES")
      else:
        print("NO")
    else:
      print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d:
      print("YES")
    else:
      print("NO")
else:
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d:
      print("YES")
    else:
      print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    elif int(d)/int(e) == d or int(d)/int(e) < d:
      print("YES")
    else:
      print("NO")
elif int(a[0]) < int(b[0]):
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    elif int(d)/int(e) == d or int(d)/int(e) < d:
      print("YES")
    else:
      print("NO")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d:
      print("YES")
    else:
      print("NO")
elif int(a[0]) < int(b[0]):
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d:
      print("YES")
    else:
      print("NO")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
elif int(a[0]) < int(b[0]):
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
elif int(a[0]) < int(b[0]):
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  elif int(a[1]) == int(b[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
else:
  if a[1] == b[1]:
    print("YES")
  else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
elif int(a[0]) < int(b[0]):
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
else:
  if a[1] == b[1]:
    print("YES")
  else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")
else:
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
    else:
      print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
c = input()
a = a.split(" ")
b = b.split(" ")
if int(a[0]) > int(b[0]):
  d = int(a[0]) - int(b[0])
  if int(a[1]) > int(b[1]):
    print("NO")
  else:
    e = int(b[1]) - int(a[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")
else:
  d = int(b[0]) - int(a[0])
  if int(b[1]) > int(a[1]):
    print("NO")
  else:
    e = int(a[1]) - int(b[1])
    if int(e)*int(c) == d or int(e)*int(c) > d:
      print("YES")

Submission status: Wrong Answer

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

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