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:
t_HP, t_A, a_HP, a_A = map(int,input().split())
ans = False
while True:
  a_HP -= t_A
  if a_HP <= 0:
    ans = True
    break
  t_HP -= a_A
  if t_HP <= 0:
    break

if ans == True:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

def main():
    a, b, c, d = map(int, input().split(" "))
    while(True):
        c -= b
        if c <=0:
            print("Yes")
            return
        a -= d
        if a <= 0:
            print("No")
            return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

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

taka = 0
aoki = 0

while a > 0:
    a = a - d
    taka += 1   

while c > 0:
    c = c - b
    aoki += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x=math.ceil(a/d)
y=math.ceil(c/b)

if x>=y : 
    print("Yes")

else :
    print("No")

Submission status: Accepted

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

    A -= D
    if A <= 0:
        ans = 'No'
        break

print(ans)

Submission status: Accepted

Solution code:
# B - Battle

import sys

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

while True:
    if c - b <= 0:
        print('Yes')
        sys.exit()
    c = c - b

    if a - d <= 0:
        print('No')
        sys.exit()
    a = a - d

Submission status: Accepted

Solution code:
tp,tf,ap,af = map(int,input().split())

from math import ceil
takahashi = ceil(tp/af)
aoki = ceil(ap/tf)

if takahashi >= aoki :
  print('Yes')
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:
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:

R = input()
A = int(R.split(' ')[0])
B = int(R.split(' ')[1])
C = int(R.split(' ')[2])
D = int(R.split(' ')[3])

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

Submission status: Accepted

Solution code:
import math
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:
def main():
    abcd = [int(_x) for _x in input().split()]
    a = abcd[0]
    b = abcd[1]
    c = abcd[2]
    d = abcd[3]

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


main()

Submission status: Accepted

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

win = ''

while True:
    C = C - B
    if C <= 0:
        win = 'Yes'
        break

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

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

    A = A - D
    if A <= 0:
        ans = 'No'
        break

print(ans)

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())
while True:
    C -= B
    A -= D
    if C <= 0:
        print("Yes")
        exit()
    elif A <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
ri = [int(v) for v in input().split()]

A, B, C, D = ri

f = 1
while A > 0 and C > 0:
    if f:
        C -= B
    else:
        A -= D
    f ^= 1

print("Yes" if A > C else "No")

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
t = c//b
if not c % b == 0:
  t += 1
o = a//d
if not a % d == 0:
  o += 1

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

Submission status: Accepted

Solution code:
import math


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

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

    print('Yes' if Takeshi<= Aoki else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

a = A // D
b = C // B
N = max(a, b) + 1
for i in range(N):
    if C > 0:
        C -= B
        if C <= 0:
            break
    if A > 0:
        A -= D
        if A <= 0:
            break

ans = "No"
if A > C:
    ans = "Yes"

print(ans)

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
    i += 1
    if a <= 0:
        print("No")
        break
    elif c <= 0:
        print("Yes")
        break

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
turn='t'
while A>0 and C>0:
  if turn=='t':
    C-=B
    turn='a'
  else:
    A-=D
    turn='t'

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

Submission status: Accepted

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

t = math.ceil(C / B)
a = math.ceil(A / D)

print('Yes' if t <= a else 'No')

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

Submission status: Accepted

Solution code:
a, b, c, d = [int(i) for i in 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 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())

takahashi = 0
aoki = 0

while C > 0:
  C -= B
  takahashi += 1
  
while A > 0:
  A -= D
  aoki += 1
  
if takahashi <= aoki:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
def battle(x_hp, x_atk, y_hp, y_atk):
  turn = 0
  while 1:
    if turn == 0:
      y_hp -= x_atk
      if y_hp < 1:
        return "Yes"
    else:
      x_hp -= y_atk
      if x_hp < 1:
        return "No"
    turn = 1 - turn
print(battle(A, B, C, D))

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

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:
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())
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 = input().split()
A = int(A)
B = int(B)
C = int(C)
D = int(D)
i = 0

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
 
# X=ceil(A/D)とY=ceil(C/B)を比較し、X>=Yなら勝ち、X<Yなら負け
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 -= B
  if C <= 0: break
  A -= D
  if A <= 0: break
  
if C <= 0: print('Yes')
elif A <= 0: 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('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:
        A -= D

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

Submission status: Accepted

Solution code:
a = input()
a = a.split()
b = int(a[1])
c = int(a[2])
d = int(a[3])
a = int(a[0])
e = a / d
f = c / b
if int(e) < e:
    e = int(e + 1)
if int(f) < f:
    f = int(f + 1)
if e >= f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

A_survive=0
C_survive=0

while A>0:
    A-=D
    A_survive+=1
while C>0:
    C-=B
    C_survive+=1
if A_survive >= C_survive:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Takahashi = C//B
if C%B != 0 :
    Takahashi += 1
    
Aoki = A//D
if A%D != 0 :
    Aoki += 1
    
# print(Takahashi,Aoki)

ans='No'
if Takahashi <= Aoki:
    ans = 'Yes'
    
print(ans)

Submission status: Accepted

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

import math

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

Submission status: Accepted

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

while 1:
    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")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
def resolve():
    A, B, C, D = list(map(int, input().split()))
    import math
    n_taka_attacks = math.ceil(C/B)
    n_ao_attacks = math.ceil(A/D)
    print("Yes" if n_taka_attacks <= n_ao_attacks else "No")


if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def main():
    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:
        ans = "No"
    else:
        ans = "Yes"

    print(ans)


if __name__ == "__main__":
    main()

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())
i = 0
while 1:
  if i == 0:
    C -= B
    if C <= 0:
      print("Yes")
      break
  else:
    A -= D
    if A <= 0:
      print("No")
      break
  i ^= 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d_pre=input().split()
d=[int(s) for s in d_pre]
A=d[0]
B=d[1]
C=d[2]
D=d[3]
for i in range(210):
    if i%2==0:
        C-=B
        if C<=0:
            print("Yes")
            break
    else:
        A-=D
        if A<=0:
            print("No")
            break

Submission status: Accepted

Solution code:
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())
O = None
while True:
    C -= B
    if C <= 0:
        O = 'Yes'
        break
    A -= D
    if A <= 0:
        O ='No'
        break
print(O)

Submission status: Accepted

Solution code:
import math
from math import gcd
INF = float("inf")

import sys
input=sys.stdin.readline
sys.setrecursionlimit(500*500)
import itertools
from collections import Counter,deque

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
for cnt in range(100):
  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(" "))
taka = math.ceil(c/b)
aoki = math.ceil(a/d)

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)


YES = "Yes"  # type: str
NO = "No"  # type: str

INF=10**20
def solve(A: int, B: int, C: int, D: int):
    while True:
        C-=B
        if C <= 0:
            print(YES)
            break
        
        A-=D
        if A <= 0:
            print(NO)
            break



    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())

while True:
    a_hp = a_hp - t_atk
    if a_hp <= 0:
        print('Yes')
        break
    t_hp = t_hp - a_atk
    if t_hp <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
import math

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

#on which turn do they die
takahashi = math.ceil(A / D)
aoki = math.ceil(C / B)
#print(takahashi)
#print(aoki)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding = SJIS

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

while a * c > 0:
    if ans == "Yes":
        a -= d
        ans = "No"
    else:
        c -= b
        ans = "Yes"

print(ans)

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

Submission status: Accepted

Solution code:
takahashi_hp, takahashi_power, aoki_hp, aoki_power = map(int, input().split(' '))
takahashi_attack_count = int(aoki_hp / takahashi_power)
if aoki_hp % takahashi_power != 0:
    takahashi_attack_count += 1
aoki_attack_count = int(takahashi_hp / aoki_power)
if takahashi_hp % aoki_power != 0:
    aoki_attack_count += 1

if takahashi_attack_count <= aoki_attack_count:
    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 = 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 1:
    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:
a,b,c,d = map(int, input().split())
z = 'BATTLE'
while z == 'BATTLE':
    c -= b
    if c <= 0:
        z = 'Yes'
        break
    a -= d
    if a <= 0:
        z ='No'
        break
print(z)

Submission status: Accepted

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: 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())
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())
flag = True
while a > 0 and c > 0:
    c -= b
    if c <= 0:
        flag = True
        break
    a -= d
    if a <= 0:
        flag = False
        break
if flag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

t = 1
while (A > 0) and (C > 0):
    if t > 0:
        C -= B
    else:
        A -= D
    t = (t + 1) % 2

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

Submission status: Accepted

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

taka = 0
aoki = 0

while True:
    if A <= 0:break
    A -= D
    taka += 1

while True:
    if C <= 0:break
    C -= B
    aoki += 1

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

if taka> ao:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z,w=map(int,input().split())
while(1):
    if(z>0):
        z-=y
    if(z<=0):
        print("Yes")
        exit()
    if(x>0):
        x=x-w
    if(x<=0):
        print("No")
        exit()

Submission status: Accepted

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

n=0
while True:
  if n%2==0:
    C-= B
    if C <= 0:
      print('Yes')
      exit(0)
  else:
    A-= D
    if A <= 0:
      print('No')
      exit(0)
  n+=1

Submission status: Accepted

Solution code:
def Bfun():
    vals = [int(i) for i in input().split()]
    a = vals[0]
    b = vals[1]
    c = vals[2]
    d = vals[3]
    res2 = a//d + (1 if(a % d > 0) else 0)
    res1 = c//b + (1 if(c % b > 0) else 0)
    res = "Yes" if(res1 <= res2) else "No"
    print(res)
Bfun()

Submission status: Accepted

Solution code:
vals = [int(i) for i in input().split()]
a = vals[0]
b = vals[1]
c = vals[2]
d = vals[3]
res2 = a//d + (1 if(a % d > 0) else 0)
res1 = c//b + (1 if(c % b > 0) else 0)
res = "Yes" if(res1 <= res2) else "No"
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

flag=0

for i in range(101):
    if c-b*i<=0:
        print("Yes")
        flag+=1
        break
    
    elif flag==0:
        if a-d*i<=0:
            print("No")
            break

Submission status: Accepted

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

Submission status: Accepted

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

t_death = a // d + 1 if a % d else a // d
a_death = c // b + 1 if c % b else c // b

if t_death >= a_death:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from math import ceil

A_HP, A_ATK, B_HP, B_ATK = map(int, input().split())
print('Yes' if ceil(A_HP / B_ATK) >= ceil(B_HP / A_ATK) else 'No')

Submission status: Accepted

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

rst = battle()
print(rst)

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

if -(-C//B)<=-(-A//D):
  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())
while a > 0 and c > 0:
    c = c - b
    if c <= 0:
        print ("Yes")
    else:
        a = a - d
        if a <= 0:
            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:
S=list(map(int,input().split()))
while True:
  S[2]=S[2]-S[1]
  S[0]=S[0]-S[3]
  if S[2]<=0:
    print("Yes")
    break
  elif S[0]<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
# coding: utf-8

def main():
    a, b, c, d = map(int, input().split())
    for _ in range(100):
        c -= b
        if c <= 0:
            print("Yes")
            break
        a -= d
        if a <=0:
            print("No")
            break

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc164/tasks/abc164_b

# 高橋君のモンスターは体力が A で攻撃力が B
# 青木君のモンスターは体力が C で攻撃力が D

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:
import sys
win = ''
def main():
  global win  
  a,b,c,d = list(map(int,(input().split())))
  while a > 0 and b > 0:
    c -=b
    if c <=0:
      win = 'Yes'
      break
    a -=d
    if a <=0:
      win = 'No'
      break
  print(win)    
  

if __name__ == '__main__':
  main()

Submission status: Accepted

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

def death_time(hp,atack):
    if hp%atack == 0:
        return hp/atack
    else:
        return hp//atack + 1

takahashi_death = death_time(a,d)
aoki_death = death_time(c,b)

if aoki_death<=takahashi_death:
    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())

def ans(a,b,c,d):
  while 1:
    c -= b
    if c <= 0:
      return("Yes")
    a -= d
    if a <= 0:
      return("No")

print(ans(a,b,c,d))

Submission status: Accepted

Solution code:
def solve():
    A,B,C,D = [int(i) for i in input().split()]
    takahashi_attack_cnt = (C+B-1) // B
    aoki_attack_cnt = (A+D-1) // D
    if takahashi_attack_cnt <= aoki_attack_cnt:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

t_turn = math.ceil(c/b)
a_turn = math.ceil(a/d)

if t_turn <= a_turn:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
nT = 0
nA = 0
while C-B>0:
    C -= B
    nT += 1
while A-D>0:
    A -= D
    nA += 1
if nT <= nA:
    print('Yes')
else:
    print('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:
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())
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())
for i in range(10**3):
  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())
# 体力0以下になる攻撃回数
# 高橋
tcnt = C // B
if C % B != 0:
  tcnt += 1
acnt = A // D
if A % D != 0:
  acnt += 1
# print(tcnt, acnt)
if tcnt <= acnt:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    c -= b
    if a <= 0:
        break

print(ans)

Submission status: Accepted

Solution code:
# Battle
A, B, C, D = map(int, input().split())
HP = [A, C]
Attack = [B, D]
Turn = False
while (HP[0] > 0) & (HP[1] > 0):
    HP[not Turn] -= Attack[Turn]
    Turn = not Turn
print(['No', 'Yes'][Turn])

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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