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_life, t_attack, a_life, a_attack = map(int, input().split())

while t_life >= 0 and a_life >= 0:
    a_life = a_life - t_attack
    if a_life <= 0:
        print('Yes')
        exit()

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

f = False
while a > 0 < c:
    f = not f
    if f:
        c -= b
    else:
        a -= d

if f:
    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:
import math

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

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

if x <= y:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
class Monster:
    def __init__(self, health, strength):
        self.health = health
        self.strength = strength

a = list(map(int, input().split()))

t_monster = Monster(*a[:2])
a_monster = Monster(*a[2:])

i = 0
while t_monster.health > 0 and a_monster.health > 0:
    if i % 2 == 0:
        a_monster.health -= t_monster.strength
    else:
        t_monster.health -= a_monster.strength
    i += 1

if t_monster.health > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c,d = list(map(int, input().split()))
q1,r1 = divmod(c,b)
q2,r2 = divmod(a,d)
tak=q1+min(1,r1)
aoki=q2+min(1,r2)

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

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
while a > 0 and c > 0:
  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())
E = (A +D-1)//D
F = (C +B-1)//B
if E >= F:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
HPa, B, HPc, D = [int(i) for i in input().split()]

while HPa>0:
    HPc = HPc - B
    if HPc <= 0:
        print("Yes")
        break
    else:
        HPa = HPa - D
        if HPa <= 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 = C - B
        count = count + 1
    else:
        A = A - D
        count = count + 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())

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

print("Yes" if x >= y else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

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 math import ceil

A,x,B,y=map(int,input().split())

if ceil(B/x)<=ceil(A/y):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from math import ceil

h_t, s_t, h_a, s_a = map(int, input().split())

count_t = ceil(h_t/s_a)
count_a = ceil(h_a/s_t)

print('Yes' if count_t >= count_a else 'No')

Submission status: Accepted

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

i = 0
while True:
    if i%2 == 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:
import sys
input = sys.stdin.readline

def ceil(a, b):
    if a%b == 0:
        return a//b
    else:
        return (a//b) + 1

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x =list(map(int,input().split()))
y = x[2] - x[1]
z = x[0] - x[3]
if y <= 0:
    print('Yes')
elif z <= 0:
    print('No')
else:
    while True:
        y = y - x[1]
        z = z - x[3]
        if y <= 0 or z <= 0:
            break
    if y <= 0 :
      print('Yes')
    elif y <= 0 and z <= 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:
t_health, t_attack, a_health, a_attack = map(int, input().split())

is_t_turn = True
while(t_health > 0 and a_health > 0):
    if is_t_turn:
        a_health -= t_attack
    else:
        t_health -= a_attack

    is_t_turn = not is_t_turn

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

Submission status: Accepted

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

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

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

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
from math import ceil

h_t,s_t,h_a,s_a = list(map(int, input().split()))

bearable_t = ceil(h_t/s_a)
bearable_a = ceil(h_a/s_t)

if bearable_t >= bearable_a:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
from math import ceil

h_t,s_t,h_a,s_a = list(map(int, input().split()))

bearable_t = ceil(h_t/s_a)
bearable_a = ceil(h_a/s_t)

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

Submission status: Accepted

Solution code:
I=input("").split(" ")
t_HP=int(I[0])
t_att=int(I[1])
a_HP=int(I[2])
a_att=int(I[3])

T_turn =True
while t_HP>0 and a_HP>0:
    if T_turn:
        a_HP=a_HP-t_att
        T_turn=False
    else:
        t_HP=t_HP-a_att
        T_turn=True

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
n=0
k=0
while a>0 :
    a-=d
    n+=1
while c>0:
    c-=b
    k+=1
if n>=k:
    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:
                break
        A -= D
        if A <= 0:
                break

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

Submission status: Accepted

Solution code:
import math
t_health, t_strength, a_health, a_strength = list(map(int, input().split()))

count_a = math.ceil(a_health / t_strength)
count_t = math.ceil(t_health / a_strength)

print("Yes" if count_t >= count_a else "No")

Submission status: Accepted

Solution code:
import math
t_health, t_strength, a_health, a_strength = list(map(int, input().split()))

count_a = math.ceil(a_health / t_strength)
count_t = math.ceil(t_health / a_strength)

if count_a == count_t:
  print("Yes")
else:
  print("Yes" if count_t > count_a else "No")

Submission status: Accepted

Solution code:
thp, ta, ahp, aa = map(int, input().split())

while True:
  ahp -= ta
  if ahp <= 0:
      print("Yes")
      break
  
  thp -= aa
  if thp <= 0:
      print("No")
      break

Submission status: Accepted

Solution code:
import sys
import math

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prl = lambda x: print(*x ,sep='\n')

a,b,c,d = nm()

a_hp = math.ceil(a/d)
b_hp = math.ceil(c/b)

if a_hp >= b_hp:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while True:
    if c <= count * b:
        print('Yes')
        break
    elif a <= count * d:
        print('No')
        break
    count = count + 1

Submission status: Accepted

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

while A > 0 and C > 0:
  C = C - B
  if A <= 0 or C <= 0:
    break;
  A = A - D
  if A <= 0 or C <= 0:
    break;
if A <= 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
  A-=D
if A<=0 and C<=0:
  print("Yes")
elif A<=0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:

import math


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

    TurnToDieA = math.ceil(AHP / BAT)
    TurnToDieB = math.ceil(BHP / AAT)

    if TurnToDieA < TurnToDieB:
        print('No')
    else:
        print('Yes')

resolve()

Submission status: Accepted

Solution code:
a,b,c,d = (int(x) for x in 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:
abcd=list(map(int, input().split()))
[a,b,c,d]=abcd

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(n) for n in 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())

i = 0
while a>0 and c>0:
  if i%2==0:
    c-=b
  else:
    a-=d
  i+=1
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("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())

while True:
    C -= B
    if C <= 0:
        break
    
    A -= D
    if A <= 0:
        break
    

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

Submission status: Accepted

Solution code:
a,b,c,d = (int(x) for x in 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:
    if c-b > 0:
        c -= b
    else:
        print("Yes")
        break
        
    if a-d > 0:
        a -= d
    else:
        print("No")
        break

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
while True:
  c -= b
  a -= d
  if c < 1:
    print("Yes")
    break
  elif a < 1:
    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:
a,b,c,d = map(int,input().split())

aoki_hp = -(-c // b)
taka_hp = -(-a // d)

if aoki_hp > taka_hp:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

def ISI(): return map(int, sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

while a >= 0:
  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 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())
ans="No"
for i in range(100):
    c=c-b
    if c<=0:
        ans="Yes"
        break
    a=a-d
    if a<=0:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

while (a > 0) and (b > 0):
    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())

num1 = math.ceil(c / b)
num2 = math.ceil(a / d)

if num1 <= num2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
 
Takahashi = A
Aoki = C
 
while Takahashi >= 0 or Aoki >=0:
  Aoki -= B
  if Aoki <= 0:
    print('Yes')
    break
  Takahashi -= D
  if Takahashi <= 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())

i = 0
while True:
  if i % 2 == 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())

turn = 1
while True:

    # 高橋くん
    if turn % 2 != 0:
        C = C - B
        pass
    # 青木くん
    else:
        A = A - D
        pass

    if A <= 0 or C <= 0:
        break
    turn += 1

if turn % 2 != 0:
    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')
        exit()
    a = a-d
    if a <= 0 :
        print('No')
        exit()

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    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__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = [ int(i) for i in 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:
th, ta, ah, aa = [int(x) for x in input().split(' ')]

index = 0
while (th > 0 and ah > 0):
    if index % 2 == 0:
        ah -= ta
    else:
        th -= aa

    index += 1

if th <= 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 = map(int, input().split())

Taka = A
Aoki = C

while Taka > 0 and Aoki > 0:
  Aoki -= B
  Taka -= D

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

Submission status: Accepted

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

import math

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

if t <= a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
t_hp_str,t_atack_str,a_hp_str,a_atack_str= input().split()
t_hp = int(t_hp_str)
t_atack = int(t_atack_str)
a_hp=int(a_hp_str)
a_atack = int(a_atack_str)

for num in range(300):
  if num%2 == 0:
    a_hp = a_hp - t_atack
    if a_hp <= 0:
      print("Yes")
      break
  else:
    t_hp = t_hp - a_atack
    if t_hp <= 0:
      print("No")
      break

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b,c,d=map(int,input().split())
    x=-(-c//b)
    y=-(-a//d)
    if x<=y:
        print("Yes")
    else:
        print("No")

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
#A,C:体力, B,D:攻撃力
cnt = 0
while ((A > 0) and (C > 0)):
    if cnt % 2 == 0:
        C -= B
    else:
        A -= D
    cnt += 1

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(101):
    C=C-B
    A=A-D
    if C<=0:
        print('Yes')
        break
    elif A<=0:
        print('No')
        break
    else:
        continue

Submission status: Accepted

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

ans = "Yes"
turn = 1
while(1):
    if turn == 1:
        C -= B
        if C <= 0:
            break
    else:
        A -= D
        if A <= 0:
            ans = "No"
            break
    turn *= -1

print(ans)

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
a,b,c,d=map(int,input().split())
t=0
while True:
  if t==0:
    c-=b
    if c<=0:
      print("Yes")
      break
    t=1
  else:
    a-=d
    if a<=0:
      print("No")
      break
    t=0

Submission status: Accepted

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

tairyoku_a = a # 高橋君の体力
tairyoku_b = c # 青木君の体力

count = 0

while tairyoku_a > 0 and tairyoku_b > 0:
    if count%2 ==0: #高橋くんのターン
        tairyoku_b = tairyoku_b - b
    else: # 青木くんのターン
        tairyoku_a = tairyoku_a - d
    count += 1
    

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

Submission status: Accepted

Solution code:
from math import ceil
A, B, C, D = map(int, input().split())
t_s = ceil(C/B)
a_s = ceil(A/D)

if ( t_s - a_s < 1 ):
  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 -= b
    if a_hp <= 0:
        print('Yes')
        exit(0)
    t_hp -= d
    if t_hp <= 0:
        print("No")
        exit(0)

Submission status: Accepted

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


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

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

while True:
    C -= B
    if C <= 0:
        result = "Yes"
        break

    A -= D
    if A <= 0:
        result = "No"
        break

print(result)

Submission status: Accepted

Solution code:
from math import ceil

a, b, c, d = map(int, input().split())
n_a = ceil(c/b)
n_c = ceil(a/d)

if n_a <= n_c:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#B

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(x) for x in input().split()]
run = True
while run:
    C -= B
    if C <= 0:
        run = False
        result = "Yes"
        continue
    A -= D
    if A <= 0:
        run = False
        result = "No"
        continue
print(result)

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
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
Taka_T,Taka_A,Aoki_T,Aoki_A= map(int, input().split())

while True:
    Aoki_T = Aoki_T - Taka_A
    Taka_T = Taka_T - Aoki_A
    if Aoki_T <= 0:
        print("Yes")
        break
    elif Taka_T <= 0:
        print("No")
        break

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:
def main():
    A,B,C,D=map(int,input().split())
    t=True
    while A>0 and C>0:
        if t: C-=B
        else: A-=D
        t=not t
    if A<=0: print('No')
    elif C<=0: print('Yes')

if __name__=='__main__':
    main()

Submission status: Accepted

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

#小数点に注意
#今回の場合は切り上げすること
n = math.ceil(A / D)
m = math.ceil(C / B)
if n >= m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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

if n > m:
    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:
# -*- coding:utf-8 -*-

a, b, c, d = (int(x) for x in 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:
A,B,C,D=map(int,input().split())
t =0
while True:
  t+=1
  if t%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())

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

Submission status: Accepted

Solution code:
# B
# Battle

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

atack_t = -(-c // b)
atack_a = -(-a // d)
print('No' if atack_t > atack_a else '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')
        quit()

    a -= d

    if (a <= 0):
        print('No')
        quit()

Submission status: Accepted

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

from math import ceil
if ceil(A/D) >= ceil(C/B):
    print("Yes")
    exit()

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math

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

while True:
    C = C - B
    if 0 >= C:
        print('Yes')
        break

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
def main():
    A, B, C, D = map(int, input().split())
    while True:
        C -= B
        if C <= 0:
            print("Yes")
            sys.exit()
        A -= D
        if A <= 0:
            print("No")
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(1000) :
    c=c-b
    if c>0:
        a=a-d
        if a>0:
            continue
        else: #a<=0
            print('No')
            break
    else: #c<=0
        print('Yes')
        break

Submission status: Accepted

Solution code:
import sys
import heapq
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

from math import ceil
A,B,C,D = map(int,input().split())

taka_atk_num = ceil(C/B)
aoki_atk_num = ceil(A/D)

if aoki_atk_num < taka_atk_num:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
print('YNeos'[(c-1)//b>(a-1)//d::2])

Submission status: Accepted

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

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

Submission status: Accepted

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