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: Accepted

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

e = a//d + (0 if a%d == 0 else 1)
f = c//b + (0 if c%b == 0 else 1)
print("Yes" if e>=f else "No")

Submission status: Accepted

Solution code:
list = list(map(int, input().split()))
A = list[0]
B = list[1]
C = list[2]
D = list[3]

while A > 0 and B >0:
    C = C - B
    if C <= 0:break
    A = A - D

if A > 0: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
import sys
a,b,c,d=map(int,input().split())
e=max(a//d+1,c//b+1)
for i in range(2*(e+1)):
    if i%2!=0:
        a-=d
        if a<=0:
            print('No')
            sys.exit()
    else:
        c-=b
        if c<=0:
            print('Yes')
            sys.exit()

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def check(a,b,c,d):
	while(a>0 and c>0):
		c-=b
		if(c<=0):
			return 1
		a-=d
		if(a<=0):
			return 0
inp1=list(map(int,input().strip().split()))[:4]
a,b,c,d=inp1[0],inp1[1],inp1[2],inp1[3]
if(check(a,b,c,d)):
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

while(A > 0 and C > 0):
    if att_cnt % 2 == 0:
        C -= B
        att_cnt += 1
    else:
        A -= D
        att_cnt += 1
        
if A <= 0:
    print("No")
if C <= 0:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)


A,B,C,D = nm()
x = (C+B-1)//B
y = (A+D-1)//D

# print(x,y)
if x <= y: 
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if c%b==0:
    taka = c/b
else :
    taka = (c-c%b)/b + 1

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

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

Submission status: Accepted

Solution code:
import numpy as np
if __name__ == "__main__":
    # 入力パターン．
    # 要素の数がわかっているパターン
    ### a,b
    a_hp, a_at, b_hp, b_at = map(int, input().split())
    ans = ''
    # print(a_hp)
    # print(a_at)
    # print(b_hp)
    # print(b_at)
    while True:
        b_hp -= a_at
        #print(b_hp)
        if b_hp <= 0:
            ans = 'Yes'
            break
        a_hp -= b_at
        #print(a_hp)
        if a_hp <= 0:
            ans = 'No'
            break
    
    print(ans)

Submission status: Accepted

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

  for i in range(100):
    C -= B
    if C <= 0:
      print('Yes')
      exit()
    else:
      pass
    A -= D
    if A <= 0:
      print('No')
      exit()
    else:
      pass 

if __name__ == "__main__":
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = "No"

while a > 0:
    a = a - d
    c = c - b
    
    if c <= 0:
        ans = "Yes"
        break


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
while(1):
    C=C-B
    A=A-D
    if C <=0:
        print('Yes')
        break
    if A <=0:
        print('No')
        break

Submission status: Accepted

Solution code:
def main():
    inputs = input().split(' ')
    takahashi_hp = int(inputs[0])
    takahashi_pw = int(inputs[1])
    aoki_hp = int(inputs[2])
    aoki_pw = int(inputs[3])

    flag = True
    cnt = 1
    while flag:
        if cnt % 2 == 1:
            aoki_hp -= takahashi_pw
            if aoki_hp <= 0:
                flag = False
                result = 'Yes'
        
        else:
            takahashi_hp -= aoki_pw
            if takahashi_hp <= 0:
                flag = False
                result = 'No'

        cnt += 1

    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

takahashi = A//D
aoki = C//B
if A % D != 0:
    takahashi += 1
if C % B != 0:
    aoki +=1

if takahashi >= aoki:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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



#死ぬまでの攻撃回数を算出する
takahasi = -(-A // D)
aoki = -(-C // B)

#print(takahasi)
#print(aoki)


if takahasi >= aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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
    i += 1
print("Yes" if i%2 else "No")

Submission status: Accepted

Solution code:
A, B, C, D = (int(x) for x in input().split())
while A > 0 and C > 0:
    C = C - B
    if C <= 0:
        print('Yes')
        break
    A = A - D
    if A <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
import sys
N = list(map(int, input().split()))

while N[0]>0 and N[2]>0:
    N[2] -= N[1]
    if N[2]<1:
        print('Yes')
        sys.exit()
    N[0] -= N[3]
    if N[0]<1:
        print('No')
        sys.exit()

Submission status: Accepted

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

takahashi = math.ceil(c / b)
aoki = math.ceil(a / d)
print("Yes" if takahashi <= aoki else "No")

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().split()))
# A, B, C, D = list(map(int, "46 4 40 5".split()))

while True :

    # Takahashi's trun
    C -= B
    if C <= 0 :
        print("Yes")
        break

    # Aoki's trun
    A -= D
    if A <= 0 :
        print("No")
        break

Submission status: Accepted

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

check = False
while(A > 0 and C > 0):
    C -= B
    if(C <= 0):
        check = True
        print('Yes')
        break
    A -= D

if check == False:
    print('No')

Submission status: Accepted

Solution code:
import math
a,b,c,d = map(int,input().split())
ao_hp = math.ceil(c/b)
taka_hp = math.ceil(a/d)
#(taka_hp,ao_hp)
if(taka_hp > ao_hp):
    print('Yes')
elif(taka_hp < ao_hp):
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
al, aa, bl, ba = map(int, input().split())

if al%ba == 0:
    bn = al//ba
else:
    bn = al//ba + 1

if bl%aa == 0:
    an = bl//aa
else:
    an = bl//aa + 1


if an <= bn:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while True:
    C = C - B
    if C <= 0:
        print('Yes')
        break
    A = A - D
    if A <= 0:
        print('No')
        break

Submission status: Accepted

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 > 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

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

while A > 0 and C > 0:
    C = C - B
    A = A - D
    #print(C, A)

if A <= 0 and C <= 0:
    ans = 'Yes'
elif C <= 0:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

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

TH=a
TA=b
AH=c
AA=d

while(1):
  AH -= TA
  if(AH<=0):
    print("Yes")
    break
  TH -= AA
  if(TH<=0):
    print("No")
    break

Submission status: Accepted

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

takaHP=A
AoHP=C
while takaHP>0:
    AoHP-=B
    if AoHP<=0:
        print("Yes")
        break
    takaHP-=D
    if takaHP<=0:
        print("No")

Submission status: Accepted

Solution code:
A,B,C,D=input().split()
A=int(A)
B=int(B)
C=int(C)
D=int(D)
if (1<=A<=100)and(1<=B<=100)and(1<=C<=100)and(1<=D<=100):
    while (A>0)and(C>0):
        C=C-B
        if C<=0:
            break
        A=A-D
    if C<=0:
        print("Yes")
    if A<=0:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
aoki = c
taka = a
for i in range(max((c // b)+1, (a // d)+1)):
    aoki -= b
    taka -= d
    if aoki <= 0:
        print("Yes")
        break
    elif taka <=0:
        print("No")
        break

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
import sys
for i in range(10000):
    if (c-(b*i))<=0:
        print('Yes')
        sys.exit()
    elif (a-(d*i))<=0:
        print('No')
        sys.exit()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print("No")

Submission status: Accepted

Solution code:
ok=True
i=0
a,b,c,d=map(int,input().split())
k=c//b
c-=b*k
a-=d*(k)
if(a<=0 and c!=0):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

while a > 0 and c > 0:
    if turn == 0:
        c -= b
        turn = 1
    elif turn == 1:
        a -= d
        turn = 0
    else:
        raise RuntimeError('not supported turn')

print('Yes' if a > 0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

index=0
for i in range(1000):
	if index==0:
		c=c-b
		if c<=0:
			print("Yes")
			break
		else:
			index=1
	else:
		a=a-d
		if a<=0:
			print("No")
			break
		else:
			index=0

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while A>0 and C>0:
    C=C-B
    A=A-D
    
    if C<=0:
        print("Yes")
        break
        
    elif A<=0:
        print("No")
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

counttaka=(a-1)//d
countao=(c-1)//b

if counttaka>=countao:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
takaMonHP, takaMonAP, aokiMonHP, aokiMonAP = map(int, input().split())

while True:
    aokiMonHP = aokiMonHP - takaMonAP
    if aokiMonHP <= 0:
        print("Yes")
        break
    takaMonHP = takaMonHP - aokiMonAP
    if takaMonHP <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
Thp,Tatk,Ahp,Aatk = map(int,input().split())
 
import math
 
Ta = math.ceil(Thp/Aatk)
Ao = math.ceil(Ahp/Tatk)

if Ta >= Ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b,c,d = map(int, input().split())
taka=-(-c//b) #高橋君はtaka回で倒せる
ao=-(-a//d) #青木君はao回で倒せる

if taka<=ao:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from itertools import count

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

for i in count():
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print('Yes')
            break
    else:
        a -= d
        if a <= 0:
            print('No')
            break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
th, ta, ah, aa = map(int,input().split())
taeru_takahashi = 0
taeru_aoki = 0
if th%aa==0:
    taeru_takahashi = th//aa
else:
    taeru_takahashi = (th//aa)+1
if ah%ta ==0:
    taeru_aoki = ah//ta
else:
    taeru_aoki = (ah//ta)+1
if taeru_takahashi >= taeru_aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
a,b=0,0
if C%B!=0:
    a=1
if A%D!=0:
    b=1
if C//B+a>A//D+b:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b, c, d = map(int, input().split())
T = [a, b]
A = [c, d]
flagT = 0
flagA = 0
while 1:
    A[0] -= T[1]
    if A[0] <= 0:
        flagA = 1
        break
    T[0] -= A[1]
    if T[0] <= 0:
        flagT = 1
        break
if flagT == 1:
  print("No")
if flagA == 1:
  print("Yes")

Submission status: Accepted

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()
while(a > 0 and c >0):
	c-=b
	if c<=0:
		yes()
		break
	a-=d
	if a<=0:
		no()
		break

Submission status: Accepted

Solution code:
import sys 
import math
try:
    sys.stdin = open('input.txt', 'r') 
    sys.stdout = open('output.txt', 'w')
except:
    pass

input = sys.stdin.readline
ht,st,ha,sa = map(int,input().split())
t = math.ceil(ht/sa)
a = math.ceil(ha/st)
if t>=a:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import math
a,b,c,d = [int(i) for i in input().split()]
if math.ceil(c/b) <= math.ceil(a/d):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while(1):
    c = c - b
    if c <= 0:
        print("Yes")
        break

    a = a - d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# vim: set fileencoding=utf-8

# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation


"""Module docstring
"""

import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from collections import defaultdict, deque
from copy import deepcopy
from typing import Dict, List, Optional, Set, Tuple


def solve(h1: int, s1: int, h2: int, s2: int) -> bool:
    while h1 > 0 and h2 > 0:
        h1 -= s2
        h2 -= s1
        # LOG.debug(("first:", h1, s1))
        # LOG.debug(("second:", h2, s2))
    return h2 <= 0


def do_job():
    "Do the work"
    LOG.debug("Start working")
    # first line is number of test cases
    # N = int(input())
    A, B, C, D = list(map(int, input().split()))
    # values = []
    # for _ in range(N):
    #     values.append(input().split())
    result = solve(A, B, C, D)
    print("Yes" if result else "No")


def print_output(testcase: int, result) -> None:
    "Formats and print result"
    if result is None:
        result = "IMPOSSIBLE"
    print("Case #{}: {}".format(testcase + 1, result))
    # 6 digits float precision {:.6f} (6 is the default value)
    # print("Case #{}: {:f}".format(testcase + 1, result))


def configure_log() -> None:
    "Configure the log output"
    log_formatter = logging.Formatter("%(lineno)d - " "%(message)s")
    handler = logging.StreamHandler(sys.stdout)
    handler.setFormatter(log_formatter)
    LOG.addHandler(handler)


LOG = None
# for interactive call: do not add multiple times the handler
if not LOG:
    LOG = logging.getLogger("template")
    configure_log()


def main(argv=None):
    "Program wrapper."
    if argv is None:
        argv = sys.argv[1:]
    parser = ArgumentParser()
    parser.add_argument(
        "-v",
        "--verbose",
        dest="verbose",
        action="store_true",
        default=False,
        help="run as verbose mode",
    )
    args = parser.parse_args(argv)
    if args.verbose:
        LOG.setLevel(logging.DEBUG)
    do_job()
    return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    sys.exit(main())


class memoized:
    """Decorator that caches a function's return value each time it is called.
    If called later with the same arguments, the cached value is returned, and
    not re-evaluated.
    """

    def __init__(self, func):
        self.func = func
        self.cache = {}

    def __call__(self, *args):
        try:
            return self.cache[args]
        except KeyError:
            value = self.func(*args)
            self.cache[args] = value
            return value
        except TypeError:
            # uncachable -- for instance, passing a list as an argument.
            # Better to not cache than to blow up entirely.
            return self.func(*args)

    def __repr__(self):
        """Return the function's docstring."""
        return self.func.__doc__

    def __get__(self, obj, objtype):
        """Support instance methods."""
        return functools.partial(self.__call__, obj)

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    a, b, c, d = LI()
    while a > 0 and c > 0:
        c -= b
        if c <= 0:
            print('Yes')
            break
        a -= d
        if a <= 0:
            print('No')
    return


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
for i in range(1000):
    if i%2 == 0:
        c = c-b
        if c <= 0:
            print('Yes')
            break
    else:
        a = a-d
        if a <= 0:
            print('No')
            break

Submission status: Accepted

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

takalife = A
takaa = B
aotlife = C
aoa = D

i = 0

while A > 0 and C > 0 :
    if i % 2 == 0: #takahashi attack
        C = C - B
    else:
        A = A - D
    i += 1
if C <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

a, b, c, d = (int(x) for x in input().split())

while 0 <= c or 0 <= c :
    
    c = c - b
    if c <= 0 : 
        ans = 'Yes'
        break

    a = a - d
    if a <= 0 :
        ans = 'No'
        break


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
T_HP,T_ATK,A_HP,A_ATK = map(int, input().strip().split())

while True:
  A_HP -= T_ATK
  if A_HP <= 0:
    print('Yes')
    break
  T_HP -= A_ATK
  if T_HP <= 0:
    print('No')
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
	inp=stdin.readline
	a,b,c,d=map(int, inp().split())
	f=False
	while a>0 and c>0:
		if f:
			a-=d
		else:
			c-=b
		f=not(f)
	if a>0:
		print("Yes")
	else:
		print("No")

main()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
i = 0
while True:
    if i % 2 == 0:
        C -= B
        if C <= 0:
            break
    else:
        A -= D
        if A <= 0:
            break
    i += 1
if i % 2 == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

c = 0

while A > 0 and C > 0:
    if c%2 == 0:
        C -= B
    else:
        A -= D

    c += 1

if A < C:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

while(A>0 and C>0):
    C -= B
    A -= D

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
th, ts, ah, a2 = map(int, input().split())
while th > 0 or ah > 0:
    ah -= ts
    if ah <=0:
        print("Yes")
        exit()
    th -= a2
    if th <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
al=a
cl=c
for i in range(1000):
  cl-=b
  if cl<=0:
    print('Yes')
    break
  al-=d
  if al<=0:
    print('No')
    break

Submission status: Accepted

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

attack_t = C//B
kalan_t = C%B
if kalan_t != 0:
    attack_t += 1

attack_a = A//D
kalan_a = A%D
if kalan_a != 0:
    attack_a += 1

if attack_t <= attack_a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < -(-c//b)::2])

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
for i in range(1000):
    
    c = c-b
    if c>0:
        pass
    else:
        print('Yes')
        break
    a = a-d
    if a>0:
        pass
    else:
        print('No')
        break

Submission status: Accepted

Solution code:
def main():
    a, b, c, d = [int(x) for x in input().split()]
    while 1:
        c -= b
        if not (a > 0 and c > 0):
            break

        a -= d
        if not (a > 0 and c > 0):
            break

    if a > 0:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

if C % B == 0:
  n_t = C//B
else:
  n_t = C//B + 1
  
if A % D == 0:
  n_a = A//D
else:
  n_a = A//D + 1

if n_a >= n_t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def solve():
    items=list(input().split())
    T_health=int(items[0])
    T_strength=int(items[1])
    A_health=int(items[2])
    A_strength=int(items[3])
    while(T_health>0 and A_health>0):
        A_health-=T_strength
        if(A_health>0):
            T_health-=A_strength
    if(T_health<=0):
        print("No")
    if(A_health<=0):
        print("Yes")
    return
solve()

Submission status: Accepted

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

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