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

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:
def resolve():
  a, b, c, d = map(int, input().split())
  for i in range(100):
    c -= b
    if c <= 0:
      print('Yes')
      return
    a -= d
    if a <= 0:
      print('No')
      return
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)


def nck(n, k, kaijyo):
    return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD


def npk(n, k, kaijyo):
    if k == 0 or k == n:
        return n % MOD
    return (kaijyo[n] * divide(kaijyo[n-k])) % MOD


def kaijyo(n):
    ret = [1]
    for i in range(1, n + 1):
        ret.append((ret[-1] * i)% MOD)
    return ret

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


def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()

Submission status: Accepted

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

while True:
    c-=b

    if c<=0:
        print("Yes")
        break
    else:
        a-=d
        if a<=0:
            print("No")
            exit()

Submission status: Accepted

Solution code:
import sys, math
line = [s.rstrip("\n") for s in sys.stdin.readlines()][0]
a_point, a_offence, b_point, b_offence = [int(n) for n in line.split(" ")]
j = math.ceil(float(b_point) / a_offence)
k = math.ceil(float(a_point) / b_offence)
if j <= k:
    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())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
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())))

ans=''
for i in range(100):
  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 = [int(x) for x in input().split()]
if A % D == 0 :
  takahashi = A // D
else:
  takahashi = A // D + 1
if C % B == 0 :
  aoki = C // B
else:
  aoki = C // B + 1
if takahashi >= aoki:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

A, B, C, D = (int(x) for x in input().split())
while A>0 and C>0:
  C-=B
  if C<=0:
    print("Yes")
    sys.exit(0)
  A-=D
  if A<=0:
    print("No")

Submission status: Accepted

Solution code:
import sys
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=map(int,input().split())
t=0
a=0
while A>0:
    A-=D
    t+=1
while C>0:
    C-=B
    a+=1
if t>=a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C,D=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:

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

if C%B ==0:
    if A-(C//B-1)*D > 0:
        print('Yes')
    else:
        print('No')
elif C%B != 0:
    if A-(C//B)*D > 0:
        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):
        ans = 'Yes'
        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()) 

Taka=A/D
Aoki=C/B

if math.ceil(Taka)>=math.ceil(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:
A,B,C,D = map(int,input().split())
while 1:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
turn = True
while True:
  if turn:
    c -= b
    if c <= 0:
      print("Yes")
      import sys
      sys.exit()
  else:
    a -= d
    if a <= 0:
      print("No")
      import sys
      sys.exit()
  turn ^= True

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, C, D = map(int, input().split())

i = 0
while A > 0 and C > 0:
  i += 1
  if i % 2 == 1:
    # 高橋くんの攻撃
    C -= B
  else:
    # 青木くんの攻撃
    A -= D

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

Submission status: Accepted

Solution code:
t_p, t_a, a_p, a_a = map(int, input().split())

while True:
  a_p -= t_a
  if a_p <= 0 :
    print('Yes')
    exit()
  
  t_p -= a_a
  if t_p <= 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')
    exit()
  a -= d
  if a <= 0:
    print('No')
    exit()

Submission status: Accepted

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

    while A>0 and C>0:
        temp += 1
        if temp%2 == 1:
            C = C - B
        else:
            A -= D
        #print(temp,A,C)

    if temp%2 == 1:
        return 'Yes'
    else:
        return 'No'

print(main())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

A,B,C,D=map(int,input().split())
while 1:
  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=map(int,input().split())
while A>0 and C>0:
  C-=B
  A-=D
  if C<=0:
    print("Yes")
    break
  elif A<=0:
    print("No")

Submission status: Accepted

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

t_win_turn = c // b
if c % b > 0:
  t_win_turn += 1

a_win_turn = a // d
if a % d > 0:
  a_win_turn += 1

if t_win_turn <= a_win_turn:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
t_health, t_strength, a_health, a_strength = (int(i) for i in input().split())

while t_health > 0 and a_health > 0:
  a_health -= t_strength
  if a_health <= 0:
    print('Yes')
    break
  t_health -= a_strength
  if t_health <= 0:
    print('No')
    break

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
#高橋体力A 高橋攻撃B
#青木体力C 青木攻撃D
result = "No"
turn = "t"
while 1:
  if turn == "t":
    C -= B
    turn = "a"
    if C <= 0:
      result = "Yes"
      break
  elif turn == "a":
    A -= D
    turn = "t"
    if A <= 0:
      result = "No"
      break
print(result)

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

takahashi_attacks = math.ceil(c / b)
aoki_attacks = math.ceil(a / d)

if takahashi_attacks <= aoki_attacks:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(max(a, b, c, d)):
  if b >= c:
    print('Yes')
    exit()
  else:
    c -= b
    if a <= d:
      print('No')
      exit()
    else:
      a -= d
      continue

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:
MON = list(map(int,input().split()))
 
while 1:
  
  MON[2] = MON[2] - MON[1]
  if(MON[2] <= 0):
    print("Yes")
    break
 
  MON[0] = MON[0] - MON[3]
  if (MON[0] <= 0 ):
    print("No")
    break

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

Submission status: Accepted

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

if ac<=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())
e = a // d 
f = c // b
if(a % d):
  e += 1
if(c % b):
  f += 1

if(e >= f):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


def solve():
    A, B, C, D = map(int, input().split())
    while 1:
        C -= B
        if C <= 0:
            print("Yes")
            return

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


def main():
    solve()


if __name__ == '__main__':
    main()

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:
a = list(map(int, input().split()))
A = a[0]
B = a[1]
C = a[2]
D = a[3]

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());
while a>0 or c>0:
  c-=b
  if c<=0:
    print ("Yes")
    break
  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:
taka_h, taka_a, aoki_h, aoki_a = map(int, input().split())

while True:
    aoki_h -=taka_a
    taka_h -= aoki_a
    if(aoki_h <=0):
        print("Yes")
        break
    elif(taka_h <= 0):
        print("No")
        break

Submission status: Accepted

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

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

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())
t_turn = C // B + (C % B != 0)
a_turn = A // D + (A % D != 0)
print('Yes' if t_turn <= a_turn else 'No')

Submission status: Accepted

Solution code:
(t_hp, t_atk, a_hp, a_atk) = map(int, input().split())

turn = "t"
while (t_hp > 0) and (a_hp > 0):
    if turn == "t":
        a_hp -= t_atk
        if a_hp > 0:
            turn = "a"
    else:
        t_hp -= a_atk
        if t_hp > 0:
            turn = "t"
if turn == "t":
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = 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())
count_a = 0
count_c = 0
while A>D:
  A -= D
  count_a += 1
while C>B:
  C -= B
  count_c += 1
count_a = (count_a+1)*2
count_c = (count_c*2)+1
if count_a>=count_c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

while A > 0 and C > 0:
    if Flag == 1:
        C -= B
        Flag = 2
    else:
        A -= D
        Flag = 1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

As,Aa,Bs,Ba = map(int,input().split())
Na = math.ceil(Bs/Aa)
Nb = math.ceil(As/Ba)
 
if Na <= Nb:
  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")
        exit()
    A = A - D

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

Submission status: Accepted

Solution code:
hp_t, at_t, hp_a, at_a = list(map(int, input().split()))

if(hp_t%at_a == 0 ):
    # 青木の攻撃回数
    num_a = hp_t // at_a
else:
    num_a = hp_t // at_a + 1

if(hp_a%at_t == 0 ):
    # 高橋の攻撃回数
    num_t = hp_a // at_t
else:
    num_t = hp_a // at_t + 1

if(num_a >= num_t):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t1,t2,a1,a2=map(int,input().split())
if (a1+t2-1)//t2<=(t1+a2-1)//a2:
    ans="Yes"
else:
    ans="No"
print(ans)

Submission status: Accepted

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

for i in range(300):
    c += -1 * b
    if c < 1:
        print('Yes')
        break
    a += -1 * d
    if a < 1:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

while A >= 1:
    A = A - D
    cnt_1 += 1
    
while C >= 1:
    C = C - B
    cnt_2 += 1
    
if cnt_1 >= cnt_2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
from sys import exit

A, B, C, D = [int(x) for x in 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 <= 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=-(-c//b)
ao=-(-a//d)
if taka<=ao:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

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

a=l[0]#t tai
b=l[1]#t kougeki
c=l[2]#a tai
d=l[3]#a kougeki

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    h_taka, a_taka, h_ao, a_ao = MI()

    def attack(h, a):
        return h - a

    turn_taka = 1
    while h_taka > 0 and h_ao > 0:
        if turn_taka:
            h_ao = attack(h_ao, a_taka)
        else:
            h_taka = attack(h_taka, a_ao)

        turn_taka = 1 - turn_taka
        # print(h_taka, h_ao, turn_taka)

    if turn_taka:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = (int(a) for a in input().split())
x = -(-A//D)
y = -(-C//B)
if y <= x :
    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:
        win_takahashi = 'Yes'
        break
    A -= D
    if A <= 0:
        win_takahashi = 'No'
        break
print(win_takahashi)

Submission status: Accepted

Solution code:
import math
a,b,c,d= map(int,input().split())
n=math.ceil(float(a)/d)
m=math.ceil(float(c)/b)
if m<=n:
  print("Yes")
else:
  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())
p = 0


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

Submission status: Accepted

Solution code:
#164B
#Battle

import math as m

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(max(A, C)):
    C -= B
    if C <= 0:
        print('Yes')
        exit()
    A -= D
    if A <= 0:
        print('No')
        exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c, d = map(int, input().split())
print("YNeos"[-(-c // b) > -(-a // d)::2])

Submission status: Accepted

Solution code:
a,b,c,d=[int(_) for _ in input().split()]
if c%b!=0:
    count_1=c//b+1
else:
    count_1=c//b
if a%d!=0:
    count_2=a//d+1
else:
    count_2=a//d

if count_1<=count_2:
    ans='Yes'
else:
    ans='No'
print(ans)

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())
cnt = 0
while a > 0 and c > 0:
    if cnt % 2 == 0:
        c -= b
    else:
        a -= d
    cnt += 1
if (cnt - 1) % 2 == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if c % b != 0:
  ao = c // b + 1
else:
  ao = c // b

if ao <= tk:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

X = (A+D-1) // D
Y = (C+B-1) // B

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A = list(map(int, input().split()))
if math.ceil(A[0]/A[3]) >= math.ceil(A[2]/A[1]):
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

turn = 0
while a > 0 and c > 0:
  if turn % 2 == 0:
    c -= b
    turn += 1
  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())
chance = 0
while a>0 and c>0:
	if chance==0:
		c-=b
		chance=1
	else:
		a-=d
		chance=0
if a<=0 and c>0:
	print('No')
else:
	print('Yes')

Submission status: Accepted

Solution code:
tt,ta,at,aa=map(int,input().split())
 
for i in range(100):
 at-=ta 
 if at>0:
    pass
 elif at<=0:
    print("Yes")
    exit()
 tt-=aa
 if tt>0:
    pass
 elif tt<=0:
    print("No")
    exit()