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

takahashi = (a+d-1) // d
aoki = (c+b-1) // b

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

Submission status: Accepted

Solution code:
TH,TA,AH,AA = map(int,input().split())
i = True

while i:
    AH -= TA
    if AH < 1:
        print('Yes')
        exit(0)
    
    TH -= AA
    if TH < 1:
        print('No')
        exit(0)

Submission status: Accepted

Solution code:
a, b, c, d = list(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 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 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())

t = -(-C // B)
a = -(-A // D)

if t <= a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

turn = 0
while True:
    if turn == 0:
        c -= b
        turn = 1
    else:
        a -= d
        turn = 0
    if a <= 0:
        print("No")
        exit()
    elif c <= 0:
        print("Yes")
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    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

if __name__=="__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# B - Battle
A,B,C,D = map(int,input().split())
ans = ['No', 'Yes']
takahashi = (C-1)//B + 1
aoki = (A-1)//D + 1
print(ans[takahashi<=aoki])

Submission status: Accepted

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

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:
import math
a,b,c,d = map(int,input().split())
if math.ceil(a / d) < math.ceil(c / b):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
tpow = a // d  + (0 if a % d == 0 else 1)
apow = c // b  + (0 if c % b == 0 else 1)

if tpow >= apow:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

tkturn=math.ceil(c/b)
akturn=math.ceil(a/d)

#print(tkturn,akturn)

if tkturn<=akturn:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C,D = list(map(int,input().split()))
a=0
c=0
while A > 0:
  A -= D
  a += 1#何回でやられたか
while C > 0:
  C -= B
  c += 1#何回で倒したか
if a < c:
  print('No')
elif a >= c:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())    
ta=(c-1)//b
ao=(a-1)//d

if ta<=ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

HP_T=A
HP_A=C

for i in range(1,1000):
    if i%2==1:
        HP_A -= B
    else:
        HP_T -= D

    if HP_A<=0:
        print('Yes')
        exit()
    elif HP_T<=0:
        print('No')
        exit()
    else:
        pass

Submission status: Accepted

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

k = math.ceil(a/d)
t = math.ceil(c/b)
if (t <= k):
    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
    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 (A>0) and (C>0):
    C = C-B
    if C<=0:
        Flag = True
        break
    A = A-D
    if A<=0:
        Flag = False
        break

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

Submission status: Accepted

Solution code:
def solve():
    A, B, C, D = map(int, input().split())
    print('YNeos'[-(-C//B) > -(-A//D)::2])


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

while True:
  cnt1 += 1
  c -= b
  if c <= 0:
    break

while True:
  cnt2 += 1
  a -= d
  if a <= 0:
    break
  
if cnt2 < cnt1:
  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:
A, B, C, D = map(int, input().split())
flg = True
for i in range(2 * max(A, C) + 1):
    if i % 2 == 0:
        C -= B
        if C <= 0:
            flg = False
            print('Yes')
    else:
        A -= D
        if A <= 0:
            flg = False
            print('No')
    if not flg:
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = list(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):
    if(c<=0):
        print("Yes")
        break
    elif(a<=0):
        print("No")
        break
    else:
        c-=b
        a-=d

Submission status: Accepted

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

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 print("No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
while 0<a and 0<c:
    a-=d
    c-=b
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
print('Yes' if C <= 0 else '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())

flag = 0
turn = 0
while True:
  if turn == 0:
    c -= b
  else:
    a -= d

  if a <= 0:
    break
  if c <= 0:
    flag = 1
    break
  
  turn = turn ^ 1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
hp_a,at_a, hp_b, at_b = list(map(int, input().split()))
while True:
  hp_b = hp_b - at_a
  if hp_b <= 0:
    print("Yes")
    exit()
  hp_a = hp_a - at_b
  if hp_a <= 0:
    print("No")
    exit()

Submission status: Accepted

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

flag_T=False
flag_A=False

while flag_T==False and flag_A==False:
  C=C-B
  if C<=0:
    flag_T=True
  A=A-D
  if A<=0:
    flag_A=True
  
if flag_T==True:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C,D = list(map(int,input().split(" ")))
S,T = [0,0]

if A%D != 0:
  S +=1
if C%B != 0:
  T += 1
if C//B + T <= A//D + S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#ABC164b

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

result = 0
while True:
    c -= b
    if c <= 0:
        result = 1
        break
    a -= d
    if a <= 0:
        break

if result == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

ans = ""
while ans == "":
    c -= b
    if c <= 0:
        ans = "Yes"
        continue

    a -= d
    if a <= 0:
        ans = "No"

print(ans)

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

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

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

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
    else:
        pass
    a -= d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(a, b, c, d):
    hp_takahashi, atk_tahashi = a, b
    hp_aoki, atk_aoki = c, d

    while True:
        hp_aoki -= atk_tahashi

        if hp_aoki <= 0:
            return 'Yes'

        hp_takahashi -= atk_aoki

        if hp_takahashi <= 0:
            return 'No'

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

Submission status: Accepted

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

t_hp = a
a_hp = c
while a_hp > 0 or t_hp > 0:
    a_hp -= b
    t_hp -= d
    if a_hp <= 0:
         print("Yes")
         exit()
    elif t_hp <= 0:
         print("No")
         exit()

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
#a = Takahashi's HP,b = T's ATK, c = Aoki's HP, d = A's ATK
#T -> A -> T -> A...
print("Yes" if -(-a//d) >= -(-c//b) else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
def cc(at,hp):
  d=0
  while hp-at>0:
    hp-=at
    d+=1
  return d


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

Submission status: Accepted

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

"""

"""

from math import ceil

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

Submission status: Accepted

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

"""

"""

a, b, c, d = map(int, input().split())
monsters = [(a, b), (c, d)]
# health, damage
i = 0
while True:
    a_health, a_damage = monsters[i]
    d_health, d_damage = monsters[(i+1)% 2]

    d_health -= a_damage

    if d_health <= 0:
        if i == 0:
            print("Yes")
        else:
            print("No")
        break
    
    monsters[i] = (a_health, a_damage)
    monsters[(i+1)% 2] = (d_health, d_damage)
    i = (i+1) % 2

Submission status: Accepted

Solution code:
from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())

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

Solution code:
#B
A,B,C,D = map(int,input().split())
r = "No"
while A > 0:
    C = C-B
    if C <= 0:
        r = "Yes"
        break
    else:
        pass
    A = A-D
print(r)

Submission status: Accepted

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

for _ in range(10000):
  C = C-B
  if C <= 0:
    print('Yes')
    exit(0)
  A = A-D
  if A <= 0:
    print('No')
    exit(0)

Submission status: Accepted

Solution code:
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    a, b, c, d = map(int, input().split())
    print('Yes' if ceil(a / d) >= ceil(c / b) else 'No')


if __name__ == '__main__':
    main()

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
if turn == 0:
  print('No')
elif turn == 1:
  print('Yes')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
x = (a+d-1)//d
y = (c+b-1)//b
if x >= y:
    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:
a,b,c,d=map(int,input().split())
if(int((c+b-1)/b)<=int((a+d-1)/d)):
    print("Yes")     
else:
    print("No")

Submission status: Accepted

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

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

print('Yes' if c <= 0 else 'No')

Submission status: Accepted

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

n = 0
while (a > 0) & (c > 0):
    n += 1
    if n % 2 == 1:
        c -= b
    else:
        a -= d

if n % 2 == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
thp,tat,ahp,aat = map(int,input().split())
while True:
    ahp -= tat
    if ahp <= 0:
        print("Yes")
        break
    thp -= aat
    if thp <= 0:
        print("No")
        break

Submission status: Accepted

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

if tak > aok:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def main():
    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
if __name__ == '__main__':
    main()

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")
    exit()
  a = a-d
  if a <= 0:
    print("No")
    exit()

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
    else:
        a -= d
        turn = 0

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

Submission status: Accepted

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

i = 0
while True:
    if i % 2 == 0:
        C -= B
    else:
        A -= D

    if A <= 0:
        print("No")
        break
    if C <= 0:
        print("Yes")
        break
    i += 1

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while 1:
    C -= B
    A -= D
    if C <= 0:
        print('Yes')
        break
    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")
        exit()
    # 生きてた場合相手のターンへ
    a-=d
    if a<=0:
        print("No")
        exit()

Submission status: Accepted

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

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:
def attack(player,enemy):
    enemy[0] -= player[1]
    if(enemy[0] <= 0):
        return 1
    else:
        return -1

def resolve():
    data = [int(i) for i in input().split()]

    takahasi = [data[0],data[1]]
    aoki = [data[2],data[3]]
    
    while(True):
        flag = attack(takahasi,aoki)
        if(flag == 1):
            print("Yes")
            break
        flag = attack(aoki,takahasi)
        if(flag == 1):
            print("No")
            break
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
count=0
for i in range(100):
  turn1=c-b
  c=turn1
  count+=1
  if c<=0:
    break

newcount=0
for i in range(100):
  turn2=a-d
  a=turn2
  newcount+=1
  if a<=0:
    break

if count<=newcount:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def takahashi_win(A,B,C,D):
    while True:
        C -= B
        if C<=0:
            return "Yes"
        A -= D
        if A <= 0:
            return "No"
    

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

Submission status: Accepted

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

turn=True
while A>0 and C>0:
    if turn==True:
        C=C-B
        turn=False
    else:
        A=A-D
        turn=True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A,B,C,D = map(int,input().split())
E = math.ceil(A/D)
F = math.ceil(C/B)
if E >= F:
  print('Yes')
else:
  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:
import math

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

Takahashi = math.ceil(C/B)
Aoki = math.ceil(A/D)

if Takahashi <= Aoki:
    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 c <= 0:
    print("Yes")
    break
  if a <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
vt,at,va,aa = map(int,input().split())
while True:
  va -= at
  if va<=0:
    ans = 'Yes'
    break
  vt -= aa
  if vt<=0:
    ans = 'No'
    break
print(ans)

Submission status: Accepted

Solution code:
def attack(hp,attack):
    result = hp - attack
    return result

input = list(map(int, input().split()))
hp_takahashi = input[0]
attack_takahashi = input[1]
hp_aoki = input[2]
attack_aoki = input[3]
result = 10

while result > 1:
    hp_aoki = attack(hp_aoki,attack_takahashi)
    if hp_aoki < 1:
        print("Yes")
        break
    else:
        hp_takahashi = attack(hp_takahashi,attack_aoki)
        if hp_takahashi < 1:
            print("No")
            break

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
a = A//D
if A%D != 0:
    a += 1
c = C//B
if C%B != 0:
    c += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def round_up(x):
    if x>int(x):
        return int(x)+1
    else:
        return int(x)
a,b,c,d=map(int,input().split())
m,n=round_up(c/b),round_up(a/d)

print('No' if m>n else 'Yes')

Submission status: Accepted

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

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

if(takahashi > aoki):
    print("No")

else:
    print("Yes")

Submission status: Accepted

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


while 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:
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 = map(int, input().split())
while A >= 1 and C >= 1:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
import math as m
h1,s1,h2,s2=map(int,input().split())
a1=m.ceil(h2/s1)
a2=m.ceil(h1/s2)
if a2<a1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split(' '))
count = 0
result = ''
while True:
    if count % 2 == 0:
        c -= b
        if c <= 0:
          result = 'Yes'
          break  
    else:
        a -= d
        if a <= 0:
            result = 'No'
            break
    count += 1
print(result)

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
while min(A, C) > 0:
  C = C - B
  A = A - D
if C <= 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
thhp, that, aohp, aoat = map(int, input().split())

while True:
    aohp -= that
    if aohp <= 0:
        print('Yes')
        break
        
    thhp -= aoat
    if thhp <= 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())

aoki = c - b
takahasi = a - d

for i in range(10000):
  if i % 2 == 0:
    c -= b
    if c <= 0:
      print('Yes')
      exit()
  elif i % 2 == 1:
    a -= d
    if a <= 0:
      print('No')
      exit()

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
t_life_span = -(-t_hp//a_atk)
a_life_span = -(-a_hp//t_atk)
print("Yes" if t_life_span >= a_life_span 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:
    print('Yes')
  else:
    a -= d
    if a<=0:
      print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: 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())
i = 0
while a > 0 and c > 0:
    c -= b
    i += 1
    if c > 0:
        a -= d
        i += 1

if i % 2 == 1:
    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
    a -= d
    if a <=0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

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

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:
nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
d = int(nums[3])

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        break
    a -= d

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

Submission status: Accepted

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

Submission status: Accepted

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

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') 
        exit()
    a -= d 
    if a <= 0  :
        print('No')
        exit()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

    print(ans)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

tak=math.ceil(A/D)
aoki=math.ceil(C/B)

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

Submission status: Accepted

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

while A > 0 and C > 0:
  A -= D
  C -= B
  
if C <= 0:
  print('Yes')
else:
  print('No')

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if a<=0 and c<=0:
    print("Yes")

elif a<=0:
    print("No")

else:
    print("Yes")

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
count_T = (c-1)//b + 1
count_A = (a-1)//d + 1

if count_T > count_A:
  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
    if C <= 0:
        break
    A -= D
    

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

Submission status: Accepted

Solution code:
import sys
a,b,c,d = (int(x) for x in input().split())

while a>0:
    c-=b
    if c<=0:
        print("Yes")
        sys.exit()
    a-=d

print("No")

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
T = (c-1)//b
A = (a-1)//d
if T<=A:
    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
    A -= D
    if A <= 0:
        print('No')
        break

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:
import math

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

TK = math.ceil(C / B)
AO = math.ceil(A / D)

print('Yes' if TK <= AO else 'No')

Submission status: Accepted

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

myturn=a//d
yourturn=c//b
e=a%d
f=c%b

if e!=0:
  myturn+=1
if f!=0:
  yourturn+=1

if myturn>=yourturn:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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