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())
x = (a+d-1)//d
y = (b+c-1)//b
if y <= x:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def f(hp,atk):
	i = 1
	while True:
		if hp - i*atk <= 0:
			return i
		i += 1

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

# print('Aくんは{}ターンで勝つ'.format(f(int(c),int(b))))
# print('Bくんは{}ターンで勝つ'.format(f(int(a),int(d))))

if f(int(c),int(b)) <= f(int(a),int(d)):
	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' )
        exit()
    A -= D 
    if A <= 0:
        print( 'No' )
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

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


main()

Submission status: Accepted

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


for l in range(100):
    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 = list(map(int, input().strip().split()))


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
ABCD = input().split(' ')
A = int(ABCD[0])
B = int(ABCD[1])
C = int(ABCD[2])
D = int(ABCD[3])
while A > 0 and C > 0:
    C -= B
    A -= D
if C <= 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
th,ta,ah,aa=list(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:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
THP, TAT, AHP, AAT = map(int, input().split())

turn = 0
while True:
  if turn % 2 == 0:
    AHP -= TAT
    if AHP <= 0:
      print("Yes")
      break
  else:
    THP -= AAT
    if THP <= 0:
      print("No")
      break
  turn += 1

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:
# -*- coding: utf-8 -*-
# 整数の入力
A, B, C, D = map(int, input().split())

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

Submission status: Accepted

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

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

Battle(a,b,c,d)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
cta = C // B
ctb = A // D
if C % B != 0:
    cta += 1
if A % D != 0:
    ctb += 1
if cta <= ctb:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = [int(i) for i in input().split()]
 
while t_hp > 0 and a_hp > 0 :
  a_hp -= t_atk
  if a_hp <= 0 :
    break
  t_hp -= a_atk
if t_hp <= 0 :
  print('No')
else :
  print('Yes')

Submission status: Accepted

Solution code:
import math
a,b,c,d = map(int,input().split())
t_a = math.ceil(c/b)
if a-d*(t_a-1) <= 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D=(int(x) for x in input().split())
while 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 = 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:
A, B, C, D = map(int, input().split())

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


print(res)

Submission status: Accepted

Solution code:
h1_init,a_t,h2_init,a_a = list(map(int, input().split()))
h1=h1_init
h2=h2_init

while h1>=0 or h2>=0:
  h2=h2-a_t
  if h2<=0:
    print("Yes")
    break
    
  h1=h1-a_a
  if h1<=0 :
    print("No")
    break

Submission status: Accepted

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

# B - Battle
def win_takahashi(A, B, C, D):

	for i in range(200):
		if i % 2 == 0:
			if B >= C:
				return True
			else:
				C -= B
		else:
			if D >= A:
				return False
			else:
				A -= D
			

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

if win_takahashi(A, B, C, D):
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

# B - Battle
def takahashi_win():
	A, B, C, D = map(int, input().split())
	i = 0

	while True:
		if i % 2 == 0:
			if C-B <= 0:
				return True
			else:
				C -= B
		else:
			if A-D <= 0:
				return False
			else:
				A -= D
		
		i += 1


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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
takaturn = 0
while (a > 0 and c > 0):
  takaturn += 1
  takaturn %= 2
  if takaturn:
    c -= b
  else:
    a -= d
if takaturn:
  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())

# T君が必要な攻撃回数
tAttack = -(-C//B)
# A君が必要な攻撃回数
aAttack = -(-A//D)

if tAttack <= aAttack:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

E = 0

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 = [int(_) for _ in input().split()]

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
while all:
    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 = list(map(int, input().split()))
a = C // -B
b = A // -D
if a >= b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    A, B, C, D = read_ints()
    while True:
        # health, strength = A, B
        C -= B
        if C <= 0:
            return 'Yes'
        A -= D
        if A <= 0:
            return 'No'


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

Submission status: Accepted

Solution code:
T_h, T_s, A_h, A_s = map(int, input().split())

# Turns that each need to win
T_t = (A_h + T_s - 1) // T_s # Y
A_t = (T_h + A_s - 1) // A_s # X

if T_t <= A_t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

while True:

    data[2] -= data[1]
    if data[2] <= 0:
        print("Yes")
        break

    data[0] -= data[3]
    if data[0] <= 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:
"""
// Author : snape_here - Susanta Mukherjee
     
 """
 
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())
 
 
def read():
    sys.stdin = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(a , b):
    return (a*b)//gcd(a,b)

mod=1000000007

import math

import bisect

abc="abcdefghijklmnopqrstuvwxyz"

def main():

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

# region fastio

 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()

Submission status: Accepted

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


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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
if __name__ == "__main__":
    a, b, c, d = map(int, input().split())
    num_takahashi = math.ceil(c / b)
    num_aoki = math.ceil(a / d)
    
    if num_takahashi <= num_aoki:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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


#高橋の攻撃何発分か
if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 

#青木の攻撃何回分か
if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
takahp, takaatk, aokihp, aokiatk = map(int, input().split())

def attack(hp, atk):
  hp -= atk
  if hp <= 0:
    return True

while True:
  if attack(aokihp, takaatk):
    print("Yes")
    break
  else:
    aokihp -= takaatk
  if attack(takahp, aokiatk):
    print("No")
    break
  else:
    takahp -= aokiatk

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
tak, m = divmod(c, b) 
aok, mo = divmod(a, d)
if m > 0:
    tak += 1
else:
    pass
if mo > 0:
    aok += 1
else:
    pass
if tak > aok:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    A, B, C, D = map(int, rl().split())
    cnt0 = -(-C // B)
    cnt1 = -(-A // D)
    if cnt0 > cnt1:
        print('No')
    else:
        print('Yes')
    

if __name__ == '__main__':
    solve()

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
x = (C-1)//B
y = (A-1)//D
if x > y:
  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] = list(map(int, input().strip().split()))

x = (a+d-1)//d
y = (b+c-1)//b

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

Submission status: Accepted

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

Submission status: Accepted

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

taka = [a,b]
ao = [c,d]

judge = 0
while True:
    if judge == 0:
        ao[0] -= taka[1]
        judge = 1
        if ao[0] <= 0:
            print("Yes")
            break
    else:
        taka[0] -= ao[1]
        judge = 0
        if taka[0] <= 0:
            print("No")
            break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = [int(i) for i in input().split()]
i = 0
while 1:
    if a <= 0:
        print("No")
        break
    elif c <= 0:
        print("Yes")
        break
    if i % 2 == 0:
        c = c - b
    else :
        a = a - d
    i = i + 1

Submission status: Accepted

Solution code:
t_hp, t_ap, a_hp, a_ap = map(int,input().split())

while t_hp > 0 or a_hp > 0:
    a_hp -= t_ap
    if a_hp <= 0:
        print('Yes')
        break

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

A,B,C,D = LI()

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

Submission status: Accepted

Solution code:
t_life, t_attack, a_life, a_attack = (int(x) for x in input().split())

while t_life > 0 or a_life > 0:
    
    a_life -= t_attack
    if a_life <= 0:
        print('Yes')
        break
        
    t_life -= a_attack
    if t_life <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
import math
a,b,c,d = list(map(int, input().split()))
q1 = math.ceil(a/d)
q2 = math.ceil(c/b)
if q1 >= q2:
    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())

for i in range(1,202):
	if i/2 % 1 :
		c = c-b
	else:
		a = a-d
	
	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())
if -(-a//d)>=-(-c//b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    a, b, c, d = map(int, rl().split())
    for i in range(200):
        if i % 2 == 0:
            c -= b
            if c <= 0:
                print('Yes')
                exit()
        else:
            a -= d
            if a <= 0:
                print('No')
                exit()
    

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
#Aは高橋体力、Cは青木体力
#Bは高橋攻撃,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=map(int,input().split())
turn=0# takahashi's turn
while a>0 and c>0:
    if turn==0:
        c-=b
        if c<=0:
            print('Yes')
    else:
        a-=d
        if a<=0:
            print('No')
    turn=1-turn

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
f = 0
while f==0:
    C -= B
    if C<=0:
        f = 1
        break
    # print("青木君",C)
    A -= D
    if A<=0:
        f = 2
        break
    # print("高橋君",A)
if f==1:
    print("Yes")
elif f==2:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = [int(e) for e in input().split()]
import math
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())
while c > 0 and a > 0:
  c = c - b
  a = a - d

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

Submission status: Accepted

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

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())
print("Yes" if (a + d - 1) // d >= (c + b - 1) // b else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
import math

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

Submission status: Accepted

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


taka_turn = C//B
taka_para = C%B
if taka_para > 0 :
    taka_turn = taka_turn + 1

ao_turn = A//D
ao_para = A%D
if ao_para > 0 :
    ao_turn = ao_turn + 1

if ao_turn >= taka_turn :
    print('Yes')
if taka_turn > ao_turn :
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
try:
  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("No")
      else:
          print("Yes")
    
except:
  pass

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
t_q, t_d = divmod(C, B)
a_q, a_d = divmod(A, D)
t_eq = t_q if t_d == 0 else t_q + 1
a_eq = a_q if a_d == 0 else a_q + 1
if t_eq <= a_eq:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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: 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())
count =0
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 = map(int, input().split())

if -(-C // B) <= -(-A // D):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
A,B,C,D = map(int, input().split())
T = [A,B]
A = [C,D]

while True:
    for x in ['T', 'A']:
        if x == 'T':
            A[0] -= T[1]
        
        else:
            T[0] -= A[1]
            
        if T[0] <= 0:
            print('No')
            sys.exit()
        elif A[0] <= 0:
            print('Yes')
            sys.exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

n1 = (a + d - 1) // d
n2 = (c + b - 1) // b

if n1 >= n2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def battle():
    A_health, A_strength, B_health, B_strength = map(int, input().split())

    both_alive = True
    while both_alive:
        B_health -= A_strength

        if B_health <= 0:
            both_alive = False
            print('Yes')
            return

        A_health -= B_strength

        if A_health <= 0:        
            both_alive = False
            print('No')
            return


battle()

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c,d = inpl()
cnt = 0
while True:
    if cnt == 0:
        c -= b
        if c <= 0:
            print('Yes')
            break
    else:
        a -= d
        if a <= 0:
            print('No')
            break
    cnt ^= 1

Submission status: Accepted

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