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

Submission status: Accepted

Solution code:
t_h,t_a,a_h,a_a=[int(i) for i in input().split()]

if t_a >= a_h:
  print('Yes')
  exit()
if t_h <= a_a:
  print('No')
  exit()

if a_h%t_a == 0:
  t_t = int(a_h/t_a)
else:
  t_t = int(a_h/t_a) + 1
  
if t_h%a_a == 0:
  a_t = int(t_h/a_a)
else:
  a_t = int(t_h/a_a) + 1

if t_t <= a_t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

q1, mod1 = divmod(A, D)
q2, mod2 = divmod(C, B)

if mod1 != 0:
  q1 += 1
if mod2 != 0:
  q2 += 1

if q1 >= q2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

takahashi_count = (int)(C/B)
aoki_count = (int)(A/D)

if C % B != 0 :
  takahashi_count += 1
if A % D != 0:
  aoki_count += 1

if takahashi_count <= aoki_count:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    import sys
    import math
    A,B,C,D=list(map(int,sys.stdin.readline().split()))
    if math.ceil(C/B)<=math.ceil(A/D):
        print('Yes')
    else:
        print('No')

main()

Submission status: Accepted

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

m=A//D
if A%D!=0:
    m+=1
n=C//B
if C%B!=0:
    n+=1
if m>=n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

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

tak = math.ceil(C / B)
ao = math.ceil(A / D)

if tak <= ao:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
monsters = list(map(int,input().split()))
A,B,C,D = monsters[0:4]

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

Submission status: Accepted

Solution code:
import math
h1, a1, h2, a2 = map(int,input().split())
x = math.ceil(h2/a1)
y = math.ceil(h1/a2)
print("Yes" if x <= y else "No")

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

takahasi_tairyoku = int(A)
aoki_tairyoku = int(C)

takahasi_kougeki = int(B)
aoki_kougeki = int(D)

takahasi_count = math.ceil(aoki_tairyoku / takahasi_kougeki) # 高橋はアオキを何回で倒せるか
aoki_count = math.ceil(takahasi_tairyoku / aoki_kougeki) # アオキは高橋を何回で倒せるか
# print(takahasi_count, aoki_count)
if (takahasi_count <= aoki_count):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import os
import math

def main():
	a,b,c,d = map(int, input().split())
	takahasi = math.ceil(a/d)
	aoki = math.ceil(c/b)
	
	if aoki <= takahasi:
		print("Yes")
	else:
		print("No")

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
TakahashiAndAoki=list(map(int,input().split())) 
while 1:
    if(TakahashiAndAoki[1]>=TakahashiAndAoki[2]):
        print("Yes")
        break
    else:
        TakahashiAndAoki[2]=TakahashiAndAoki[2]-TakahashiAndAoki[1]
    if (TakahashiAndAoki[3]>= TakahashiAndAoki[0]):
        print("No")
        break
    else:
        TakahashiAndAoki[0]=TakahashiAndAoki[0]-TakahashiAndAoki[3]

Submission status: Accepted

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

Submission status: Accepted

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

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

takahashi = a
aoki = c

for i in range(1,1000):
    if i%2 == 0:
        takahashi -= d
    else:
        aoki -= b

    if takahashi <= 0:
        print('No')
        break
    elif aoki <= 0:
        print('Yes')
        break

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

Submission status: Accepted

Solution code:
THP,TAT,AHP,AAT=map(int,input().split())
while THP>0 and AHP>0:
    AHP=AHP-TAT
    if AHP<=0:
        print("Yes")
        break
    THP=THP-AAT
    if THP<=0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

if c % b == 0:
    attack_num_t = c // b
else:
    attack_num_t = c // b + 1

if attack_num_t <= attack_num_a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

takahashi=C//B
aoki=A//D
if C%B!=0:
    takahashi=takahashi+1
if A%D!=0:
    aoki=aoki+1
if takahashi <= aoki:
    print('Yes')
else:    
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

while (a > 0) and (c > 0):
    if chk:
        c = c - b
        chk = False
    else:
        a = a - d
        chk = True

if a > c:
    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())
timea = a//d
timeb = c//b
if a%d != 0:
    timea += 1
if c%b != 0:
    timeb += 1
    
if timea >= timeb:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

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

takahashi = math.ceil(C/B)
aoki = math.ceil(A/D)
if takahashi <= aoki:
    print('Yes\n')
else:
    print('No\n')

Submission status: Accepted

Solution code:

class abc_164:
    
    def __init__(self):
        pass
    
    def A(self):
        sw=list(map(int,input().split()))
        print("unsafe") if sw[1]>=sw[0] else print("safe")
    
    def B(self):
        abcd=list(map(int,input().split()))
        while(abcd[0]!=0 and abcd[2]!=0):
            abcd[2]=abcd[2]-abcd[1]
            abcd[0]=abcd[0]-abcd[3]
            
            if abcd[2]<=0:
                print("Yes")
                break
            elif abcd[0]<=0:
                print("No")
                break
            else:
                pass
            
    def C(self):
        pass
    
    def D(self):
        pass
    
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_164()
    obj.B()

Submission status: Accepted

Solution code:
import sys
import collections
import math

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


a,b,c,d = nm()
ao=math.ceil(a/d)
su=math.ceil(c/b)
if(ao<su):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A_s,B_s,C_s,D_s=input().split()
A=int(A_s)
B=int(B_s)
C=int(C_s)
D=int(D_s)

ansA=int(C/B)
ansC=int(A/D)

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

Submission status: Accepted

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

#output
p = C/B
q = A/D

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

t = '高橋'

while True:
    if t=='高橋':
        c = c - b
        t = '青木'
        if c <= 0:
            print("Yes")
            break
        
    elif t=='青木':
        a = a - d
        t = '高橋'
        if a <= 0:
            print("No")
            break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
for i in range(200):
    if i % 2 == 0:
        c -= b
    else:
        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())
total_count_1 = 0
total_count_2 = 0


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

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

if  total_count_1 <= total_count_2:
    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=a-d
  i+=1
while c > 0:
  c=c-b
  j+=1
if i>=j:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
nums = [int(e) for e in input().split()]
a = nums[0]
b = nums[1]
c = nums[2]
d = nums[3]
while a > 0 and c > 0:
    c -= b
    if c <= 0:
        break
    a -= d

if a > 0:
    print('Yes')
elif c > 0:
    print('No')

Submission status: Accepted

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

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


jud_t = math.ceil(a/d)
jud_a = math.ceil(c/b)

if jud_a <= jud_t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C,D = (int(x) for x in 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 or C > 0:
    C = C - B
    if C <= 0:
        print("Yes")
        break
    else:
        A = A - D
        if A <= 0:
            print("No")
            break

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
A=0
if a%d==0:
  A=a//d
else:
  A=a//d+1
if c%b==0:
  T=c//b
else:
  T=c//b+1
if T<=A:
  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 A <= 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
taka_h, taka_a, aoki_h, aoki_a = map(int, input().split())

while True:
    aoki_h -=taka_a
    taka_h -= aoki_a
    if(aoki_h <=0):
        print("Yes")
        break
    elif(taka_h <= 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")
        break
    else:
        a -= d
        if a <= 0:
            print("No")
            break

Submission status: Accepted

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

count1 = 0
count2 = 0
while A > 0:
    A -= D
    count1 += 1
while C > 0:
    C -= B
    count2 += 1

if count1 < count2:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

def takahashi():
    global c
    c = c-b
    if c <= 0:
        print("Yes")
        exit()
    aoki()

def aoki():
    global a
    a = a-d
    if a <= 0:
        print("No")
        exit()
    takahashi()

takahashi()

Submission status: Accepted

Solution code:
ha, sa, hb, sb = map(int, input().split())
while True:
    hb = hb - sa
    if hb <= 0:
        print('Yes')
        break
        
    ha = ha - sb
    if ha <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
import math


def main():
    a = list(map(int, input().split()))
    t_hp = a[0]
    t_at = a[1]
    a_hp = a[2]
    a_at = a[3]
    t_win = math.ceil(a_hp / t_at)
    a_win = math.ceil(t_hp / a_at)
    if t_win <= a_win:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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:

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

def a():
    s, w = map(int, input().split())
    if w >= s:
        print('unsafe')
    else:
        print('safe')



b()

Submission status: Accepted

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

while(True):
    ah -= ta
    if(ah <= 0):
        print('Yes')
        exit()
    th -= aa
    if(th <= 0):
        print('No')
        exit()

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

aoki=math.ceil(a/d)
taka=math.ceil(c/b)

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

Submission status: Accepted

Solution code:
h1, a1, h2, a2 = map(int, input().split())
cnt1 = h2 // a1 if h2 % a1 == 0 else h2 // a1 + 1
cnt2 = h1 // a2 if h1 % a2 == 0 else h1 // a2 + 1
print('Yes' if cnt1 <= cnt2 else 'No')

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
hp1 = i[0]
hp2 = i[2]
atk1 = i[1]
atk2 = i[3]
while i[0] >= 0 or i[2] >= 0:
    hp2 -= atk1
    if hp2 <= 0:
        break
    hp1 -= atk2
    if hp1 <= 0:
        break
if hp1 <= 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
takaq, takamod = divmod(C, B)
aoq, aomod = divmod(A, D)
if takaq < aoq:
    print('Yes')
elif takaq == aoq:
    if takamod > 0 and aomod == 0:
        print('No')
    else:
        print('Yes')
else:
    if takamod == 0 and aomod > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]


# print(-1*(-1*Line[2] // Line[1]))
# print(-1*(-1*Line[0] // Line[3]))

if -1*(-1*Line[2] // Line[1]) <= -1*(-1*Line[0] // Line[3]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
nums = input()
nums = nums.split()
taka_hp = int(nums[0])
taka_pw = int(nums[1])
aoki_hp = int(nums[2])
aoki_pw = int(nums[3])

for i in range(0,200):
  if i%2 == 0 :
    aoki_hp -= taka_pw
  elif i%2 !=0:
    taka_hp -= aoki_pw
  if taka_hp <= 0:
    print("No")
    break
  elif aoki_hp <= 0:
    print("Yes")
    break

Submission status: Accepted

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

for i in range(1, 101):
    HP = C - (B*i)
    if HP < 0 or HP == 0:
        print("Yes")
        break
    else:
        HP2 = A - (D*i)
        if HP2 < 0 or HP2 == 0:
            print("No")
            break

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 = C - B
    if C <= 0:
        break
    A = A - D
    if A <= 0:
        break


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

Submission status: Accepted

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

for i in range(200):
    c = c- b
    if c <= 0:
        print("Yes")
        exit()
    else:
        a = a- d
        if a <= 0:
            print("No")
            exit()

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (a, b, c, d) = [int(e) for e in lines[0].split(' ')]

    return (a, b, c, d)


def solve(a, b, c, d):

    ta = c // b
    if c % b != 0:
        ta = ta + 1
    ao = a // d
    if a % d != 0:
        ao = ao + 1

    if ta <= ao:
        result = 'Yes'
    else:
        result = 'No'
    
    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

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

max_attack = 0
if(-(-a//d) > -(-c//b)):
    max_attack = int(-(-c//b))
else:
    max_attack = int(-(-a//d))

for cnt in range(0, max_attack):
    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())
j = False
while j == False:
    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())
aoki_attack_num = math.ceil(C/B)
if A - D*(aoki_attack_num-1)<=0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while th > 0 and ah > 0:
  ah -= B
  if ah <=0:
    break
  th -= D
  if th <= 0:
    flag = False
    break
  
if flag:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
th,ta,ah,aa=map(int,input().split(" "))
#print(th,ta,ah,aa)
#print((ah-1)//ta,(th-1)//aa)
if (ah-1)//ta > (th-1)//aa:
  print("No")
elif (ah-1)//ta <= (th-1)//aa:
  print("Yes")

Submission status: Accepted

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

is_tkhs = True
for _ in range(100000):
  if is_tkhs:
    C -= B
  else:
    A -= D
    
  is_tkhs = not (is_tkhs)
    
  if C <= 0 or A <= 0:
    break
      
print('No' if A <= 0 else 'Yes')

Submission status: Accepted

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

isWin = False
while not isWin:
  if a <= 0 or c <= 0:
    if a <= 0 and c > 0:
      print('No')
      exit()
    else:
      print('Yes')
      exit()
  a -= d
  c -= b

Submission status: Accepted

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

while True:
    h2 -= s1
    if h2 <= 0:
        print('Yes')
        break
    h1 -= s2
    if h1 <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
#!/usr/bin python3
# -*- coding: utf-8 -*-

def main():
    A, B, C, D = map(int, input().split())
    for i in range(1000):
        C -= B
        if C<=0:
            fg = True
            break
        A -= D
        if A<=0:
            fg = False
            break
    if fg:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
aHP,aAtc,bHP,bAtc=map(int, input().split())

while True:
    bHP-=aAtc
    if bHP<=0:
        print('Yes')
        exit()
    aHP-=bAtc
    if aHP<=0:
        print('No')
        exit()

Submission status: Accepted

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

a=int(a)
b=int(b)
c=int(c)
d=int(d)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

taka=C/B
ao=A/D

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

Submission status: Accepted

Solution code:
s=input().split()
th=int(s[0])
ta=int(s[1])
ah=int(s[2])
aa=int(s[3])

while 1:
  ah=ah-ta
  if ah<1:
    print('Yes')
    break
  th=th-aa
  if th<1:
    print('No')
    break