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: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
a, b, c, d = map(int, input().split())
while d != 0 or a != 0:
  c -= b  # 高橋君の攻撃
  a -= d  # 青木君の攻撃
  if c == 0:
    print("Yes")
    break
  elif a == 0:
    print("No")
    break

Submission status: Time Limit Exceeded

Solution code:
a, b, c, d = map(int, input().split(" "))
i = 0
while a > 0 or c > 0:
  if i%2 == 0:
    c -= b
  else:
    a -= d
    i += 1
print("YNeos"[i%2::2])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
tkhp, tkat, aohp, aoat = map(int, input().split())

while True:
    aohp -= tkat
    tkhp -= aoat
    if aohp == 0:
        print('Yes')
        break
    elif tkhp == 0:
        print('No')
        break

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    AHP, AAT, BHP, BAT = list(map(int, input().split()))

    while AHP * BHP > 0:
        AHP -= BAT
        BHP -= AAT

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

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
i = list(map(int, input().split()))
isTWin = False;

while i[0] and i[2]:
    i[2] -= i[1]
    if not i[2]:
        isTWin = True
        break

    i[0] -= i[3]
    if not i[0]:
        isTWin = False
        break
        
if isTWin:
    print('Yes')
else:
    print('No')

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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

while(A or C != 0):
    C = C - B
    if(C == 0):
        print("Yes")
        break
    A = A - D
    if(A == 0):
        print("No")
        break

Submission status: Time Limit Exceeded

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

while True:

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
A, B, C, D = map(int, input().split())
turn = 0
while (turn := turn + 1) and ((C := C - B) if turn & 1 else (A := A - D)): pass
print("Yes" if turn & 1 else "No")

Submission status: Time Limit Exceeded

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

while (a>0) & (c>0):
  tmp1 = c-b
  tmp2 = a-d
  if tmp1<=0: 
    print('Yes')
    break
  elif tmp2<=0: 
    print('No')
    break

Submission status: Time Limit Exceeded

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

while True:
    if a>0:
        a -= d
    if a<0:
        print("No")

    if c>0:
        c -= b
    if c<0:
        print("Yes")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
A, B, C, D = [int(i) for i in input().split()]
 
while A or C > 0:
  A -= D
  C -= B
 
if A >= C:
  print('Yes')
else:
  print('No')

Submission status: Time Limit Exceeded

Solution code:
# B

inputs = input().split(' ')

d = inputs[0:2]
takahashi = {'Name': 'Takahashi', 'Hp': int(d[0]), 'Power': int(d[1])}
d = inputs[2:4]
aoki = {'Name': 'Aoki', 'Hp': int(d[0]), 'Power': int(d[1])}

players = [aoki, takahashi]
N =len(players)

loop = True
while True:
    for i in range(N):
        players[i-1]['Hp'] -= players[i]['Power']
        if players[i-1]['Hp'] <= 0:
            if players[i]['Name'] == 'Takahashi':
                print('Yes')
            else:
                print('No')
            loop = False
            break

Submission status: Time Limit Exceeded

Solution code:
# B

inputs = input().split(' ')

d = inputs[0:2]
takahashi = {'Name': 'Takahashi', 'Hp': int(d[0]), 'Power': int(d[1])}
d = inputs[2:4]
aoki = {'Name': 'Aoki', 'Hp': int(d[0]), 'Power': int(d[1])}

players = [aoki, takahashi]
N =len(players)
while True:
    for i in range(N):
        players[i-1]['Hp'] -= players[i]['Power']
        if players[i-1]['Hp'] <= 0:
            if players[i]['Name'] == 'Takahashi':
                print('Yes')
            else:
                print('No')

Submission status: Time Limit Exceeded

Solution code:
A, B, C, D = [int(s) for s in input().split()]
turn = 0
while True:
  if A <= 0 and C > 0:
    print("No")
  elif A > 0 and C <= 0:
  	print("Yes")
  
  if turn == 0:
    A -= D
    turn = 1
  else:
    C -= B
    turn = 0

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
t_at, t_hp, a_at, a_hp = map(int, input().split())

while True:
  a_hp -= t_at
  if a_hp <= 0:
    print("Yes")
  
  t_hp -= a_at
  if t_hp <= 0:
    print("No")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  # Takashi
while (ht > 0 or st > 0):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Submission status: Time Limit Exceeded

Solution code:
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  # Takashi
while (not(ht <= 0) or not(st <= 0)):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
A,B,C,D = map(int,input().split())
Takahashi = C - B
Aoki = A - D
if Takahashi == 0: print ("Yes")
if Aoki == 0: print ("No")
else:
    while Takahashi != 0 or Aoki != 0:
        Takahashi -= B
        Aoki -= D
        if Takahashi == 0:
            print ("Yes")
            break
        if Aoki == 0: 
            print ("No")
            break

Submission status: Time Limit Exceeded

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

j = 0
k = 0

while True:
  j = a - d
  k = c - b
  if j == 0 or k == 0:
    break

if j == 0:
  print("No")
elif k == 0:
  print("Yes")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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
  TA = TA - AA
  if TL <= 0:
    a = 2
    break
if a == 1:
  print("Yes")
elif a == 2:
  print("No")

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
ht, st, ha, sa = map(int, raw_input().split())
turn = 0
while st > 0 and sa > 0:
  if turn == 0:
    ha -= st
  else:
    ht -= sa
    
  turn = 1 - turn
  
if st > 0:
  print 'Yes'
else:
  print 'No'

Submission status: Time Limit Exceeded

Solution code:
T_HP,T_Atk,A_HP,A_Atk = map(int,input().split())

Takahashi = [T_HP,T_Atk]
Asakura = [A_HP,A_Atk]

    
while True:    
    Asakura[0] - Takahashi[1]
    if Asakura[0] < 0:
        print("Yes")
        exit()
    
    
    Takahashi[0] - Asakura[1]
    if Takahashi[0] < 0:
        print("No")
        exit()

Submission status: Time Limit Exceeded

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

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

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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: Time Limit Exceeded

Solution code:
a, b, c, d = map(int, input().split())
kai_a = a // d
kai_c = c // b
amari_a = a % d
amari_c = c % b

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
A,B,C,D = map(int, input().split())
STOP = ""
a = 0
while STOP != "STOP":
    A = A - B
    D = D - C
    if A <= 0:
        a = 1
    if D <= 0:
        a = 2
    else:
        continue
if a == 1:
    print("Yes")
else:
    print("No")

Submission status: Time Limit Exceeded

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

print(ans)

##print("Yes" if   -(-d//a) <=-(-b//c)  else "No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = [int(e) for e in input().split()]
i=0
t =True
while t:
    if(i%2==0):
        N[2] -= N[1]
    else:
        N[0] -= N[3]
    i+=1
    if(N[0] == 0) or(N[2]==0):
        break
if(N[0] == 0):
    print('No')
else:
    print('Yes')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def solve(t_h, t_s, a_h, a_s):
    t_turn = True
    while t_h and a_h:
        if t_turn:
            a_h -= t_s
        else:
            t_h -= a_s
        t_turn = not t_turn
    return t_h > 0


if __name__ == '__main__':
    t_h, t_s, a_h, a_s = tuple([int(x) for x in input().split()])

    print('Yes' if solve(t_h, t_s, a_h, a_s) else 'No')

Submission status: Time Limit Exceeded

Solution code:
A,B,C,D = map(int, input().split())
while A != 0 or B != 0 or C != 0 or D != 0:
    if A == 0 or B == 0:
        print("Yes")
    elif C == 0 or D == 0:
        print("No")
    else:
        continue
    A -= 1
    B -= 1
    C -= 1
    D -= 1

Submission status: Time Limit Exceeded

Solution code:
A,B,C,D = map(int,input().split())
#print(A,B,C,D)
def judge(A,B,C,D):
    while(True):
        C = C-B
        A = A - D
        if C==0:
            return 1
        elif A == 0:
            return 0
if judge(A,B,C,D)==1:
    print("Yes")
else:
    print("No")

Submission status: Time Limit Exceeded

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
	if(a==0):
		return 0
	else:
		return 1
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: Time Limit Exceeded

Solution code:
if __name__ == '__main__':
    t_h, t_s, a_h, a_s = tuple([int(x) for x in input().split()])
    t_turn = True

    while t_h and a_h:
        if t_turn:
            a_h -= t_s
        else:
            t_h -= a_s

        t_turn = not t_turn

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    a,b,c,d=MI()
    f=0
    while True:
        if f==0:
            c=c-b
            f=1
            if c==0:
                print("Yes")
                break
        if f==1:
            a=a-d
            f=0
            if a==0:
                print("No")
                break

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

while not finish:
    for i in range(2):
        if i==0:
            c -= b
        elif i==1:
            a-= d
        if a == 0 or c == 0:
            finish = True
            break

if a==0 and c!=0:
    print('No')
elif a!=0 and c==0:
    print('Yes')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys 
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())
while True:
	ha -= st
	ht -= sa
	if ha==0 or ht==0:
		break
print("Yes") if ha==0 else print("No")

Submission status: Time Limit Exceeded

Solution code:
s=input().rstrip().split(' ')
th=int(s[0])
tss=int(s[1])
ah=int(s[2])
ass=int(s[3])
I=0;
while(1):
    if ah!=0 and th!=0:
        if I%2==0:
            I+=1;
            ah-=tss;
        else:
            th-=ass
            I+=1;
    else:
        break;
if I%2==0:
    print("No")
else:
    print("Yes")

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	A,B,C,D = inputMap()

	ss = True
	while True:
		if A == 0 or C == 0:
			break

		if ss == True:
			ss = False
			C -= B
		else:
			ss = True
			A -= D

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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


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

Submission status: Accepted

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

while C > 0 or A > 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 です。

    高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。
    攻撃とは、相手のモンスターの体力の値を自分のモンスターの攻撃力のぶんだけ減らすことをいいます。
    このことをどちらかのモンスターの体力が 0 以下になるまで続けたとき、
    先に自分のモンスターの体力が 0 以下になった方の負け、そうでない方の勝ちです。

    高橋君が勝つなら Yes、負けるなら No を出力してください。
'''

'''
制約：
    1 ≦ A, B, C, D ≦ 100
    入力は全て整数である
'''
class Monster:
    def __init__(self, hp, power):
        self.hp = hp
        self.power = power

    def fight(self, power)  -> int:
        self.hp -= power
        return self.hp

    def is_loser(self)   -> bool:
        return self.hp <= 0

# 標準入力から A, B, C, D を取得する
a, b, c, d = map(int, input().split())

takahashi_monster = Monster(a, b)   # 高橋モンスター
aoki_monster = Monster(c, d)    # 青木モンスター
result = "ret"

while True:
    aoki_monster.fight(b)   # 高橋の攻撃
    if aoki_monster.is_loser():
        result = "Yes"
        break

    takahashi_monster.fight(d)  # 青木の攻撃
    if takahashi_monster.is_loser():
        result = "No"
        break

print(result)

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
# 高橋->青木->高橋->青木->...の順に攻撃する
# 高橋勝つならYes、負けるならNo

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:
    C -= B
    if C <= 0:
        print('Yes')
        break

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

Submission status: Accepted

Solution code:

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

m = C // B  # 青木君の耐えうるターン
if C % B != 0:
    m = m + 1

n = A // D  # 高橋君の耐えうるターン
if A % D != 0:
    n = n + 1

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

Submission status: Accepted

Solution code:
#   Battle

class Monster:
    def __init__(self, hp, attack):
        self.hp = hp
        self.attack = attack
        self.death = False


class Game:
    def __init__(self, monsters: list):
        self.monsters = monsters

    def calc_damage(self, offence, defence):
        self.monsters[defence].hp -= self.monsters[offence].attack
        if self.monsters[defence].hp <= 0:
            self.monsters[defence].death = True
        return self.monsters[defence].death

    def battle(self):
        while True:
            self.calc_damage(0, 1)
            if self.monsters[1].death:
                print("Yes")
                break
            self.calc_damage(1, 0)
            if self.monsters[0].death:
                print("No")
                break


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

t_monster = Monster(a, b)
a_monster = Monster(c, d)

game = Game([t_monster, a_monster])
game.battle()

Submission status: Accepted

Solution code:
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
a, b, c, d = map(int, read().split())
 
def main(a, b, c, d):
    while True:
        if c <= b:
            return 'Yes'
        c -= b
        if a <= d:
            return 'No'
        a -= d
 
print(main(a, b, c, d))

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

Submission status: Accepted

Solution code:
# 高橋君のモンスターは体力が A で攻撃力が B 
# 青木君のモンスターは体力が C で攻撃力が D 
# モンスターの体力が 0 以下になった方の負け、
# 高橋君が勝つなら Yes、負けるなら No を出力

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')
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')
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')
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:
a,b,c,d = map(int,input().split())
# 高橋君の倒すまでの攻撃回数
takahashi_turn = 0
# 青木君の倒すまでの攻撃回数
aoki_turn = 0
# 攻撃するたびに回数カウントして体力を減らす
while c - b > 0:
    takahashi_turn += 1
    c -= b
while a - d > 0:
    aoki_turn += 1
    a -= d
# 高橋くんが早く倒すときはYes
if takahashi_turn <= aoki_turn:
    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:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())

t_count = 0
a_count = 0

while a_hp > 0:
    a_hp -= t_atk
    t_count += 1

while t_hp > 0:
    t_hp -= a_atk
    a_count += 1

if t_count <= a_count:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def N():
    return int(input())
def L():
    return list(map(int,input().split()))
def NL(n):
    return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7
#import numpy


a,b,c,d = L()
ta = -(-c // b)
ao = -(-a//d)
#print(ta,ao)
if ta <= 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")