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:
import bisect
import collections
import sys

sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 62


def lmi():
    return list(map(int, input().split()))


def llmi(n):
    return [lmi() for _ in range(n)]


A, B, C, D = lmi()
takahashi = A
aoki = C
i = 0
while takahashi > 0 and aoki > 0:
    if i % 2 == 0:
        aoki -= B
    else:
        takahashi -= D
    i += 1
print("Yes" if aoki <= 0 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce


def input(): return sys.stdin.readline().strip()


def INT(): return int(input())


def MAP(): return map(int, input().split())


def LIST(): return list(map(int, input().split()))


def ZIP(n): return zip(*(MAP() for _ in range(n)))


sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    a, b, c, d = MAP()

    if ceil(a/d) >= ceil(c/b):
        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 = 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())
i=0
while A>0 and C>0:
  if i%2==0:
    C-=B
  else:
    A-=D
  i+=1
if A>0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

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

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())
T = -(-c//b)
A = -(-a//d)
print(["Yes","No"][A<T])

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
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())

kaisu = -(-A//D)

if B*kaisu >= C:
  print("Yes")
else:
  print("No")

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

Submission status: Accepted

Solution code:
T_HP, T_ATK, A_HP, A_ATK = map(int, input().split())

while True:
    A_HP -= T_ATK

    if A_HP <= 0:
        print('Yes')
        break

    T_HP -= A_ATK

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(300):
    if i%2==0:
        c-=b
    else:
        a-=d
    if a<=0:
        print('No')
        exit()
    if c<=0:
        print('Yes')
        exit()

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
sl, sa, kl, ka = map(int, input().split())

winkaisu = math.ceil(kl/sa)
losekaisu = math.ceil(sl/ka)

if winkaisu <= losekaisu:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import math

a,b,c,d = map(int,input().split())
s = math.ceil(c / b)
w = math.ceil(a / d)

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

Submission status: Accepted

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


a, b, c, d = map(int, input().split())
ta = math.ceil(a / d)
ao = math.ceil(c / b)

print('Yes' if ta >= ao else '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
        cnt+=1
    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())
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 A > 0 and B > 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 <= (a-1)//d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def solve():
    h1 = a
    h2 = c
    while(1):
        h2 -= s1
        if h2<=0:
            print("Yes")
            exit()
        h1 -= s2
        if h1<=0:
            print("No")
            exit()


# n = int(input())
a, s1, c, s2 = [int(s) for s in input().split(" ")]
solve()

Submission status: Accepted

Solution code:
import math

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())
for i in range(1000):
    if i%2==0:
        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())

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

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, D = MAP()

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

Submission status: Accepted

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

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

if Flag == True :
    print('Yes')
else :
    print('No')

Submission status: Accepted

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

x = int(c / b) + (c % b > 0)
y = int(a / d) + (a % d > 0) 

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import queue
import copy
import bisect#2分探索
from collections import deque #popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意

def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s): return sorted(range(len(s)), key=lambda k: s[k])

#mod = 10**9+7

#N = int(input())
A, B, C, D = map(int, input().split())
#L = [int(input()) for i in range(N)]
#A = list(map(int, input().split()))
#S = [inputl() for i in range(H)]
#q = queue.Queue() #q.put(i) #q.get() 
#q = queue.LifoQueue() #q.put(i) #q.get() 

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b=copy.deepcopy(a)  #2次元配列はこうコピーする
#w.sort(key=lambda x:x[1],reverse=True)  #二個目の要素で降順並び替え

#素数リスト
# n = 100
# primes = set(range(2, n+1))
# for i in range(2, int(n**0.5+1)):
#     primes.difference_update(range(i*2, n+1, i))
# primes=list(primes)

#bisect.bisect_left(a, 4)#aはソート済みである必要あり。aの中から4未満の位置を返す。rightだと以下
#bisect.insort_left(a, 4)#挿入

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
A,B,C,D = map(int,input().split())
e = (C-1) // B +1
f = (A-1) // D +1
if e <= f:
    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 = [int(i) for i in input().split()]

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
is_taka = True
while A > 0 and C > 0:
    if is_taka:
        C -= B
    else:
        A -= D
    is_taka = not is_taka

ans = ""
if A <= 0:
    ans = "No"
else:
    ans = "Yes"

print(ans)

Submission status: Accepted

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

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

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools

#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().split()))
flag = True
while 0 < A and 0 < C:
  if flag:
    C -= B
  else:
    A -= D
  flag = not flag

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
aoki=c
taka=a
data=0
for i in range(10000):
    if i%2==0:
        aoki-=b
        if aoki<=0:
            data=i
            break
    else:
        taka-=d
        if taka<=0:
            data=i
            break
            
if data%2==0:
    print("Yes")
else:
    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:
from math import ceil
A, B, C, D = map(int,input().split())
t = ceil(C / B)
a = ceil(A / D)
if t <= a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()


def main():
    a, b, c, d = map(int, input().split())
    p = a // d
    q = c // b
    if a % d != 0:
        p += 1
    if c % b != 0:
        q += 1
    
    if p >= q:
        print("Yes")
    elif p < q:
        print("No")
    
    

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
L = [el for el in map(int,input().split())]
A = L[0]
B = L[1]
C = L[2]
D = L[3]
while True:
    C-=B
    if C <= 0:
        print('Yes')
        sys.exit(0)
    A-=D
    if A <= 0:
        print('No')
        sys.exit(0)

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

Submission status: Accepted

Solution code:
a,b,c,d = [int(x) for x in input().split()]
import math
x = math.ceil(c/b)
y = math.ceil(a/d)
if x>y:
    print("No")
else:
    print("Yes")

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

Submission status: Accepted

Solution code:
def main():
    a,b,c,d = tuple([int(t)for t in input().split()])

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

Submission status: Accepted

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

while True:
    #Aの攻撃
    C -= B
    if(C<=0):
        print("Yes")
        break

    #Cの攻撃
    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= list(map(int, input().split()))
for i in range(10000):
    c-=b
    if c<=0:
        print("Yes")
        exit(0)
    a-=d
    if a<=0:
        print("No")
        exit(0)

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:
# coding: utf-8
import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
readline=sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

###################################################
def main():
    A,B,C,D=map(int,input().split())
    for a in range(10000):
        if a%2==0:
            C-=B
            if C<=0:
                print("Yes")
                break
        else:
            A-=D
            if A<=0:
                print("No")
                break
        
main()

Submission status: Accepted

Solution code:
hp1, at1, hp2, at2 = map(int, input().split())

while True:
    hp2 -= at1
    if hp2 <= 0:
        print('Yes')
        break

    hp1 -= at2
    if hp1 <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


def cal(x,y):
    return x//y + (x%y!=0)
# print(cal(c,b) , cal(a,d))
if cal(c,b) <= cal(a,d):
    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 c <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    a,b,c,d = (int(x) for x in input().split())
    i = 1
    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')

if __name__ == '__main__':
    main()

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(lambda x: int(x), input().split(" "))

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

Submission status: Accepted

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

for i in range(100000):
    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())

x = -(-a//d)
y = -(-c//b)
if x >= y:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d = (int(x) for x in input().split())
while 1:
    c -= b
    a -= d
    if c <= 0:
        print("Yes")
        raise SystemExit()
    elif a <= 0:
        print("No")
        raise SystemExit()

Submission status: Accepted

Solution code:
A, B, C, D = [int(n) for n in input().split()]
S = C // B
if C % B != 0:
    S += 1

T = A // D
if A % D != 0:
    T += 1

if T >= S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
#from math import floor, ceil
#from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
#inf = 10**17
#mod = 10**9 + 7
#s=input().rstrip()
a,b,c,d=MI()
for i in range(1000):
    c-=b
    a-=d
    if c<=0:
        print("Yes")
        sys.exit()
    elif a<=0:
        print("No")
        sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

countT = math.ceil(C/B)
countA = math.ceil(A/D)

if countT <= countA:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

flag = True
while (A > 0) & (C > 0):
    if flag:
        C -= B
        flag = False
    else:
        A -= D
        flag = True

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

Submission status: Accepted

Solution code:
import sys
import heapq
from collections import deque

# sys.setrecursionlimit(100001)
INF = sys.maxsize


# ===CODE===
def main():
    a_hp,a_atc,b_hp,b_atc = map(int, input().split())

    while True:
        b_hp -= a_atc

        if b_hp<1:
            print("Yes")
            exit(0)

        a_hp -= b_atc
        if a_hp<1:
            print("No")
            exit(0)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

    ABCD[0] = ABCD[0] - ABCD[3]
    if ABCD[0] <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

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

a = (A + (D-1))//D
c = (C + (B-1))//B

print('Yes'if a >= c else 'No')

Submission status: Accepted

Solution code:
def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

def input_multiple_number_as_list():
    return list(map(int, input().split()))


A,B,C,D = input_multiple_number()

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

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

Submission status: Accepted

Solution code:
a,b,c,d=[int(x) for x in 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] = [int(i) for i in input().split()]
turn = 0
while a > 0 and c > 0:
    if turn % 2 == 0:
        c -= b
    else:
        a -= d
    turn += 1

if turn % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

while True:
  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:
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
takaH, takaA, aokiH, aokiA = map(int, input().split())

while True:
    aokiH -= takaA
    if aokiH <= 0: break
    takaH -= aokiA
    if takaH <= 0: break
if takaH <= 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

# import numpy as np
# from itertools import *
# from collections import *

# S = input().split()
# N = int(input().split())
# K, N = [int(x) for x in input().split()]

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