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:
ht,st,ha,sa=map(int,input().split())
while(ht>0 and ha>0):
    ha-=st
    if ha<=0:
        print("Yes")
        break
    ht-=sa
    if ht<=0:
        print("No")
        break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
A, B, C, D = map(int, input().split())
# 文字列の入力
#s = input()
#print(s[0:K-1]+s[K-1].lower()+s[K:N])

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
turn_t = c//b
if c %  b!= 0:
    turn_t += 1
turn_a = a//d 
if a % d != 0:
    turn_a += 1
if turn_a >= turn_t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
line = input().split(" ")

hp_t = int(line[0])
at_t = int(line[1])
hp_a = int(line[2])
at_a = int(line[3])

hp_now_t = hp_t
hp_now_a = hp_a

while(1):
  hp_now_a = hp_now_a - at_t
  if hp_now_a <= 0:
    print("Yes")
    break
  hp_now_t = hp_now_t - at_a
  if hp_now_t<= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
A, B, C, D = (int(x) for x in input().split())

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

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

Submission status: Accepted

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

takahashi_iter = 0
while 1:
  tmp[2] -= tmp[1]
  takahashi_iter += 1
  if tmp[2] <= 0:
    break
  
aoki_iter = 0
while 1:
  tmp[0] -= tmp[3]
  aoki_iter += 1
  if tmp[0] <= 0:
    break
    
if takahashi_iter <= aoki_iter:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

while h1 -s2>0 or h2-s1>0:
    h2 -= s1
    h1 -= s2
print('Yes' if h1>0 else 'No')

Submission status: Accepted

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

    if flg1:
        print("Yes")
        exit()
    if flg2:
        print("No")
        exit()

Submission status: Accepted

Solution code:
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)
# import numpy as np

inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""
from collections import deque, defaultdict, Counter
import math
import sys
sys.setrecursionlimit(10 ** 7)


def wi(): return list(map(int, sys.stdin.readline().split()))
# WideIntPoint


def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def ws(): return sys.stdin.readline().split()


def si(): return int(sys.stdin.readline())  # SingleInt


def ss(): return input()


def hi(n): return [si() for _ in range(n)]


def hs(n): return [ss() for _ in range(n)]  # HeightString


def s_list(): return list(input())


def mi(n): return [wi() for _ in range(n)]  # MatrixInt


def mip(n): return [wip() for _ in range(n)]


def ms(n): return [ws() for _ in range(n)]


def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[
    0]] for _ in range(n)]  # NumberGrid


def grid(n): return [s_list() for _ in range(n)]


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

# a/b の切り上げ


def round_up(a, b):
    """ a/b の切り上げ """
    c = (a + b - 1) / b
    return c


def lcm(a, b):
    """a,bの最小公倍数"""
    return a * b // gcd(a, b)


def main():
    a, b, c, d = wi()
    for i in range(10000):
        c -= b
        if c <= 0:
            print('Yes')
            sys.exit()
        a -= d
        if a <= 0:
            print('No')
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

while True:
    c -= b
    a -= d

    if c <= 0:
        print('Yes')
        exit(0)
    if a <= 0 and c > 0:
        print('No')
        exit(0)

Submission status: Accepted

Solution code:
import math


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

    takagi = math.ceil(C / B)
    aoki = math.ceil(A / D)

    # print(takagi, ':', aoki)
    if takagi <= aoki:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print("No") if (math.ceil(Ta)<math.ceil(Ao)) else print("Yes")

Submission status: Accepted

Solution code:
A,B,C,D= list(map(int, input().split()))
i = 0
k = 0
while A > 0 and C > 0:
    C -= B
    i += 1
    if C <= 0:
        break
    A -= D
    k += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

a,b,c,d = [int(i) for i in read().split()]

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

Submission status: Accepted

Solution code:
HP_1,PW_1,HP_2,PW_2=map(int,input().split())

turn = 0

while 0 < HP_1 and 0 < HP_2:
	if turn % 2 == 0:
		HP_2 -= PW_1
	else:
		HP_1 -= PW_2
	turn += 1

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

print(ans)

Submission status: Accepted

Solution code:
a, b, c, d = (int(each) for each in input().split())
while a > 0 and c > 0:
    c -= b
    # print(c)
    if c <= 0:
        print('Yes')
        break
    a -= d
    # print(a)
    if a <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

ans = 'Yes'

end = False
while not end:
  c -= b
  if c <= 0:
    end = True
  if end != True:
    a -= d
    if a <= 0:
      ans = 'No'
      end = True
  # print(a, c)

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Apr 26 20:57:33 2020
"""

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

#N = int(input())
a,b,c,d = map(int,input().split())
#A = list(map(int,input().split()))

counta = 0
ans = 0
while a > 0 and c > 0:
    if counta % 2 == 0:
        c -= b
        ans = 'Yes'
    else:
        a -= d
        ans = 'No'
    counta += 1
#    print(a,b,c,d,ans)

print(ans)

Submission status: Accepted

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

N=-(-c//b)
M=-(-a//d)

if N<=M:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if C%B == 0:
    X = C//B - 1
else:
    X = C//B
if A%D == 0:
    Y = A//D -1
else:
    Y = A//D

if Y>=X:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math
i = list(map(int, input().split()))
a=math.ceil(i[0]/i[3])
b=math.ceil(i[2]/i[1])
if a<b:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

def calc_attacks(HP, AT):
    q, mod = divmod(HP, AT)
    if mod != 0:
        q += 1
    return q
tkh = calc_attacks(A, D)
aok = calc_attacks(C, B)
if tkh >= aok:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

t = math.ceil(c/b) - 1

if d*t >= a:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
[A, B, C, D] = input().split(' ')
A = int(A)  # health
B = int(B)  # strength
C = int(C)  # health
D = int(D)  # strength

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

    if turn == 0:
        C = C - B
        turn = 1
    else:
        A = A - D
        turn = 0

Submission status: Accepted

Solution code:
# Problem B
a, b, c, d = input().split(' ')
hp_takahashi = int(a)
at_takahashi = int(b)
hp_aoki = int(c)
at_aoki = int(d)

while hp_takahashi > 0 and hp_aoki > 0:
    hp_aoki -= at_takahashi
    if hp_aoki <= 0:
        print('Yes')
        break
    hp_takahashi -= at_aoki
    if hp_takahashi <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil


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

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

Submission status: Accepted

Solution code:
tkhs,b,aok,d = map(int, input().split())


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

Submission status: Accepted

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

hp = l[0]
attack = l[1]
hp2= l[2]
attack2 = l[3]

while 1 == 1:
    hp2 -= attack
    if hp2 <= 0:
        print("Yes")
        break
    hp -= attack2
    if hp <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('Yes' if math.ceil(C/B) <= math.ceil(A/D) else 'No')

Submission status: Accepted

Solution code:
import math
a = list(map(int,input().split()))
b = math.ceil(a[2]/a[1])
c = math.ceil(a[0]/a[3])
if b<=c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

for i in range(999999):
    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(10**6)
input = sys.stdin.buffer.readline
# arr = [[int(el) for el in input().split()] for i in range(n)]

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

def solve(a, b, c, d):

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

        # print (a, c)

    return a > 0

ans = solve(a, b, c, d)

if ans:
    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
  else:
    break

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

i = 0

while A > 0 or C > 0:
    if i % 2 == 0:
        C = C - B
    else:
        A = A - D

    if A <= 0:
        print('No')
        break
    elif C <= 0:
        print('Yes')
        break

    i+=1

Submission status: Accepted

Solution code:
thp, tat, ahp, aat = map(int, input().split())

while True:
    ahp = ahp - tat
    thp = thp - aat
    if ahp <= 0:
        print("Yes")
        break
    elif thp <= 0:
        print("No")
        break
    else:
        continue

Submission status: Accepted

Solution code:
def retm(a,b):
  if a%b>0:
    return 1
  else:
    return 0

th,ta,ah,aa=map(int,input().split())
if int(ah/ta)+retm(ah,ta)<=int(th/aa)+retm(th,aa):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while B >= 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())
taka = (A - 1) // D + 1
aoki = (C - 1)  // B + 1

if taka >= aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

while True:
    c -= b

    if c <= 0:
        print("Yes")
        break

    a -= d

    if a <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split(' '))
count1 = 0
while A > 0:#先攻高橋のモンスターが死ぬまでの回数
    A -= D
    count1 += 1
count2 = 0
while C > 0:#後攻青木のモンスターが死ぬまでの回数
    C -= B
    count２ += 1 
if count1>count2:
    #青木のモンスターが先死んだ→高橋の勝ち
    print('Yes')
elif count1<count2:
    print("No")
elif count1 == count2:
    print("Yes")

Submission status: Accepted

Solution code:
A,B,C,D=map(int, input().split())
taka=0
ao=0
if C%B==0:
    taka=C//B
else:
    taka=C//B+1
if A%D==0:
    ao=A//D
else:
    ao=A//D+1

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
takahashi=-(-a[0] // a[3])
aoki=-(-a[2] // a[1])
if(takahashi>=aoki):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
t_hp, t_at, a_hp, a_at = map(int,input().split())

while True:
    a_hp -= t_at
    if 0 >= a_hp:
        print('Yes')
        break
    t_hp -= a_at
    if 0 >= t_hp:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
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:
inp = list(map(int, input().split()))

while(1):
    inp[2] -= inp[1]
    if inp[2] <= 0:
        print('Yes')
        break
    inp[0] -= inp[3]
    if inp[0] <= 0:
        print('No')
        break

Submission status: Accepted

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

while True:
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        break

ans = 'Yes'
if a <= 0:
    ans = 'No'

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

if t_hit <= a_hit:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

for i in range(1001):
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print("Yes")
            break
    elif i % 2 == 1:
        a -= d
        if a <= 0:
            print("No")
            break

Submission status: Accepted

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

Submission status: Accepted

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

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

print('Yes' if flag==0 else 'No')

Submission status: Accepted

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

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

A=int(A)
B=int(B)
C=int(C)
D=int(D)

while(1):
    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 = map(int, input().split())
a = C / B
b = A / D
# print(a, b)
if a % 1 != 0: a = int(a) + 1
if b % 1 != 0: b = int(b) + 1
# print(a, b)
if a > b:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

def func(X,Y):
    if X%Y == 0:
        return X//Y
    else:
        return (X//Y)+1
    
if func(C,B) <= func(A,D):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math

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

tak = math.ceil(C/B)
aok = math.ceil(A/D)


if tak <= aok:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import math

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while a > 0 and c > 0:
    if phase_change == True:
        c -= b
        phase_change = False
    else:
        a -= d
        phase_change = True

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

Submission status: Accepted

Solution code:
n,nm,m,mm = map(int,input().split())

while True:
    m -= nm
    if m<=0:
        print("Yes")
        break
    n -= mm
    if n<=0:
        print("No")
        break

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if a%d!=0:
    td=(a//d)+1
else:
    td=a//d
if c%b!=0:
    md=(c//b)+1
else:
    md=(c//d)
if td<md:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tt, te, at, ae = input().split(" ")
tt = int(tt)
te = int(te)
at = int(at)
ae = int(ae)

win = ""
while True:
    at -= te
    if at <= 0:
        win = "t"
        break
    tt -= ae
    if tt <= 0:
        win = "a"
        break

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

Submission status: Accepted

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

T_time = C // B
if not C % B == 0 :
  T_time += 1

A_time = A // D
if not A % D == 0 :
  A_time += 1

if T_time <= A_time :
  print("Yes")
else :
  print("No")

Submission status: Accepted

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

takahasi_hp = A
aoki_hp = C

while(True):
    aoki_hp = aoki_hp - B
    if( aoki_hp <= 0):
        print("Yes")
        break

    takahasi_hp = takahasi_hp - D
    if( takahasi_hp <= 0):
        print("No")
        break

Submission status: Accepted

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

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

while 1:
    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_h, a_a, b_h, b_a = map(int, input().split())

while(True):
  b_h-=a_a
  if b_h<=0:
    print('Yes')
    break
  a_h-=b_a
  if a_h<=0:
    print('No')
    break

Submission status: Accepted

Solution code:
inputs = input().split(' ')

taka_hp = int(inputs[0])
taka_at = int(inputs[1])
aoki_hp = int(inputs[2])
aoki_at = int(inputs[3])

while True:
  aoki_hp -= taka_at
  if aoki_hp <= 0:
    print('Yes')
    break
  taka_hp -= aoki_at
  if taka_hp <= 0:
    print('No')
    break

Submission status: Accepted

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

taka = 0
hashi = 0

if B*(C//B)==C:
    taka = C//B
else:
    taka = C//B +1
    
if D*(A//D)==A:
    hashi = A//D
else:
    hashi = A//D +1

if taka <= hashi:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

tak_hp = a
aok_hp = c

while tak_hp > 0 and aok_hp > 0:
    aok_hp = aok_hp - b
    if not aok_hp > 0:
        print('Yes')
    else:
        tak_hp = tak_hp - d
        if not tak_hp > 0:
            print('No')

Submission status: Accepted

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

e = a//d
f = c//b
while a>0 and c>0:
	c-=b
	if c<=0:
		print("Yes")
		break
	a-=d
	if a<=0:
		print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(1000):
  if i == 0:
    AOKI = C - B
    if AOKI <= 0:
      print('Yes')
      break
    TAKAHASHI = A - D
    if TAKAHASHI <= 0:
      print('No')
      break

  AOKI = AOKI - B
  if AOKI <= 0:
      print('Yes')
      break

  TAKAHASHI = TAKAHASHI - D
  if TAKAHASHI <= 0:
    print('No')
    break

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc164/tasks/abc164_b
# -*- coding: utf-8 -*-
A,B,C,D = map(int,input().split())
while C > 0 and B > 0:
  C = C - B
  if C <= 0:
    print("Yes")
    break
  A = A -D
  if A <= 0:
    print("No")
    break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a, b, c, d = [float(n) for n in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t_count=0
while a>0:
    a=a-d
    t_count+=1
m_count=0
while c>0:
    c=c-b
    m_count+=1
    
#print(t_count,m_count)

if t_count>=m_count:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
taka_atc=c//b
if c%b>0:
    taka_atc+=1
aoki_atc=a//d
if a%d>0:
    aoki_atc+=1
if taka_atc<=aoki_atc:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

    C = C - B
    A = A - D

Submission status: Accepted

Solution code:
def solve(a, b, c, d):
    while True:
        c -= b
        if c <= 0:
            return 'Yes'
        a -= d
        if a <= 0:
            return 'No'
A, B, C, D = map(int, input().split()) 
print(solve(A, B, C, D))

Submission status: Accepted

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

Submission status: Accepted

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

f = 0
while (1):
    c -= b
    if c <= 0:
        f = 1
        break
    else:
        pass

    a -= d
    if a <= 0:
        f = 2
        break
    else:
        pass

if f == 1:
    print('Yes')
elif f == 2:
    print('No')
else:
    pass

Submission status: Accepted

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

Submission status: Accepted

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

takahashi_win = False
while (A > 0) and ( C > 0 ):
    C -= B
    if C <= 0:
        takahashi_win = True
    A -= D
if takahashi_win:
    print('Yes')
else:
    print('No')