Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

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

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

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

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

Sample Input 1

10 9 10 10

Sample Output 1

No

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

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

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

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

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

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

else:
  print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces

def main():
    ta,aa,tb,ab = na()
    cnta = (tb-1)//aa + 1
    cntb = (ta - 1)//ab +1
    if cnta <= cntb:
        print("Yes")
    else:
        print("No")
    return

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
taka_hp, taka_att, aoki_hp, aoki_att = map(int, input().split())

while 1:
    aoki_hp -= taka_att
    if aoki_hp <= 0:
        print("Yes")
        break
    
    taka_hp -= aoki_att
    if taka_hp <= 0:
        print("No")
        break

Submission status: Accepted

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

for i in range(10**9):
    C-=B
    if C<=0:
        print("Yes")
        exit()
    A-=D
    if A<=0:
        print("No")
        exit()
    #print(A,B,C,D)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
A,B,C,D=map(int,input().split())
tairyoku=[A,C]
cnt=0
while min(tairyoku)>0:
    if cnt%2==0:
        tairyoku[1]=tairyoku[1]-B
    if cnt%2==1:
        tairyoku[0] = tairyoku[0] - D
    cnt=cnt+1
if tairyoku[0]<=0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

flag = 0
T = 1

while flag == 0:
    if T == 1:
        C = C - B
        T = 0
        if C <= 0:
            flag = 1
    else:
        A = A - D
        T = 1
        if A <= 0:
            flag = 2

if T == 1:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

print(battle(A,B,C,D))

Submission status: Accepted

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

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

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


if num_t <= num_a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys

A, B, C, D = [int(x) for x in stdin.readline().rstrip().split()]
# N, M = [int(x) for x in stdin.readline().rstrip().split()]
# U = input().split()
# A, B = [str(x) for x in stdin.readline().rstrip().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:
import math

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

t = A / D
a = C / B

if math.ceil(t) >= math.ceil(a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


while(1):

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

e = 0
while True:
    if e % 2 == 0:
      c -= b
      e += 1
    elif e % 2 == 1:
      a -= d
      e += 1

    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())
flag = 0
while True:
  if flag ==0:
    c -= b
    if c <= 0:
      print('Yes')
      break
    flag = 1
  else:
    a -= d
    if a <= 0:
      print('No')
      break
    flag = 0

Submission status: Accepted

Solution code:
import sys
import math
a, b, c, d = map(int, sys.stdin.readline().split())
if math.ceil(a/d) >= math.ceil(c/b):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

a,b,c,d=n1()

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

Submission status: Accepted

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

Submission status: Accepted

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

def battle(a,b,c,d):
    while True:
        if c-b <= 0:
            return 'Yes'
        c -= b
        if a-d <= 0:
            return 'No'
        a -= d

print(battle(a,b,c,d))

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if ((a - 1) // d) >= ((c - 1) // b):
    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:
def resolve():
    A,B,C,D = map(int,input().split())

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

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





if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        flg = True
        break
    a -= d
    if a <= 0:
        flg = False
        break
    
if not flg:
    print('No')

else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

A, B, C, D = map(int, read().split())
taka = (A + D-1) // D
ao = (C+B-1) // B

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
ta = 0
ao = 0
if c % b == 0:
    ta = c//b
else:
    ta = c//b + 1

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

if ao < ta:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

takahasi = a
aoki = c
flag = True
while True:
    if takahasi <= 0:
        print("No")
        break
    elif aoki <= 0:
        print("Yes")
        break
    elif flag:
        aoki -= b
        flag = False
    else:
        takahasi -= d
        flag = True

Submission status: Accepted

Solution code:
#


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

ta = ceil(a / d)
ao = ceil(c / b)

print("Yes" if ta >= ao else "No")

Submission status: Accepted

Solution code:
A,B,C,D = [int(_n) for _n in input().split()]
taka = C // B + (0 if C % B == 0 else 1)
aoki = A // D + (0 if A % D == 0 else 1)
# print(taka)
# print(aoki)
print("Yes" if taka <= aoki else "No")

Submission status: Accepted

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

t = math.ceil(c/b)
o = math.ceil(a/d)

if t <= o:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = list(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:
#!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _ia(): return map(int, sys.stdin.readline().strip().split())


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


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

Submission status: Accepted

Solution code:
import sys
import math
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b, c, d = map(int, input().split())
    takahashi = math.ceil(c / b)
    aoki = math.ceil(a / d)

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import collections
from collections import defaultdict
import math
import numpy as np
 
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:
# n = int(input())
a, b, c, d = map(int, input().split())
# x = list(map(int, input().split()))
i = 0
while True:
    if i%2 == 0:
        c -= b
        if c<=0:
            print("Yes")
            exit()
    else:
        a -= d
        if a<=0:
            print("No")
            exit()
    i += 1

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    a,b,c,d = readInts()
    while True:
        c -= b
        #print(a)
        if c <= 0:
            print('Yes')
            exit()
        a -= d
        #print(b)
        if a <= 0:
            print('No')
            exit()
if __name__ == '__main__':
  main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2, log10, pi
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


def lcm(a, b):
    return (a*b) // gcd(a,b)

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __radd__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x + self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x + self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rsub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x - self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x - self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rmul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __rtruediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((other.__x * self.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((other.__x * self.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")

    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __rpow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(other.__x, self.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(other.__x, self.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")

    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x
    def __str__(self):
        return str(self.__x)



if __name__ == '__main__':
    A, B, C, D = mulinputs()

    # 出力
    for _ in range(100):
        if B >= C:
            print('Yes')
            exit()
        else:
            C -= B
        if D >= A:
            print('No')
            exit()
        else:
            A -= D

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:
def calc(A,B,C,D):
    while A > 0 and C > 0:
        C = C - B
        if C <= 0:
            return 'Yes'
        A = A - D
        if A <= 0:
            return 'No'

(A,B,C,D) = tuple([int(s) for s in input().split()])
print(calc(A,B,C,D))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

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

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

Submission status: Accepted

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

        a -= d
        if a <= 0:
            print("No")
            return


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

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
while(True):
    C -= B
    if A <= 0:
        print("No")
        break
    A -= D
    if C <= 0:
        print("Yes")
        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:
    a-=d
  else:
    ans='Yes'
  if a<=0:
    ans='No'
print(ans)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
tt = C // B + 1
ta = A // D + 1
if C % B == 0:
    tt -= 1
if A % D == 0:
    ta -= 1

print('Yes' if tt <= ta else 'No')

Submission status: Accepted

Solution code:
hp, atk, e_hp, e_atk = map(int, input().split())

count = 1
while hp > 0 and e_hp > 0 :
  if count % 2 == 1:
    e_hp -= atk 
  else:
    hp -= e_atk
  count += 1

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

Submission status: Accepted

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

for _ in range(1000):
    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
    A = A - D
    if A <= 0:
        print("No")
        break

Submission status: Accepted

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

ta = c//b if c % b == 0 else c//b + 1
aa = a//d if a % d == 0 else a//d + 1

print('No' if ta > aa 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")
        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(1000):
  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())

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

print(solve(a,b,c,d))

Submission status: Accepted

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10 ** 6)
    input = sys.stdin.readline
    A, B, C, D = [int(x) for x in input().strip().split()]
    t = 0
    while A > 0 and B > 0:
        if t == 0:
            C -= B
        else:
            A -= D
        if A <= 0:
            print('No')
            exit()
        elif C <= 0:
            print('Yes')
            exit()
        t ^= 1


if __name__ == '__main__':
    main()

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:
import math
THP,TA,AHP,AA = map(int,input().split())
T = math.ceil(AHP/TA)
A = math.ceil(THP/AA)
print("YNeos"[T > A ::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**6)
readline = sys.stdin.readline

def main():
    A, B, C, D = map(int, readline().split())
    while True:
        C -= B
        if C <= 0:
            ans = 'Yes'
            break
        A -= D
        if A <= 0:
            ans = 'No'
            break

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int, D: int):
    while True:
        C -= B
        if C <= 0:
            print("Yes")
            break
        A -= D
        if A <= 0:
            print("No")
            break
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,C,D=[int(i) for i 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 = input().split(" ")
A, B, C, D = int(A), int(B), int(C), int(D)

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

a, b, c, d = MAP()

turn = 0
while a > 0 and c > 0:
    if turn % 2 == 0:
        c -= b
    else:
        a -= d
    turn = 1 - turn
if a > 0:
    Yes()
else:
    No()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, B, C, D = map(int, input().split())
a = math.ceil(A / D)
t = 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())
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 = True
while A > 0 and C > 0:
    if t:
        C -= B
    else:
        A -= D
    t = not t
if A > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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


resolve()

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:
th, ta, ah, aa = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

player= [[a,b],[c,d]]

turn = 0

while player[0][0] > 0 and player[1][0] > 0:
    opp = 1-turn
    player[opp][0] -= player[turn][1]
    turn = opp

if player[0][0] <= 0:
    print("No")
else:
    print("Yes")