Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

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

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

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

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

Sample Input 1

10 9 10 10

Sample Output 1

No

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

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

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

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

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

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


def I():
    return int(input())


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

who = 1
while(a > 0 and c > 0):
  if(who == 0):
    a -= d
  else:
    c -= b
  who = 1 - who

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

Submission status: Accepted

Solution code:
a,b,c,d =  map(int,input().split())
num_t = -(-c//b)
num_a = -(-a//d)
if num_t <= num_a:
  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:
A,B,C,D=map(int,input().split())
count=0
for i in range(1000):
    if i%2==0:
        C-=B
    else:
        A-=D
    if A<=0:
        print("No")
        exit()
    if C<=0:
        print("Yes")
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
taka_ta, taka_ko, aoki_ta, aoki_ko = list(map(int, input().split()))

while True:
    aoki_ta -= taka_ko
    if aoki_ta <= 0:
        print('Yes')
        break
    
    taka_ta -= aoki_ko
    if taka_ta <=0 :
        print('No')
        break

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c,d = (int(x) for x in input().split())
while a>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=list(map(int,input().split(" ")))
if c%b==0:
  taro=c//b
else:
  taro=c//b+1
if a%d==0:
  sasaki=a//d
else:
  sasaki=a//d+1

if taro<=sasaki:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math

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

y = math.ceil(A/D)
n = math.ceil(C/B)

if y < n:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
from math import ceil

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

    t_turns = ceil(A / D)
    a_turns = ceil(C / B)

    if t_turns >= a_turns:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
def monsterbattle(th, ts, ahh, ahs):
  tscore = math.ceil(ahh/ts)
  ascore = math.ceil(th/ahs)
  if(tscore<=ascore):
    return "Yes"
  else:
    return "No"

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

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
while True:
    C -= B
    if C <= 0:
        print("Yes")
        break

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
num_list = [int(i) for i in input().split()]

t_a = np.ceil(num_list[2] / num_list[1])
a_t = np.ceil(num_list[0] / num_list[3])

if t_a <= a_t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

A,B,C,D=list(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:
abcd=list(map(int,input().split()))
count=1
while(abcd[0]>0 and abcd[2]>0):
    if((count%2)==1):
        abcd[2]-=abcd[1]
    else:
        abcd[0]-=abcd[3]
    count+=1
if(abcd[0]>0 and abcd[2]<=0):
        print('Yes')
if(abcd[0]<=0 and abcd[2]>0):
    print('No')

Submission status: Accepted

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

for i in range(max(a,c)):
    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())


while 1:
    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 = [int(e) for e in input().split()]

    c1 = c // b + 1
    if c % b == 0:
        c1 -= 1

    c2 = a // d + 1
    if a % d == 0:
        c2 -= 1

    ans = 'Yes' if c1 <= c2 else 'No'
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
for _ in range(1000):
    C = C - B
    A = A - D
    if C <= 0:
        print("Yes")
        exit()
    if A <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = [int(i) for i in 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:

def main():
    import sys
    A,B,C,D=map(int,input().split())
    for i in range(100):
        A=A-D
        C=C-B
        if C<=0:
            print("Yes")
            sys.exit()
        elif A<=0:
            print("No")
            sys.exit()
        

    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if bool:
    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())

while True:
    C=C-B
    if C>0:
        pass
    else:
        print("Yes")
        break

    A=A-D
    if A>0:
        pass
    else:
        print("No")
        break

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

while True:
  c -= b
  if c <= 0:
    print("Yes")
    break
  else:
    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:
#!python3

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


def main():
    a = A // D if A % D == 0 else A // D + 1
    b = C // B if C % B == 0 else C // B + 1
    ans = "No" if a < b else "Yes"
    print(ans)
    

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def checkWin(T_hp, A_hp):
    if (T_hp <= 0):
        print('No')
    if (A_hp <= 0):
        print('Yes')

T_hp, T_at, A_hp, A_at = list(map(int, input().split()))

while (T_hp > 0 and A_hp > 0):
    A_hp = A_hp - T_at
    T_hp = T_hp - A_at

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
HealthA, AtkA, HealthB, AtkB = map(int, input().split())
num_takahashi = ceil(HealthB/AtkA)
num_aoki = ceil(HealthA/AtkB)
if num_takahashi<= num_aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():

    n = [int(x) for x in input().split(' ')]
    a = n[0]
    b = n[1]
    c = n[2]
    d = n[3]
    
    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 A > 0 and C > 0:
    C -= B
    A -= D

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

Submission status: Accepted

Solution code:
import math

line=list(map(int,input().split(' ')))

print('Yes') if math.ceil(line[2]/line[1])<=math.ceil(line[0]/line[3]) else print('No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
q,mod=divmod(c,b)
r,mod2=divmod(a,d)
q= q+1 if mod else q
r= r+1 if mod2 else r
print("Yes" if q<=r else "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:
A, B, C, D = map(int, input().split())
Q, R = divmod(C, B)
q, r = divmod(A, D)
if R > 0:
    Q = Q + 1
if r > 0:
    q = q + 1
if Q <= q:
    print('Yes')
elif Q > q:
    print('No')

Submission status: Accepted

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

from math import ceil

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

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

Submission status: Accepted

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


def main():
    l = [int(e) for e in si().split()]
    Tcnt, Acnt = 0, 0
    while l[0] > 0:
        l[0] -= l[3]
        Tcnt += 1
    while l[2] > 0:
        l[2] -= l[1]
        Acnt += 1
    if Tcnt >= Acnt:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

while (True):
    C -= 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(i) for i in 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())

s='Yes'

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

t_count=0
a_count=0

if A%D!=0:
    t_count+=1
if C%B!=0:
    a_count+=1

t_count+=int(A/D)
a_count+=int(C/B)

if t_count>=a_count:
    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:
i = list(map(int, input().split()))
#print(i)

h1=i[0]
a1=i[1]
h2=i[2]
a2=i[3]

while True:
  h2 = h2 - a1
  if h2 <= 0:
    print("Yes")
    exit()
  h1 = h1 - a2
  if h1 <= 0:
    print("No")
    exit()

Submission status: Accepted

Solution code:
import math

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

taikyu_t = math.ceil(A / D)
taikyu_a = math.ceil(C / B)

if taikyu_a <= taikyu_t:
    # takahashi win
    print('Yes')
else:
    # aoki win
    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:
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 ^= 1

print('Yes' if turn == 1 else '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:
a = input().split()

t_h = int(a[0])
t_a = int(a[1])
a_h = int(a[2])
a_a = int(a[3])

i = 0

while True:
  #高橋ターン
  if(i%2==0):
    a_h = a_h - t_a
    if(a_h <= 0):
      print("Yes")
      break
  #青木ターン
  elif(i%2!=0):
    t_h = t_h - a_a
    if(t_h <= 0):
      print("No")
      break
  i = i + 1

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

if C%B == 0:
    tak = C//B
else:
    tak = C//B + 1
if A%D == 0:
    aok = A//D
else:
    aok = A//D + 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# python3
# -*- coding: utf-8 -*-
import sys
import math
import bisect
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
lmtx = lambda h: [list(map(int, lmis())) for _ in range(h)]
sys.setrecursionlimit(1000000000)


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


# main
a, b, c, d = mis()

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

turn = 1
while True:
    if turn % 2 != 0:
        c = c - b
        if c <= 0:
            print('Yes')
            exit()
        else:
            turn += 1
    else:
        a = a - d
        if a <= 0:
            print('No')
            exit()
        else: 
            turn += 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 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())
while A >0 or  C>0:
    C -= B
    if C <1:
        print('Yes')
        exit()
    A -= D
    if A < 1:
        print('No')
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")

MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

T_H, T_A, A_H, A_A = [int(x) for x in stdin.readline().rstrip().split()]

while 1:
    T_H -= A_A
    A_H -= T_A
    if A_H <= 0:
        print("Yes")
        break
    elif T_H <= 0:
        print("No")
        break

Submission status: Accepted

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


count = 0
while True:
  
  if count % 2 == 0:
    C = C - B
  else:
    A = A -D
  
  if A <= 0:
    print("No")
    sys.exit()

  if C <= 0:
    print("Yes")
    sys.exit()
    
  count += 1

Submission status: Accepted

Solution code:
import sys

l = sys.stdin.readline()
a, b, c, d = [ int(v) for v in l.split() ] 

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

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

Submission status: Accepted

Solution code:
def battle(a,b,c,d):
    while True:
        c -= b
        if c<=0:
            break
        a -= d
        if a<=0:
            break
   
    if a<=0:
        print('No')
    else:
        print('Yes')

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

Submission status: Accepted

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



t_life= math.ceil(a/d)
a_life= math.ceil(c/b)

if t_life < a_life:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    a, b, c, d = map(int, args[0].split())

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


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
td, ta, ad, aa = map(int, input().split())

which = -1
while td > 0 and ad > 0:
    if which == -1:
        ad -= ta
    else:
        td -= aa
    which *= -1

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

Submission status: Accepted

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

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 = [int(v) for v in input().split()]

t_flag = True

while True:
    if A <= 0:
        t_flag = False
        break

    C -= B

    if C <= 0:
        t_flag = True
        break

    A -= D

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

Submission status: Accepted

Solution code:
import math

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

cnt1 = math.ceil(C / B)
cnt2 = math.ceil(A / D)

if cnt1 <= cnt2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
    import sys

    input = sys.stdin.readline
    a, b, c, d = map(int, input().split())
    f = -1
    for i in range(1000):
        if c - b <= 0:
            f = "T"
            break
        else:
            c = (c - b)
        if a - d <= 0:
            f = "A"
            break
        else:
            a = (a - d)
    if f == "T":
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

while True:
    if c-b <= 0:
        print("Yes")
        sys.exit()

    elif a-d <= 0:
        print("No")
        sys.exit()

    else:
        c= c-b
        a= a-d

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split(sep=" "))
T = C//B
Ao = A//D
if C%B == 0:
    T-=1
if A%D == 0:
    Ao-=1
if T <= Ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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

if n_a >= n_c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

import math

A_attack = math.ceil(C / B)
B_attack = math.ceil(A / D)

if A_attack <= B_attack:
    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('No')
else:
	print('Yes')

Submission status: Accepted

Solution code:
tmp = input().split()
Lt = int(tmp[0])
At = int(tmp[1])
La = int(tmp[2])
Aa = int(tmp[3])

while True:
    La = La - At
    if La <= 0:
        print('Yes')
        break
    Lt = Lt - Aa
    if Lt <= 0:
        print('No')
        break

Submission status: Accepted

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

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 = tuple(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())
count = 1
hp = 1
result = ""
while hp > 0:
    if count % 2 == 1:
        c -= b
        hp = c
        count += 1
        if hp <= 0:
            result = 'Yes'
    else:
        a -= d
        hp = a
        count += 1
        if hp <= 0:
            result = 'No'

print(result)

Submission status: Accepted

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

flg = 0
loop = 0

while loop==0:
#  print(a,c)
  if flg ==0:
    c = c - b
    if c <= 0:
      loop = 1
    flg = 1
  else:
    a = a -d
    if a <= 0:
      loop = 1
    flg = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math


def printYN(c): print("Yes") if c else print("No")


a, b, c, d = [int(w) for w in input().split()]

cond = math.ceil(a / d) >= math.ceil(c / b)
printYN(cond)

Submission status: Accepted

Solution code:
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s
def factorial(n):
    if n == 1:
        return 1
    return n * factorial(n-1)
def mCn(m, n):
    def factorial_ntimes(m, n):
        r = 1
        while n:
            r *= m
            m -= 1
            n -= 1
        return r
    return int(factorial_ntimes(m, n) / factorial(n))

a,b,c,d = load_list()

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

    turn = not turn

Submission status: Accepted

Solution code:
import math


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

x = math.ceil(a/d)
y = math.ceil(c/b)

if x >= y:
	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:
# coding: utf-8

num = input().split()
thp = int(num[0])
tatk = int(num[1])
ahp = int(num[2])
aatk = int(num[3])

turn = 1

while thp > 0 and ahp > 0:
    if turn % 2 == 1:
        ahp -= tatk
        turn += 1
        if ahp <= 0:
            print("Yes")
            break
    else:
        thp -= aatk
        turn += 1
        if thp <= 0:
            print("No")
            break

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

flg = 0

for i in range(101):
    c = c - b
    if c <= 0:
        flg = 0
        break
    
    a = a - d
    if a <= 0:
        flg = 1
        break

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
count = 0
while True:
    if count % 2 == 0: #Takahashi Turn
        C -= B
    else: #Aoki Turn
        A -= D
    if C <= 0:
        ret = 'Yes'
        break
    if A <= 0:
        ret = 'No'
        break
    count += 1
print(ret)

Submission status: Accepted

Solution code:
import math

a, b, c, d = [int(x) for x in 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 = (int(n) for n in input().split())

while a>0 and c>0:

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

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