Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.

The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.

If Takahashi will win, print Yes; if he will lose, print No.

Constraints

1 \leq A,B,C,D \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

If Takahashi will win, print Yes; if he will lose, print No.

Sample Input 1

10 9 10 10

Sample Output 1

No

First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.

Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.

Takahashi's monster is the first to have 0 or less health, so Takahashi loses.

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Wrong Answer

Solution code:
# Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a,b,c,d = MAP()

if(a+b>=c+d):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())

for i in range(10**10):
    c = c-b
    if c<=0:
        print("Yse")
        break
    a = a-d
    if a<=0:
        print("No")
        break

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

while True:
    C = C - A

    if C < 0:
        print('Yes')
        break

    B = B - D

    if B < 0:
        print('No')
        break

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())

e=a//d
f=c//b

if e+1>=f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

ans = 'Yes'
while True:
    # 高橋くんのターン
    D -= A
    if D < 0:
        break

    # 青木くんのターン
    B -= C
    if B < 0:
        ans = 'No'
        break

print(ans)

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
if  a+b>c+d:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

while True:
  D -= B
  if D > 0:
    A -= C
    if A <= 0:
      print("No")
      exit()
  else:
    print("Yes")
    exit()

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
amari = lambda x,y:1 if x%y != 1 else 0 
killaoki = C//B + amari(C,B)
killtakahashi = A//D + amari(A,D)
ans = lambda x,y:"Yes" if x>=y else "No"
print(ans(killaoki,killtakahashi))

Submission status: Wrong Answer

Solution code:
power = list(map(int, input().split()))
t = 100
a = 100
for p in power:
  if p%2 == 0:
    a -= p
    if a <=0:
      print("Yes")
  else:
    t -= p
    if t <= 0:
      print("No")

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
if a[0]+a[1] <= a[2] + a[3]:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
def main():
	a,b,c,d = map(int,input().split())
	i = 0
	while a - i*d > 0 or c - i*b > 0:
		i += 1
		a = a - i*d
		c = c - i*b
		if a == c == 0:
			print("Yes")
		elif c <= 0:
			print("Yes")
		elif a <= 0:
			print("No")

	

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

takahashi = A // D
if A % D != 0:
    takahashi += 1
aoki = C // B
if C % B != 0:
    aoki += 1
    
if takahashi <= aoki:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
    '''
    一つの整数
    '''
    return int(input())
def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))
def inpl_str():
    '''
    一行に複数の文字
    '''
    return list(input().split())

a, b, c, d = inpl()

i = math.ceil(a / d)
j = math.ceil(b / c)
if i >= j:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
print("Yes") if D//A + 1 <= C//B + 1 else print("No")

Submission status: Wrong Answer

Solution code:
a, b, c, d= map(int, input().split())

if a-b< c-d:
    print("No")
else:
    print("yes")

Submission status: Wrong Answer

Solution code:
import math


a, b, c, d = map(int, input().split())
#arr - list(map(int, input().split()))
#s = input()

i = 0
while a:
	if i % 2 == 0:
		c -= b
	else:
		a -= d
	if c <= 0 or a <= 0:
		break
	i += 1
print('Yes' if a else 'No')

Submission status: Wrong Answer

Solution code:
import math
a,b,c,d =map(int,input().split())

if math.ceil(a/b) >= math.ceil(c/d):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
if (D + B - 1) // B < (A + D - 1) // D:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())

while a > 0 and c > 0:
    a -= d
    c -= b
print("No" if a == 0 else "Yes")

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
takahashi = a//d if a%d ==0 else a//d+1
aoki = c//b if c//b ==0 else a//d+1
if takahashi >= aoki :
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    for i in range(100):
        if i % 2 == 0:
            C -= B
        else:
            A -= D
        if A < 1 or C < 1:
            if i % 2 == 0:
                print('Yes')
            else:
                print('No')
            exit()


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
print('Yes' if a/d <= c/b else 'No')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

if C//B > A//D:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())

# A,C 体力
# B,D 攻撃

while True:
    C -= B
    if C <= 0:
        print('YES')
        break
    A -= D
    if A <= 0:
        print('NO')
        break

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
for i in range(max(A,C)):
  if i%2 == 0:
    C = C - B
  else:
    A = A - D
  if C <= 0 or A <= 0:
    break
if C <= 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
if C//B <= A//D:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
#N=int(input())
#A = list(map(int,input().split()))
#S=str(input())
flag=True
while flag==True:
    C-=B
    if C<0:
        print('Yes')
        exit()
    A-=D
    if A<0:
        print('No')
        exit()

Submission status: Wrong Answer

Solution code:
import math
a,b,c,d = map(int,input().split())

t = math.ceil(c/b)
o = math.ceil(a/d)

print(t,o)

if t <= o:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if(a + b >= c + d):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
a=max(a,b)
c=max(c,d)
if a>=c:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int,input().split())

i = 1
while i > 0:
  C -= B
  A -= B
  if (C <= 0 and A > 0) or (C <= 0 and A <= 0):
  	print('Yes')
  	break
  else:
  	print('No')
  	break

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int,input().split())
if A//D > C//B:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split(" "))
res = "Yes"
while True:
    c = c - a
    if c <= 0:
        res = "No"
        break
    a = c - a
    if a <= 0:
        break
print(res)

Submission status: Wrong Answer

Solution code:
import math
a,b,c,d=map(int,input().split())
print('Yes' if math.ceil(c/b)+1>math.ceil(a/d) else 'No')

Submission status: Wrong Answer

Solution code:
#N = int(input())
l = [int(x) for x in input().split()]
while True:
    l[2] = l[2] - l[1]
    if l[2] <= 0:
        print("Yes")
        break
    l[0] = l[0] ^ l[3]
    if l[0] <= 0:
        print("No")
        break

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())

if a+b>=c+d:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
i = 0
while a>0 and d>0:
    if i%2==0:
        d -= b
    else:
        a -= c
    i += 1

if d<=0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:

import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate
import sys
import bisect

sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))

# ----------

A, B, C, D = mii()

takahasi = True
while A > 0 and C > 0:
    if takahasi:
        C -= B
    else:
        A -= D
    takahasi = not takahasi

if A:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
while a>0 and d>0:
    d -= b
    if(d<=0):
        print("Yes")
        break
    a -= c
    if(a<=0):
        print("No")
        break

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())
t = a // d + 1
k = c // b + 1
if t < k:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D = list(map(int, input().split()))

if A // D <= C // B:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
import math

a , b , c , d = map(int,input().split())

time = c / b
w = c % b 
if w != 0:
    time += 1

if a - ( (time-1)*d) > 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())

if a - b < c -d or a - b == 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())
turn = 0
while a > 0 or c > 0:
  if turn%2 == 0:
    c -= b
  else:
    a -= d
  turn += 1
print('Yes' if a > 0 else 'No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if a//d == c//b:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
#import math
#def main(S, b):
if __name__ == '__main__':
    a, b, c, d = map(int, input().split())

    # a = list(map(int, input().split()))

    # s = sum(a)

    for i in range(100):
        if (b * i >= c):
            print("Yes")
            exit()
        if (d * i >= a):
            print("No")
            exit()

    #print(n * 2 * pi)

Submission status: Wrong Answer

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())

"""========main code==============="""

a,b,c,d=ml()
i=0
while(a>0 and c>0):
    if(i%2==0):
        c-=b
    else:
        a-=d
    i+=1    
if(a==0):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
a,b, c, d = map(int,input().split())

t = 0
while a>0 and c>0:
  if t%2==0:
    c-=b
  else:
    a-=d
print("Yes" if c<=0 else "No")

Submission status: Wrong Answer

Solution code:
a,b,c,d= map(int, input().split())
e=a//d
f=c//b
if a%d!=0:
  e+=1
if c%b!=0:
  f+=1
if e<=f:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from math import ceil
A, B, C, D = map(int, input().split())
Takahashi = ceil(A/D)
Aoki = ceil(C/D)
if Takahashi >= Aoki:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
def main():
    A, B, C, D = map(int,input().split())

    if (C//B + C%B) <= (A//D + A%D):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

def main():
    a,b,c,d = map(int, input().split())
    aa = ceil(a/d)
    bb = ceil(c/b)
    ab = aa+bb
    if ab%2==0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
A, B, C, D = [int(x) for x in input().split()]
s = C // B
t = A // D
if s <= t:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d = list(map(int,input().split()))
if a+b > c+d:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C,D = [int(v) for v in input().split()]

t_flag = True

while True:
    if A < 0:
        t_flag = True
        break

    C -= B

    if C < 0:
        t_flag = False
        break

    A -= D

if t_flag:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("YES")
no = lambda: print("NO")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
a,b,c,d = MI()
if a>c:
	yes()
elif a == c:
	if b>d:
		yes()
	else:
		no()
else:
	no()

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
print("Yes" if   d//a <=b//c  else "No")

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
print('Yes'if a%d>c%b else 'No')

Submission status: Wrong Answer

Solution code:
from math import floor
A, B, C, D = map(int,input().split())
if floor(D / A) <= floor(B / C): print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
import math

if math.ceil(c/b)>=math.ceil(a/d):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
tak = - (-C//B)
oak = -(-D//A)
if tak <= oak:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=[int(i) for i in input().split(' ')]
print('Yes') if a+b >= c+d else print('No')

Submission status: Wrong Answer

Solution code:
import sys
import math
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
YES = lambda boolean: print('YES') if boolean else print('NO')
aint = lambda: int(input())
ints = lambda: list(map(int, input().split()))
is_even = lambda x: True if x%2==0 else False

a,b,c,d = ints()
Yes(math.ceil(a/d)>math.ceil(c/b))

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

tmp1 = C / B
tmp2 = A / D

if tmp1 <= tmp2+1 :
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())
while True:
  a -= d
  if a <= 0:
    print('No')
    break
  c -= b
  if c <= 0:
    print('Yes')
    break

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if a * b <= c * d : print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())

for i in range(10000):
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if B <= 0:
        print("No")
        break

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())

if a+b >= c+d:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
tak=-(-a//d)
aoki=-(-c//d)
if tak<=aoki:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？


a,b,c,d=mii()
cnt=0
while a>0 and c>0:
    if cnt%2==0:
        c-=b
    else:
        a-=d

if a>c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#b
A,B,C,D=map(int,input().split())
if (A//D)<=(B//C):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=(int(i) for i in input().split())
while(a>0 and c>0):
  c-=b
  if(c==0):
    break
  a-=d
  if(a==0):
    break
if(a>0):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int,input().split())

while True:
    a -= d
    c -= b
    if a <= 0:
        print('No')
        break
    else:
        print('Yes')
        break

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
if A//D >= C//B:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())
while True:
  a -= d
  if a <= 0:
    print('No')
    break
  c -= b
  if b <= 0:
    print('Yes')
    break

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
print('Yes' if b // a >= d // c else 'No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
turn = 0
while a >= 0 and c >= 0:
    if turn == 0:
        c -= b
    else:
        a -= d
    turn ^= 1

print('Yes' if turn == 0 else 'No')

Submission status: Wrong Answer

Solution code:
from math import ceil
A, B, C, D = map(int,input().split())
t = ceil(C / A)
a = ceil(A / D)
if t <= a:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
A, B, C, D = map(int, input().split())
taka = math.ceil(C / B)
aoki = math.ceil(A / D)
print('Yes' if taka == aoki else 'No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())

if c % b > a % d:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
A,B,C,D = [int(_n) for _n in input().split()]
taka = C / B + (0 if C % B == 0 else 1)
aoki = A / D + (0 if A % D == 0 else 1)
print("Yes" if taka <= aoki else "No")

Submission status: Wrong Answer

Solution code:
a,b,c,d = list(map(int,input().split()))
if a+b > c+d:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
# ABC164 B

def main():
    a, b, c, d = map(int, input().split())

    if a - d >= c - b:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
i = 0
while a > 0 and c > 0:
  if i % 2 == 0:
    c -= b
  else:
    a -= d
if a <= 0:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print("Yes")
        exit()
    A -= D
    if A < 0:
        print("No")
        exit()

Submission status: Wrong Answer

Solution code:
def resolve():
	a, b, c, d = map(int, input().split())
	if a - d >= c - b:
		print('Yes')
	else:
		print('No')
resolve()

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())

taka = -(-D//B)
aoki = -(-A//C)

if taka > aoki:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
from math import ceil
a, b, c, d = map(int, input().split())
if ceil(a/d) >= ceil(c/d):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())

while a>0 and d>0:
    d -= b
    a -= c
print("YNeos"[d>0::2])

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())

aoki = 0
if a % d == 0:
    aoki = a // d
else:
    aoki = a // d + 1

takahashi = 0
if c % b == 0:
    takahashi = c // d
else:
    takahashi = c // d + 1

if takahashi <= aoki:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b, c, d = [int(i) for i in input().split()]

x = (d + b - 1) // b
y = (a + c - 1) // c

if x > y:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
a, b, c, d = (int(i) for i in input().split())
takahashi = (c+b) // b
aoki = (d+a) // a
if takahashi <= aoki:
    print("No")
else: print("Yes")

Submission status: Wrong Answer

Solution code:
a, b, c, d = [int(x) for x in input().split()]
while a > 0 or b > 0:
    a -= c
    b -= d
print('Yes' if a < 0 else 'No')

Submission status: Wrong Answer

Solution code:
import sys 
try:
	sys.stdin = open('input.txt', 'r') 
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = sys.stdin.readline
for tt in range(1):
	# n = int(input())
	a,b,c,d = map(int,input().split())
	# l = list(map(int,input().split()))
	if a+b >= c+d:
		print ("Yes")
	else:
		print("No")

Submission status: Wrong Answer

Solution code:
import sys
A,B,C,D = map(int,input().split())

print("No" if A%D < C%B else "Yes")

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
i = 0
while A > 0 and C > 0:
    if i % 2 == 0: C -= B
    else: A -= D
print('Yes' if A > 0 else 'No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？


a,b,c,d=mii()
cnt=0
while a>0 and c>0:
    if cnt%2==0:
        c-=b
    else:
        a-=d

if a>d:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
A, B, C, D = map(int, input().split())
t = 0
while A > 0 and (C > 0):
  if t % 2: A -= D
  else: C -= B
  t += 1
if A: print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int, input().split())
while a<=0 or c<=0:
  c-=b
  a-=d
  if c<=0:
    print('Yes')
    exit()
  elif a<=0:
    print('No')
    exit()

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int,input().split())
while True:
  a -= d
  if a <= 0:
    print('No')
    break
  b -= c
  if b <= 0:
    print('Yes')
    break

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
print('Yes' if a+b >= c+d else 'No')

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c,d = m()

aa = -(-c//b)
cc = -(-a//d)
if aa >= cc:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())

while True:
    A -= B
    if A <= 0:
        print('No')
        break
    C -= D
    if C <= 0:
        print('Yes')
        break

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
t = 0

while a > 0 and c > 0:
    if t % 2 == 0:
        c -= b
    else:
        a -= d
    t += 1

if a == 0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
if A//B <= C//D:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
a,b,c,d = [int(i) for i in input().split()]
while True:
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if d <= 0:
        print("No")
        exit()

Submission status: Wrong Answer

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from bisect import bisect_left
setrecursionlimit(1000000)

INF = int(1e10)
MOD = int(1e9 + 7)

def input():
    return stdin.readline()[:-1]


def main():
    from builtins import int, map
    A, B, C, D = map(int, input().split())
    count = 0
    while True:
        D -= B
        if D <= 0:
            print("Yes")
            exit()
        A -= C
        if A <= 0:
            print("No")
            exit()


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

A, B, C, D = [int(x) for x in input().split()]

if A + B >= C + D:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int,input().split())

while True:
  C -= B
  if C <= 0:
    ans = 'Yes'
    break
  A -= D
  if C <= 0:
    ans = 'No'
    break
print(ans)

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int,input().split())

if a//b >= c//d:
    print("Yes")
else:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
a, b, c, d = map(int, input().split())

t_hp = a
a_hp = c

while t_hp > 0 and a_hp > 0:
    t_hp = a - d
    a_hp = c - b

if a_hp <= 0:
    print('Yes')
else:
    print('No')

Submission status: Time Limit Exceeded

Solution code:
A, B, C, D = map(int, input().split())

while A or C > 0:
    aoki_hitpoint = C - B
    if aoki_hitpoint <= 0:
        print("Yes")
    else:
        C = aoki_hitpoint

    takahashi_hitpoint = A - D
    if takahashi_hitpoint <= 0:
        print("No")
    else:
        A = takahashi_hitpoint

Submission status: Time Limit Exceeded

Solution code:
a, b, c, d = map(int, input().split(' '))

battle_flg = 1

while battle_flg:
  c -= b
  a -= d
  
  if c <= 0:
    print('Yes')
  elif a <= 0:
    print('No')

Submission status: Time Limit Exceeded

Solution code:
def main():
    A, B, C, D = map(int, input().split())

    while True:
        Aoki_health = C-B
        Take_health = A-D
        if Take_health < 1 <= Aoki_health:
            print('No')
            break
        if Take_health >= 1 > Aoki_health:
            print('Yes')
            break


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    A, B, C, D = map(int, input().split())

    while True:
        Aoki_health = C-B
        Take_health = A-D
        if Take_health <= 0 < Aoki_health:
            print('No')
            break
        if Aoki_health <= 0 < Take_health: 
            print('Yes')
            break


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
a,b,c,d=map(int,input().split())
while True:
  c-=b
  if c<=0:
    print('Yes')
  a-=d
  if a<=0:
    print('No')

Submission status: Time Limit Exceeded

Solution code:
a, b, c, d = list(map(int, input().split()))
turn = True
while True:
  if turn:
    c -= b
    if c <= 0:
      print("Yes")
  else:
    a -= d
    if a <= 0:
      print("No")
  turn ^= True

Submission status: Time Limit Exceeded

Solution code:
As,Aa,Bs,Ba = map(int,input().split())
while Aa > 0 and Ba > 0:
  Bs += -Aa
  As += -Ba

if Bs <= 0:
  print('Yes')
else:
  print('No')

Submission status: Time Limit Exceeded

Solution code:
ta,tt,aa,at=map(int,input().split())

while True:
 if at-tt>0:
    at-=tt
 elif at-tt<0:
    print("Yes")
 elif tt-aa>0:
     tt=-aa
 elif tt-aa<0:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
# 164 B

a, b, c, d = map(int, input().split())

while a != 0 or c != 0:
    c = c - b
    if c == 0:
        print("Yes")
        break
    a = a - d
    if a == 0:
        print("No")
        break