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())
i="true"
while(i=="true"):
  c=c-b
  if(c<=0):
    print("Yes",end="")
    i="False"
  else:
    a=a-d
    if(a<=0):
      print("No",end="")
      i="False"

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

if c%b == 0:
    e = c//b
else:
    e = c//b+1
if a%d == 0:
    f = a//d
else:
    f = a//d+1
if e <= f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

H=A
P=C
while (True):
    P=P-B

    if  P<=0:
        print("Yes")
        break

    H=H-D
    if  H<=0:
        print("No")
        break

Submission status: Accepted

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

def calc_kill_num(hp, attack):
	if hp < attack:
		return 1
	attack_num, mod = divmod(hp, attack)
	if mod > 0:
		return attack_num + 1
	else:
		return attack_num

t_kill_a_num = calc_kill_num(C, B)
a_kill_t_num = calc_kill_num(A, D)


if t_kill_a_num <= a_kill_t_num:
	print("Yes")
else:
	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)
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 = list(map(int, input().split()))

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

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

Submission status: Accepted

Solution code:
N = input().split(" ")
TL = int(N[0])
TA = int(N[1])
AL = int(N[2])
AA = int(N[3])
a = 0

while a == 0:
  AL = AL - TA
  if AL <= 0:
    a = 1
    break
  TL = TL - AA
  if TL <= 0:
    a = 2
    break
if a == 1:
  print("Yes")
elif a == 2:
  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())
flag = 1
while a > 0 or c > 0:
    if flag:
        c -= b
        flag = 0
    else:
        a -= d
        flag = 1
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

while a>0 or b>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 math

list1 = list(map(int, input().strip().split()))
a = list1[0]
b = list1[1]
c = list1[2]
d = list1[3]


k = math.ceil(a/d)
l = math.ceil(c/b)

if k>=l:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
for i in range(200):
    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())
for i in range(100):
  c-=b
  if c<=0:
    print('Yes')
    quit()
  a-=d
  if a<=0:
    print('No')
    quit()

Submission status: Accepted

Solution code:
import math

a, b, c, d = map(int, input().split())
T = a//d + a%d*0.1
A = c//b + c%b*0.1

T = math.ceil(T)
A = math.ceil(A)

if T >= A:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
a,b,c,d=l[0],l[1],l[2],l[3]
while a>0 and c>0:
  c=c-b
  if c>0:
    a=a-d
if a>c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

for i in range(1,101):

    if c-(b*i) <= 0:
        print("Yes")
        break
    elif a-(d*i) <= 0:
        print("No")
        break
    else:
        None

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
for i in range(100):
    if C-B > 0 and A-D > 0:
        C -= B
        A -= D
        continue
    elif C-B > 0 and A-D <= 0:
        print('No')
        break
    else:
        print('Yes')
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = list(map(int, input().split()))

while M[0] > 0 or M[2] > 0:
  
    M[2] -= M[1]
    if M[2] <= 0:
      print('Yes')
      break
      
    M[0] -= M[3]
    if M[0] <= 0:
      print('No')
      break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def q2():
    A,B,C,D = (int(i) for i in input().split())
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            break

        A -= D
        if A <= 0:
            print('No')
            break


if __name__ == '__main__':
    q2()

Submission status: Accepted

Solution code:
from math import ceil

h1, s1, h2, s2 = map(int, input().split())
moves_of_takashi = ceil(h2/s1)
moves_of_aoka = ceil(h1/s2)

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

Submission status: Accepted

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

for i in range (100):
    C = c - i*b
    if(C<=0):
        break
    A = a - i*d
    if(C<=0):
        break
    
if(A <= 0):
    print('No')
else :
    print('Yes')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B,C,D=[int(i) for i in input().split()]
ans=0
while True:
    C=C-B
    if C<=0:
        break
    A=A-D
    if A<=0 :
        break
if C<=0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
data = list(map(int,input().split()))

a_hp = data[0]
a_at = data[1]
b_hp = data[2]
b_at = data[3]

while True:
    if b_hp - a_at <= 0:
        print("Yes")
        break
    elif b_hp - a_at > 0:
        b_hp -= a_at
    
    if a_hp - b_at <= 0:
        print("No")
        break
    elif a_hp - b_at > 0:
        a_hp -= b_at

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

Submission status: Accepted

Solution code:
l = input().split()
a_hp = int(l[0])
a_at = int(l[1])
b_hp = int(l[2])
b_at = int(l[3])
a_s = a_hp // b_at
a_a = a_hp % b_at
b_s = b_hp // a_at
b_a = b_hp % a_at

if a_a > 0:
  a_s += 1
if b_a > 0:
  b_s += 1
if a_s >= b_s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
takahasi_HP, takahasi_ATK, aoki_HP, aoki_ATK = map(int, input().split())

while True:
    aoki_HP -= takahasi_ATK
    if aoki_HP  <= 0:
        print("Yes")
        break
    takahasi_HP -= aoki_ATK
    if takahasi_HP <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
h1, s1, h2, s2 = map(int, input().split())

while True:
    h2 -= s1
    if h2 <= 0:
        print("Yes")
        break

    h1 -= s2
    if h1 <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

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

num=0
num2=0
for i in range(101):
    num+=B
    num2+=D

    if num >= C:
        print("Yes")
        break
    elif num2 >= A:
        print("No")
        break

Submission status: Accepted

Solution code:
import re
th, ta, ah, aa = map(int, input().split()) 
while True:
    ah -= ta
    if ah <= 0:
        print("Yes")
        break
    th -= aa
    if th <= 0:
        print("No")
        break

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:
rist = input().split()
while int(rist[0])>0 and int(rist[2])>0:
  if int(rist[2])-int(rist[1])<=0:
    print("Yes")
    break
  else:
    rist[2] = int(rist[2])-int(rist[1])
 
  if int(rist[0])-int(rist[3])<=0:
    print("No")
    break
  else:
    rist[0] = int(rist[0])-int(rist[3])

Submission status: Accepted

Solution code:
A,B,C,D = list(map(int, input().split()))
if A % D == 0:
    takahashi = A // D #takahashiを0にするのにに必要な攻撃数
else:
    takahashi = A // D + 1

if C % B == 0:
    aoki = C // B #takahashiを0にするのにに必要な攻撃数
else:
    aoki = C // B + 1


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

Submission status: Accepted

Solution code:
def main():
    a, b, c, d = map(int, input().split())
    kai_a = a // d
    kai_c = c // b
    amari_a = a % d
    amari_c = c % b
    
    if kai_a > kai_c:
        print('Yes')
    elif kai_a == kai_c:
        if amari_c == 0:
            print('Yes')
        elif amari_a == 0:
            print('No')
        else:
            print('Yes')
    else:
        if amari_c == 0 and amari_a > 0:
            print('Yes')
        else:
            print("No")

 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
monsterAHP, monsterAAttack, monsterBHP, monsterBAttack = map(int, input().split(' '))
turnA = int(monsterBHP / monsterAAttack)
modA = monsterBHP % monsterAAttack
turnB = int(monsterAHP / monsterBAttack)
modB = monsterAHP % monsterBAttack

if(modA != 0):
  turnA = turnA + 1
  
if(modB != 0):
  turnB = turnB + 1

if(turnA > turnB):
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
taka=(c+(b-1))//b
ao=(a+(d-1))//d
if taka<=ao:
    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())

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

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

Submission status: Accepted

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

t,tmod = divmod(a, d)
a,amod = divmod(c , b)

if tmod >0:
  t = t+1
if amod >0:
  a = a+1

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

Submission status: Accepted

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

k=0

while(1):
    c=c-b
    a=a-d
    if(c <=0):
        k=1
        break
    if(a<=0):
        k=2
        break
#print(k)
if(k==1):print("Yes")
else:print("No")

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
i=0
j=0
while True:
  if c-b>0:
    c=c-b
    i+=1
  else:
    break
while True:
  if a-d>0:
    a-=d
    j+=1
  else:
    break
if i<=j:
  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:
    break
  a-=d
  if a<=0:
    break
  
print('Yes' if a>0 else 'No')

Submission status: Accepted

Solution code:
tak_health, tak_attack, aoki_health, aoki_attack = list(map(int, input().split()))

game = True

while game:
    if aoki_health > 0:
        aoki_health -= tak_attack
    if tak_health > 0:
        tak_health -= aoki_attack
    if aoki_health <= 0:
        print("Yes")
        game = False
    elif tak_health <= 0:
        print("No")
        game = False

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
tp = i[0]
ta = i[1]
ap = i[2]
aa = i[3]
while tp > 0 and ap > 0:
  #print("たかはしのこうげき！")
  ap = ap - ta
  #print("たかはしは",ta,"ポイントのダメージをあおきにあたえた！")
  #print("あおきののこりたいりょくは",ap)
  #print("あおきのこうげき！")
  if ap <= 0:
    print('Yes')
    break
  tp = tp - aa
  #print("あおきは",aa,"ポイントのダメージをたかはしにあたえた！")
  #print("たかはしののこりたいりょくは",tp)
  if tp <= 0:
    print('No')
    break
#if tp > 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:
    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 = 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())
ta=(C-1)//B+1
tb=(A-1)//D+1
if ta<=tb:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

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

t_hp = A
t_ap = B
a_hp = C
a_ap = D

while True :
    # attack takahashi
    a_hp = a_hp - t_ap
    if a_hp <= 0 :
        print('Yes')
        break

    # attack aoki
    t_hp = t_hp - a_ap
    if t_hp <= 0 :
        print('No')
        break

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:
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:
N = [int(e) for e in input().split()]
if(N[2]%N[1] !=0):
    ans = (N[2]//N[1])+1
else:
    ans = N[2]//N[1] 
for i in range(1,ans):
    N[0] -= N[3]
    if(N[0] <= 0):
        print('No')
        break
else:
    print('Yes')

Submission status: Accepted

Solution code:
A = list(map(int, input().strip().split(' ')))
flag = True

while flag:
    A[2] = A[2] - A[1]
    if not A[2] > 0:
        print('Yes')
        break
    A[0] = A[0] - A[3]
    if not A[0] > 0:
        print('No')
        flag = False

Submission status: Accepted

Solution code:

N=list(map(int,input().split()))
if N[2]<=N[1]:
    print("Yes")
    exit()

takahashi=N[2]/N[1]
aoki=N[0]/N[3]

if aoki%1!=0:
   aoki=aoki+1 

if takahashi%1!=0:
    takahashi=takahashi+1
    

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

Submission status: Accepted

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

aoki = c
takahashi = a

for i in range(101):
  if aoki - b > 0: #高橋の攻撃
    if takahashi - d <= 0: #青木の攻撃で高橋負け
      print("No")
      break
    else: #戦闘続く
      takahashi = takahashi - d
      aoki = aoki - b
      continue
  else: #高橋勝ち
    print("Yes")
    break

Submission status: Accepted

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

Submission status: Accepted

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

A,B,C,D=[int(x) for x in input().split()]
count=0
while A*C>0:
    if count%2==0:
        C-=B
    else:
        A-=D
    count+=1
if count%2==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a, b, c, d = [int(x) for x in 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())
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=list(map(int,input().split()))
def kaisuu(a,b):
    #aを守りの体力、bを攻めの攻撃力として倒すまでのターン数を計算
    if a%b == 0:
        return a/b
    else:
        return a//b+1
if kaisuu(a[2],a[1])>kaisuu(a[0],a[3]):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

battle(A,B,C,D)

Submission status: Accepted

Solution code:
battle = list(map(int, input().split()))
a_HP = battle[0]
a_ATK = battle[1]
b_HP = battle[2]
b_ATK = battle[3]

while(b_HP>=0):
    b_HP -= a_ATK
    if b_HP <= 0:
        print("Yes")
        break
    a_HP -= b_ATK
    if a_HP <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
TN = A // D 
Tmod = A % D
AN = C // B
Amod = C % B
if Tmod>0:
    TN+=1 # 青木くんに必要な攻撃回数
if Amod>0:
    AN+=1# 高橋くんに必要な攻撃回数
if AN<=TN:
    print('Yes')
else:
    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)
 
r1 = c // b
r2 = a // d 

for i in range(1000):
  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())
s=math.ceil(c/b)
t=math.ceil(a/d)
if s<=t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
takahashiSTA, takahashiAttack, aokiSTA, aokiAttack = map(int, input().split())
result = ""

while True:
    aokiSTA -= takahashiAttack #takahashi attack fase
    if aokiSTA <= 0:
        result = "Yes"
        break

    takahashiSTA -= aokiAttack  #aoki attack fase
    if takahashiSTA <= 0:
        result = "No"
        break 

print(result)

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;
  else:
    a = a - d;
else:
  print("No");

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lists = list(map(int, input().split()))

x = lists[2] // lists[1]
if lists[2] % lists[1] != 0:
    x += 1

y = lists[0] // lists[3]
if lists[0] % lists[3] != 0:
    y += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if c%b==0:
    y=c//b
else:
    y=c//b+1
    
if y<=x:
    print("Yes")
elif x<y:
    print("No")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
counter_1=0
counter_2=0
while c>0:
  c=c-b
  counter_1=counter_1+1 #counter_1は高橋の攻撃回数
while a>0:
  a=a-d
  counter_2=counter_2+1 #counter_2は青木の攻撃回数
if counter_2>=counter_1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
#      .      '                    Udit Gupta @luctivud         ,              
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                            ##     ##  #######  # #  ######
                            ##     ##  ##   ##  ###    ##
                            ##     ##  ##    #  # #    ##
                            #########  #######  # #    ##
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

import sys
import math as mt
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printwsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end="tst, ")

MOD = int(1e9+7); BABYMOD = 998244353;
# ################################ HELPER PROGRAMS USED ###################################
# ################################## MAIN STARTS HERE #####################################
# for _testcases_ in range(int(input())):
h1, s1, h2, s2 = get_ints()
flag = False
while h1 > 0 and h2 > 0:
    h2 -= s1
    if h2 <= 0:
        flag = True
        break
    h1 -= s2
print("Yes") if flag else print("No")

# #########################################################################################
'''
THE LOGIC AND APPROACH WAS DEVELOPED BY ME @luctivud.
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
PLEASE DO NOT PLAGIARISE.
'''

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())
if A%D ==0:
  t = A//D
else:
  t = A//D+1
if C%B ==0:
  u = C//B
else:
  u = (C//B)+1
if t < u:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

fin=False
while fin==False:
    C-=B
    if C<=0:
        fin=True
        win="t"
    else:
        A-=D
        if A<=0:
            fin=True
            win="a"
        else:
            pass

if win=="t":
    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:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Submission status: Accepted

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

Thit = A
Tatk = B
Ahit = C
Aatk = D
win = False

while True:
    Ahit = Ahit - Tatk
    if Ahit <= 0:
        win = True
        break
    Thit = Thit - Aatk
    if Thit <= 0:
        win = False
        break

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

Submission status: Accepted

Solution code:
import math

string = input()

a = int(string.split(" ")[0])
b = int(string.split(" ")[1])
c = int(string.split(" ")[2])
d = int(string.split(" ")[3])

t_tae = math.ceil(a / d)
a_tae = math.ceil(c / b)

if t_tae < a_tae:
    print("No")
    exit()

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
    else:
        A = A - D
        if A <= 0:
            print('No')
            break

Submission status: Accepted

Solution code:
ht, st, ha, sa = map(int, raw_input().split())
turn = 0
while ha > 0 and ht > 0:
  if turn == 0:
    ha -= st
  else:
    ht -= sa
    
  turn = 1 - turn
  
if ht > 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:
        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):
    a-=d
    c-=b

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def makemade(x,y):
    ans = x//y + 1
    if x%y == 0:
        ans = ans -1
    return ans

taka = makemade(A,D)
ao = makemade(C,B)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
count1=0
count2=0
while (c-b)>0:
    count1 =count1+1
    c=c-b
while (a-d)>0:
    count2 =count2+1
    a=a-d
if count1<=count2:
    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の入力
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:
li=list(map(int,input().split()))

A=li[0]
B=li[1]
C=li[2]
D=li[3]

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

for i in range(101):
    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())

if A%D == 0:
    n_T = A//D
else:
    n_T = A//D+1

if C%B == 0:
    n_A = C//B
else:
    n_A = C//B + 1

if n_T >= n_A:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

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

flag =''


while c >= 0:
    c  -= b
    

    if c <= 0 and a > 0:
        flag ='yes'

    a -= d

if flag == 'yes':
    print('Yes')
else:
    print('No')

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

def shohai(A, B, C, D):
    while A > 0 and C > 0:
        C -= B
        A -= D
        if C <= 0:
            return('Yes')
            break
        if A <= 0:
            return('No')
            break
      

ans = shohai(A,B,C,D)
print(ans)