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

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

Submission status: Accepted

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

i = 0
while True:
    if a <= 0:
        print('No')
        exit()
    elif c <= 0:
        print('Yes')
        exit()
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    i += 1

Submission status: Accepted

Solution code:
a, b, c, d = [int(i) for i in input().split()]

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

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

Submission status: Accepted

Solution code:
import math


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

Submission status: Accepted

Solution code:
import sys

a, b, c, d = map(int, sys.stdin.readline().split())

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__':
    main(a, b, c, d)

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:
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:
## coding: UTF-8
from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
import math


s = input().split()
p = [int(w) for w in s] #これで勝手にNまで拾ってくれます


A = p[0]
B = p[1]
C = p[2]
D = p[3]

mode = 'Tattack'
while (A>0 and C>0):
    if(mode == 'Tattack'):
        C = C-B
        mode = 'Aattack'
    else:
        A = A-D 
        mode = 'Tattack'

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

a = A // D
c = C // B

if A % D != 0:
    a += 1
if C % B != 0:
    c += 1

if a >= c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if -(-c//b)<=-(-a//d):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

i = 0

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

    i += 1

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

if c <= 0:
    print('Yes')

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

turn = 1
while True:
    if turn == 1:
        c -= b
        if c <= 0:
            print("Yes")
            break
    else:
        a -= d
        if a <= 0:
            print("No")
            break
    turn = (turn + 1) % 2

Submission status: Accepted

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

import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    a, b, c, d = read_list(int)
    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())

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

Submission status: Accepted

Solution code:
t_HP,t_AT,a_HP,a_AT=map(int,input().split())
while 1:
    a_HP-=t_AT

    if a_HP<=0:
        print("Yes")
        exit()

    t_HP-=a_AT
    
    if t_HP<=0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c,d = m()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if takahashi>=aoki:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
INF = 10**10
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 = [int(e) for e 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 = list(map(int, input().split()))
a = A
c = C
is_t = True
while True:
    c -= B
    if c <= 0:
        break
    a -= D
    if a <= 0:
        is_t = False
        break
ans = "Yes" if is_t else "No"
print(ans)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

B,A,D,C= inputIL()

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

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

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:
from math import ceil
A, B, C, D = map(int, input().split())
a = ceil(A/ D)
b = ceil(C/ B)
if b > a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c, d = map(int, input().split())
for i in range(210):
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print('Yes')
            exit()
    else:
        a -= d
        if a <= 0:
            print('No')
            exit()

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
	else:
		a-=d
	turn=(turn+1)%2

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

Submission status: Accepted

Solution code:
A,B,C,D = [int(i) for i in input().split(" ")]

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

Submission status: Accepted

Solution code:
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:
a,b,c,d = 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:
#!/usr/bin/env python3

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
input = raw_input

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

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

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

if r1 == r2:
    out = "Yes"
elif r1 > r2:
    out = "Yes"
else:
    out = "No"

print(out)

Submission status: Accepted

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

T = -(-A // D)
AO = -(-C // B)

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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

while(A > 0 and C > 0):
    C -= B
    if (C > 0):
        A -= D
    else:
        break

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
while 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 k in range(200):
    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 = [int(elem) for elem in input().split()]

if c % b != 0:
    turn1 = (c // b) + 1
else:
    turn1 = (c // b)
if a % d != 0:
    turn2 = (a // d) + 1
else:
    turn2 = (a // d)
    
if turn1 <= turn2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    #n=int(input())
    a,b,c,d= map(int, sys.stdin.readline().split(' '))
    f=1
    while(1):
        if(f):
            c-=b
            if(c<=0):
                break
        else:
            a-=d
            if(a<=0):
                break
        f=f^1
    if(a<=0):
        print("No")
    else:
        print("Yes")
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import keyword

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

a,b,c,d = NextInts()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？


a,b,c,d=mii()
cnt=0
while a>0 and c>0:
    if cnt%2==0:
        c-=b
    else:
        a-=d
    cnt+=1

if a>c:
    print("Yes")
else:
    print("No")

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)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = [int(x) for x in input().split()]
    while A > 0 and C > 0:
        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:
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
    A,B,C,D=pin()
    turn=0
    while(1):
        if turn%2 ==0:#takahashiatacck
            C-=B
        else:
            A-=D
        if C<1 or A<1:
            
            print((["No","Yes"][turn%2==0]))
            break
        turn+=1
        
#%%submit!
resolve()

Submission status: Accepted

Solution code:
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
if A <= 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:

import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

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

taka = -(-a//d)
ao = -(-c//b)


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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    c-=b
    if c<=0:
        break
    a-=d
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:
        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 = (a + d - 1) // d
A = (c + b - 1) // b

print("Yes" if T >= A else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc164/tasks/abc164_b

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:
import sys
input = lambda: sys.stdin.readline().rstrip()
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())

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

print("Yes") if taka <= ao else print("No")

Submission status: Accepted

Solution code:
import sys
import math
# input処理を高速化する
input = sys.stdin.readline

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

while True:
    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:
from sys import stdin
from sys import setrecursionlimit
import math
setrecursionlimit(10 ** 7)

a,b,c,d = map(int,stdin.readline().rstrip().split())

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

Submission status: Accepted

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

u=1
while a>0 and c>0:
	if u:
		c-=b
	else:
		a-=d
	u=1-u
if a>0:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

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

    if a <= 0:
        print("No")
        break
    elif c <= 0:
        print("Yes")
        break
    i += 1

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 sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    A,B,C,D = mis()
    while True:
        C -= B
        if C<=0:
            print('Yes')
            break
        A -= D
        if A<=0:
            print('No')
            break




main()

Submission status: Accepted

Solution code:
import math

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

if x<=y:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import math


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


def main():
    A, B, C, D = map(int, input().split())
    T = math.ceil(C / B)
    Aoki = math.ceil(A / D)

    if Aoki + 1 <= T:
        print("No")
    else:
        print("Yes")


if __name__ == "__main__":
    main()

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