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

Submission status: Accepted

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

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())
ff = 1
while a>0 or c>0:
  if a <= 0 or c<= 0:
        break
  if ff%2 == 0:
        a = a-d
        ff = ff+1
  else:
     c =c-b
     ff = ff+1
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=c-b
    a=a-d
    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 or C >0):
    C = C-B
    if C <= 0:
        print('Yes')
        break
    A = A-D
    if A <= 0:
        print('No')
        break

Submission status: Accepted

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

while 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())
N=0
M=0
while C>0:
    C -= B
    N += 1
while A>0:
    A -= D
    M += 1
if N<=M:
    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=c-b
    a=a-d
    if c<=0:
        print('Yes')
    elif a<=0:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-27 10:46
# @url:https://atcoder.jp/contests/abc164/tasks/abc164_b
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
# region fastio

BUFSIZE = 8192

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


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
def main():
    nums=list(map(int,input().split()))
    a,b,c,d=nums[0],nums[1],nums[2],nums[3]
    if math.ceil(a/d)>=math.ceil(c/b):
        print ("Yes")
    else:
        print ("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

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

while h1 >= 0 and h2 >= 0 :

    h2 -= s1
    if h2 <= 0 :
        break
    h1 -= s2
    if h1 <= 0 :
        break

#print(h1 , h2)

if h1 > h2 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

flag = 1
while True:
    if flag > 0:
        c -= b
        if c <= 0:
            break
    else:
        a -= d
        if a <= 0:
            break
    flag = flag * (-1)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
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 -*-
"""
Spyderエディタ

これは一時的なスクリプトファイルです
"""

strT, pwT, strA, pwA = map(int, input().split())

while strT > 0 or strA > 0:
    strA -= pwT
    if strA <= 0:
        break
    strT -= pwA

if strT > 0:
    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')
    break
  else:
    a -= d
    if a<=0:
      print('No')
      break

Submission status: Accepted

Solution code:
ad,ao,bd,bo=map(float,input().split())
aTurn=int(ad/bo)+0.5
bTurn=int(bd/ao)
if ad%bo==0:
  aTurn -= 1
if bd%ao==0:
  bTurn -= 1
  
if aTurn>bTurn:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

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

turn = 0
while (a>0 and c>0):
    if(turn %2 == 0): # takahashi
        c -= b
    else:
        a -= d
    turn += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

while True:
  c -= b
  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())
thp = (a + d - 1) // d
ahp = (c + b - 1) // b
print('Yes' if thp >= ahp else 'No')

Submission status: Accepted

Solution code:
h_1,a_1,h_2,a_2 = map(int,input().split())

h_2//a_1
h_1//a_2

if h_2%a_1!=0 and h_1%a_2!=0:
    if h_2//a_1 <= h_1//a_2:
        print("Yes")
    else:
        print("No")
elif h_2%a_1!=0 and h_1%a_2==0:
    if h_2//a_1+1 < h_1//a_2:
        print("Yes")
    else:
        print("No")
elif h_2%a_1==0 and h_1%a_2!=0:
    if h_2//a_1 <= h_1//a_2+1:
        print("Yes")
    else:
        print("No")
else:
    if h_2//a_1 <= h_1//a_2:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
t_tairyoku, t_kougeki, a_tairyoku, a_kougeki = map(int, input().split())

winner=""
while True:
    a_tairyoku = a_tairyoku-t_kougeki
    if a_tairyoku <= 0:
        winner="takahashi"
        break
    t_tairyoku = t_tairyoku-a_kougeki
    if t_tairyoku <= 0:
        winner ="aoki"
        break

if winner == "takahashi":
    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:
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:
args = input().split()

a = int(args[0])
b = int(args[1])
c = int(args[2])
d = int(args[3])

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

Submission status: Accepted

Solution code:
#n=int(input())
a,b,c,d=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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

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

for i in range(1000):
    if i % 2 == 0:
        C -= B
    else:
        A -= D

    if min(A, C) <= 0:
        print('Yes' if i % 2 == 0 else '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())

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

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

if attack_a >= attack_t:
    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:
t_hp,t_at,a_hp,a_at=map(int,input().split())
while(t_hp > 0 and a_hp > 0):
  a_hp -= t_at
  if a_hp <= 0:
    print("Yes")
    break
  t_hp -= a_at
  if t_hp <= 0:
         print("No")
         break

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    a, b, c, d = map(int, input().split())
    x = (a+d-1)//d
    y = (c+b-1)//b
    if x >= y:
        print('Yes')
    else:
        print('No')
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
  elif c > 0:
    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 -= B
  if C <= 0:
    print('Yes')
    exit();
  else:
    A -= D
    
  if A <= 0:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t_t,t_a,a_t,a_a=map(int,input().split())

for i in range(101):
    a_t -= t_a
    if a_t <= 0:
        print('Yes')
        break

    t_t -= a_a
    if t_t <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

taka = (a - 1 + d) // d
aoki = (c - 1 + b) // b

if taka < aoki:
    ans = "No"
else:
    ans = "Yes"

print(ans)

Submission status: Accepted

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

p=math.ceil(a/d)
q=math.ceil(c/b)

if p>=q:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
while a or c:
    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())
takahashi = -(-a // d)
aoki = -(-c // b)
print("Yes") if takahashi >= aoki else print("No")

Submission status: Accepted

Solution code:
hT, sT, hA, sA = map(int, input().split())
win = ''
while True:
    hA = hA-sT
    if hA <= 0:
        win = 'Yes'
        break
    hT = hT - sA
    if hT <= 0:
        win = 'No'
        break
print(win)

Submission status: Accepted

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

a, b, c, d = map(int, input().split())
while a > 0 or 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())
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())
cnt = 0
while True:
    if cnt % 2 == 0:
        c -= b
    else:
        a -= d
    cnt += 1
    if c <= 0:
        print("Yes")
        break
    elif a <= 0:
        print("No")
        break

Submission status: Accepted

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

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

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

print( "Yes" if a > 0 else "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 a <= 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')
    exit()
  a -= d
  if a<=0:
    print('No')
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
a,b,c,d=I()
x=(a//d)+(1 if a%d else 0)
y=(c//b)+(1 if c%b else 0)
if x==y:
    print('Yes')
elif x<y:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# while文を使うパターン(本番では書けず、あとで修正したもの)
a, b, c, d = map(int, input().split())


turn = 0

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

# どちらかが0以下になった時点で止まるので最後のターンがどちらかを判別
if turn % 2 != 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
    a -= d

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

Submission status: Accepted

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

d1 = A // D + 1
if A % D == 0:
  d1 -= 1

d2 = C // B + 1
if C % B == 0:
  d2 -= 1

  
if d1 >= d2:
  print ("Yes")
else:
  print ("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a, b, c, d = map(int,input().split())
    takahashi = (c - 1) // b
    aoki = (a - 1) // d
    print("Yes" if takahashi <= aoki else "No")
resolve()

Submission status: Accepted

Solution code:
h1, a1, h2, a2 = map(int, input().split())

n1 = h1//a2 + (h1%a2 != 0)
n2 = h2//a1 + (h2%a1 != 0)

if n2 <= n1:
    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 += 1
if a % d != 0:
  aoki += 1
if takahashi <= aoki:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
A,B,C,D=map(int,input().split())
while 1:
  C=C-B
  if C<1:
    print("Yes")
    sys.exit()
  A=A-D
  if A<1:
    print("No")
    sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
TH, TS, AH, AS = [int(s) for s in input().split(" ")]
turn = True
while True:
  if turn:
    AH -= TS
    if AH <= 0:
      print('Yes')
      break
    turn = not turn
  else:
    TH -= AS
    if TH <= 0:
      print('No')
      break
    turn = not turn

Submission status: Accepted

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

x = (A + D - 1) // D
y = (C + B - 1) // B
if x >= y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tkhp, tkat, aohp, aoat = list(map(int, input().split()))

while True:
    aohp -= tkat
    if aohp <= 0:
        print("Yes")
        break

    tkhp -= aoat
    if tkhp <= 0:
        print("No")
        break

Submission status: Accepted

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

T = -1*(-1*c//(b))
A = -1*(-1*a//(d))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(a, b, c, d):
    while True:
        c -= b
        if c <= 0:
            return "Yes"
        a -= d
        if a <= 0:
            return "No"


def main():
    a, b, c, d = map(int, input().split())
    res = solve(a, b, c, d)
    print(res)


def test():
    assert solve(10, 9, 10, 10) == "No"
    assert solve(46, 4, 40, 5) == "Yes"


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

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

    return 0

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
num = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる

N=num[2]/num[1]

if(N==int(N)):
    N=int(N)-1
else:
    N=int(N)

if(N*num[3]<num[0]):
    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:
        print("Yes")
        break
    A=A-D
    if A<=0:
        print("No")
        break

Submission status: Accepted

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

if (c+b-1)//b > (a+d-1)//d :
    print('No');
else :
    print('Yes');

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


A, B, C, D = MI()
t = -(-C // B)
a = -(-A // D)
print('Yes' if t <= a else 'No')

Submission status: Accepted

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

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:
T, TA, A, AA = map(int, input().split())
TTime = T // AA if T % AA == 0 else T // AA + 1
ATime = A // TA if A % TA == 0 else A // TA + 1
print('Yes' if TTime >= ATime else 'No')

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:
#ABC164 B
p = [int(x) for x in input().split()]

takahashi_turn = True
while (p[0]>0) and (p[2]>0):
    if takahashi_turn:
        p[2] = p[2] - p[1]
    else:
        p[0] = p[0] - p[3]
    takahashi_turn = not takahashi_turn

if p[0] > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def Sol(taka_health,taka_stregnth,aoki_health,aoki_stregnth):
    
    if taka_health%aoki_stregnth != 0:
        moves_taka = int(taka_health/aoki_stregnth) + 1
    else:
        moves_taka = int(taka_health/aoki_stregnth)
    
    if aoki_health%taka_stregnth != 0:
        moves_aoki =int(aoki_health/taka_stregnth) + 1
    else:
        moves_aoki = int(aoki_health/taka_stregnth)
    
    if moves_taka >= moves_aoki:
        print("Yes")
    else:
        print("No")
    return

    

#for t in range(int(input())):
n,k,d,c = map(int,input().split())
#n = int(input())
#arr = []
#for i in range(n):
#    time = list(map(int,input().split()))
#    time = time[0] + (time[1]/60)
#    arr.append(time)
#arr = list(map(int,input().split()))
#k = input()
#n = int(input())
Sol(n,k,d,c)

Submission status: Accepted

Solution code:
taka_hp, taka_atk, aoki_hp, aoki_atk = [int(x) for x in input().split()]
a = False
while a == False:
    aoki_hp -= taka_atk
    if aoki_hp <= 0:
        a = True
        print('Yes')
        break
    taka_hp -= aoki_atk
    if taka_hp <= 0:
        a = True
        print('No')
        break

Submission status: Accepted

Solution code:
TAKA_HP, TAKA_POW, AOKI_HP, AOKI_POW = [int(i) for i in input().split(" ")]

taka = True
while True:
    if taka:
        AOKI_HP -= TAKA_POW
        if AOKI_HP <= 0:
            print("Yes")
            exit()
        taka = False
        continue
    else:
        TAKA_HP -= AOKI_POW
        if TAKA_HP <= 0:
            print("No")
            exit()
        taka = True
        continue

Submission status: Accepted

Solution code:
a_life, a_attk, b_life, b_attk = [int(i) for i in input().split()]

i = 0
while(True):
  if i % 2 == 0:
    b_life -= a_attk
  else:
    a_life -= b_attk
  i += 1
  if b_life <= 0:
    print("Yes")
    break
  elif a_life <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
thp, tap, ahp, aap = map(int, input().split())

x = (thp + aap - 1) // aap
y = (ahp + tap - 1) // tap

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

Submission status: Accepted

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

ans_1 = math.ceil(c / b)
ans_2 = math.ceil(a / d)

#print(ans_1,ans_2)
if ans_1 > ans_2:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
taka = [a,b]
ao = [c,d]
flag = True

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

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

Submission status: Accepted

Solution code:
test = list(map(int, input().split()))
A = test[0] #体力
B = test[1] #攻撃
C = test[2] #体力
D = test[3] #攻撃
flag = True
while flag:
    C -= B
    if C <=0:
        print('Yes')
        flag = False
        break
    A -= D
    if A <= 0:
        print('No')
        flag = False
        break

Submission status: Accepted

Solution code:
thp, tap, ahp, aap = map(int, input().split())

while True:
    ahp -= tap
    if ahp > 0:
        thp -= aap
    else:
        print('Yes')
        break

    if thp <= 0:
        print('No')
        break

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stderr
from math import ceil

a_takahashi_hp, b_takahashi_attack, c_aoki_hp, c_aoki_attack = map(int, input().split())

takahashi_died_turn_at = ceil(a_takahashi_hp / c_aoki_attack) * 2
aoki_died_turn_at = ceil(c_aoki_hp / b_takahashi_attack) * 2 - 1

print(takahashi_died_turn_at, aoki_died_turn_at, file=stderr)

print('Yes' if takahashi_died_turn_at > aoki_died_turn_at else 'No')

Submission status: Accepted

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

Submission status: Accepted

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