Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.

The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.

If Takahashi will win, print Yes; if he will lose, print No.

Constraints

1 \leq A,B,C,D \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

If Takahashi will win, print Yes; if he will lose, print No.

Sample Input 1

10 9 10 10

Sample Output 1

No

First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.

Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.

Takahashi's monster is the first to have 0 or less health, so Takahashi loses.

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
A,B,C,D=map(int,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 True:
    c -= b
    if c<=0:
        print('Yes')
        break
    a -= d
    if a<=0:
        print('No')
        break

Submission status: Accepted

Solution code:
TakaHP,TakaATK,AoHP,AoATK=list(map(int,input().split()))
Tcount=0
Acount=0
while TakaHP>0:
    Tcount+=1
    TakaHP-=AoATK
while AoHP>0:
    Acount+=1
    AoHP-=TakaATK
if Tcount>=Acount:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

e = c // b
if c % b != 0:
    e += 1

f = a // d
if a % d != 0:
    f += 1

if e <= f:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

A, B, C, D = [int(k) for k in input().split(' ')]
takahashi_wins = True 
if math.ceil(A / D) < math.ceil(C / B):
  takahashi_wins = False 
  
print('Yes' if takahashi_wins else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
a = l[0]
b = l[1]
c = l[2]
d = l[3]

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

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,b,c,d=map(int,input().split())
while a>0 and c>0:
  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):
    c -= b
    if c <= 0:
        break
    a -= d


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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
c1 = 0
c2 = 0
while a > 0:
    a -= d
    c1 += 1

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

if c1 >= c2:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    t, t_a, a, a_a = list(map(int, input().split()))
    while True:
        a = a - t_a
        if a <= 0:
            print('Yes')
            exit()
        t = t - a_a
        if t <= 0:
            print('No')
            exit()




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# スペース区切りの整数入力
TH,TA,AH,AA = map(int, input().split())

while True:
    AH -= TA
    if AH <= 0:
        print("Yes")
        break
    TH -= AA
    if TH <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
from math import factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			




a,b,c,d=input2()

for i in range(1,10000):
	if i%2==1:
		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())
for _ in range(10000):
  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=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 = list(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(c>0 and d>0):
    c = c - b
    #print(c)
    if (c <= 0):
        print('Yes')
        break
    
    a = a - d 
    #print(a)
    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 = map(int,input().split())


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

Submission status: Accepted

Solution code:
import math


a, b, c, d = map(int, input().split())
#arr - list(map(int, input().split()))
#s = input()

i = 0
while a:
	if i % 2 == 0:
		c -= b
		if c <= 0:
			print('Yes')
			exit()
	else:
		a -= d
		if a <= 0:
			print('No')
			exit()
	i += 1

Submission status: Accepted

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

count = 0
while 0 < A and 0 < C:
    if count % 2 == 0:
        C -= B
    else:
        A -= D
    count += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a // d + (1 if a%d>0 else 0) >= c // b + (1 if c%b>0 else 0):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7

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

print(ans)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
E, F = C//B + int(C%B != 0), A//D + int(A%D != 0)
if E <= F:
    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:
        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, raw_input().split())
if C%B==0:
    T_attack=C/B
else:
    T_attack=C/B+1

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

if T_attack<=A_attack:
    print "Yes"
else:
    print "No"

Submission status: Accepted

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


taka = -(-c//b)
ao = -(-a//d)


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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(A, B, C, D):
    """Test Case
    >>> print_ans(10, 9, 10, 10)
    No
    >>> print_ans(46, 4, 40, 5)
    Yes
    """
    while True:
        #Yes perttern
        C = C - B
        if(C <= 0):
            print("Yes")
            break
        #No perttern
        A = A - D
        if(A <= 0):
            print("No")
            break



if __name__ == '__main__':
    A, B, C, D = map(int, input().rstrip().split())
    print_ans(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())
if -(-A//D)>=-(-C//B):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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


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

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

if cntA <= cntC:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
th, ta, ah, aa = map(int,input().split())

if -(-ah//ta) <= -(-th//aa):
    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:
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

a, b, c, d = read_int()

def solve():
    ans = 'Yes'
    ta = c // b + min(c % b, 1)
    ao = a // d + min(a % d, 1)
    if ta > ao:
        ans = 'No'
    return ans

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

inp=input().split(" ")
thp=int(inp[0])
tat=int(inp[1])
ahp=int(inp[2])
aat=int(inp[3])

for i in range(100):
  ahp-=tat
  if ahp<=0:
    print("Yes")
    sys.exit()
  thp-=aat
  if thp<=0:
    print("No")
    sys.exit()

Submission status: Accepted

Solution code:
a,b,x,y=list(map(int, input().split()))
ans=0

while ans==0:
	x=x-b
	if x<1:
		ans=1
	if ans==0:
		a=a-y
	if a<1:
		ans=1

if a<1:
	print('No')
else:
	print('Yes')

Submission status: Accepted

Solution code:
lists = list(map(int, input().split())) #１行の入力をi[0],i[1]というように空白で分けてを取得し、iに値を入れる
a= lists[2]
t  =lists[0]
while(1): 
    a = a - lists[1]
    if a<=0:
        print("Yes")
        break
    t = t - lists[3]
    if t <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
def resolve():
	a, b, c, d = map(int, input().split())
	ta = a // d
	ea = c // b
	if a % d:
		ta += 1
	if c % b:
		ea += 1

	if ta >= ea:
		print('Yes')
	else:
		print('No')
resolve()

Submission status: Accepted

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

counter = -1

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

if counter % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

import math

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

Submission status: Accepted

Solution code:
import math

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

#items=[int(i) for i in input().split()]
while True:
    C-=B
    if C<=0:
        print("Yes")
        exit()
    A-=D
    if A<=0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
from math import ceil #切り上げ

def inp(): return int(input()) #一個だけ読み取り
def inpm(): return map(int,input().split()) #mapオブジェクトで呼び出し
def inpl(): return list(map(int, input().split())) #数字リストをintで
def inpls(): return list(input().split()) #数字リストをstrで


A, B, C, D = inpl()

print("Yes") if ceil(float(A)/D)>=ceil(float(C)/B) else print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if C%B ==0:
    x = x-1
if A%D ==0:
    y = y-1
#print(x)
#print(y)
if x <= y:
    
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
a = n[0]
b = n[1]
c = n[2]
d = n[3]
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:
def b():
    # A = list(map(int, input().split()))
    import math
    a_hp, a_atk, b_hp, b_atk = map(int, input().split())

    kill_a = math.ceil(a_hp/b_atk)
    kill_b = math.ceil(b_hp/a_atk)
    if kill_b <= kill_a:
        print('Yes')
    else:
        print('No')


##########
if __name__ == "__main__":
    b()

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)
print('Yes') if x>=y else print('No')

Submission status: Accepted

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

	

if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

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

if count1>count2:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

for x in range(400):
    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())

def cnt(hp, at):
    return (hp + at-1) // at

if cnt(c, b) <= cnt(a, d):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

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

taka=C//B
if C%B!=0:
    taka=taka+1
    
aoki=A//D
if A%D!=0:
    aoki=aoki+1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
sum_t = a[0]
sum_a = a[2]
flag = 1
winner = 0
while flag:
  sum_a = sum_a - a[1]
  if(sum_a <= 0):
    flag = 0
    break    
  sum_t = sum_t - a[3]
  if(sum_t <= 0):
    winner = 1
    flag = 0
    break   

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

Submission status: Accepted

Solution code:
def readInt():
    return list(map(int, input().split()))
    
t_h,t_a,a_h,a_a = readInt()

while t_h>0 and a_h>0:
    a_h -= t_a
    t_h -= a_a
    # print(a_h, t_h)
    
if t_h <= 0 and a_h >0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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 (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())


i = 0
j = 0

while A > 0:
  A -= D
  i +=1

while C > 0:
  C -= B
  j += 1
  
if i >= j:
  print('Yes')
  
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if -(-c // b) - -(-a // d) < 1:
    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())
if C%B==0:
    Nk = C//B
else:
    Nk = C//B + 1

if A-D*(Nk-1)<=0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
def num(x,y):
  if x%y==0:
    return x//y
  else:
    return x//y +1
if num(a,d)<num(c,b):
  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:
nums = input()
Hp_Taka = int(nums.split(' ')[0])
Atk_Taka = int(nums.split(' ')[1])
Hp_Aoki = int(nums.split(' ')[2])
Atk_Aoki = int(nums.split(' ')[3])

while Hp_Taka > 0 and Hp_Aoki > 0:
	Hp_Aoki = Hp_Aoki - Atk_Taka
	if Hp_Aoki > 0:
		Hp_Taka = Hp_Taka - Atk_Aoki
if Hp_Taka > 0:
	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
    i += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

turn=0
while True:
    if turn%2 == 0:
        num[2] = num[2]-num[1]
        if num[2] <= 0:
            print('Yes')
            break
    else:
        num[0] = num[0]-num[3]
        if num[0] <= 0:
            print('No')
            break
    turn += 1

Submission status: Accepted

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

A_count = 0
while A > 0:
    A = A - D
    A_count += 1

B_count = 0
while C > 0:
    C = C - B
    B_count += 1

if A_count < B_count:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

if A % D == 0:
  A_Attack = A // D
else:
  A_Attack = A // D + 1
  
if C % B == 0:
  T_Attack = C // B
else:
  T_Attack = C // B + 1


if A_Attack >= T_Attack:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a=input().split()
A=int(a[0])
B=int(a[1])
C=int(a[2])
D=int(a[3])
T=int((C-1)/B)
A=int((A-1)/D)

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

Submission status: Accepted

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

def turn(A,B):
    if A%B ==0:
        return A//B
    else:
        return A//B + 1
if turn(A,D) >= turn(C,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())

import math

T=math.ceil(C/B+1)
A=math.ceil(A/D+1)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    a, b, c, d = nm()
    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 i in range(10000):
    if C <= 0:
        print('Yes')
        exit()
    else:
        C -= B

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

Submission status: Accepted

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

Submission status: Accepted

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

while True:
    if flg:
        c -= b
        flg = False
    else:
        a -= d
        flg = True

    if a <= 0:
        print('No')
        break
    elif c <= 0:
        print('Yes')
        break

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    A, B, C, D = map(int, input().split())
    if C//B+(C%B>0) <= A//D+(A%D>0):
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
_=True
while _ == True:
  A[2]-=A[1]
  if A[2]<=0:
    print("Yes")
    _=False
  else:
    A[0]-=A[3]
    if A[0]<=0:
      print("No")
      _=False

Submission status: Accepted

Solution code:
ABCD = list(map(int, input().split()))
A = ABCD[0]
B = ABCD[1]
C = ABCD[2]
D = ABCD[3]
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
li = input().split()
A = int(li[0])
B = int(li[1])
C = int(li[2])
D = int(li[3])

times_1 = math.ceil(C / B)
times_2 = math.ceil(A / D)

if times_1 <= times_2:
    print('Yes')
elif times_1 > times_2:
    print('No')

Submission status: Accepted

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

for i in range(120):
	if b*i>=c:
		print('Yes')
		break
	elif d*i>=a:
		print('No')
		break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions

a, b, c, d = [int(x) for x in stdin.readline().rstrip().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 (a-1)//d+1 - ((c-1)//b+1) <0 :
    print('No')
else:
    print('Yes')

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')
elif x > y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
#from fractions import gcd
from math import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

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

_d = (a+d-1)//d
_b = (c+b-1)//b

# print(_d, _b)
if _d < _b:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = [int(s) for s in input().split()]
A = line[0]
B = line[1]
C = line[2]
D = line[3]

while A > 0:
    C = C - B
    if not(C > 0):
        print('Yes')
        break
    A = A - D

if not(A > 0):
    print('No')

Submission status: Accepted

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

    aa=a-d
    if aa<=0:
        print("No")
        exit()
    else:
        a=aa

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:
import math
a,b,c,d=map(int,input().split())
e=math.ceil(a/d)
f=math.ceil(c/b)


if e>=f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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