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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B,C,D=map(int,input().split())
    while True:
        C-=B
        if C<=0:
            YesNo(1)
            exit()
        A-=D
        if A<=0:
            YesNo(0)
            exit()

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

nt = math.ceil(c/b)
na = math.ceil(a/d)
if nt>na:
    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:
def main():
    a, b, c, d = (int(i) for i in input().split())
    i = 0
    while a > 0 and c > 0:
        if i % 2 == 0:
            c -= b
        else:
            a -= d
        i += 1
    if a <= 0:
        print("No")
    else:
        print("Yes")


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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

    if turn:
        c-=b
        turn = not turn
    else:
        a -= d
        turn = not turn

Submission status: Accepted

Solution code:
def get_ints():
    return list(map(int, input().split()))

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    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

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
for i in range(10**5):
    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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B,C,D=MI()
    while(1):
        C-=B
        if(C<=0):
            print("Yes")
            break
        A-=D
        if(A<=0):
            print("No")
            break
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


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

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

Submission status: Accepted

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

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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 sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

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 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    A, B, C, D = Scanner.map_int()
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            return
        A -= D
        if A <= 0:
            print('No')
            return


def main():
    # sys.stdin = open("sample.txt")
    solve()


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C,D = [int(i) for i in input().split()]
t = 0
while 0 < A and 0 < C:
    if t % 2 == 0:
        C -= B
    else:
        A -= D
    t += 1
if A <= 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

# main()
print(main())

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b,c,d = LI()
    while 1:
        c -= b
        if c <= 0:
            break
        a -= d
        if a <= 0:
            break
    if c <= 0:
        print("Yes")
    else:
        print("No")
    return

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

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

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

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

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:
def main():
    A, B, C, D = list(map(int, input().split()))
    while True:
        C -= B
        if C <= 0:
            return True
        A -= D
        if A <= 0:
            return False


print('Yes' if main() else 'No')

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:
a,b,c,d=map(int,input().split())
ta=0--c//b
ao=0--a//d
if ta<=ao:print('Yes')
else:print('No')

Submission status: Runtime Error

Solution code:
A=input()
B=input()
C=input()
D=input()

int_A=int(A)
int_B=int(B)
int_C=int(C)
int_D=int(D)

while True:
    int_C-=int_B
    int_A-=int_D
    if int_C<=0:
        result="Yes"
        break
    if int_A<=0:
        result="No"
        break

print(result)

Submission status: Runtime Error

Solution code:
A=input("高橋君のHP:")
B=input("高橋君のATK:")
C=input("青木君のHP:")
D=input("青木君のATK:")

int_A=int(A)
int_B=int(B)
int_C=int(C)
int_D=int(D)

while True:
    int_C-=int_B
    int_A-=int_D
    if int_C<=0:
        result="Yes"
        break
    if int_A<=0:
        result="No"
        break

print(result)

Submission status: Runtime Error

Solution code:
A=input()
B=input()
C=input()
D=input()

int_A=int(A)
int_B=int(B)
int_C=int(C)
int_D=int(D)

while True:
    int_C-=int_B
    int_A-=int_D
    if int_C<=0:
        result="YES"
        break
    if int_A<=0:
        result="NO"
        break

print(result)

Submission status: Runtime Error

Solution code:
A=input("高橋君のHP:")
B=input("高橋君のATK:")
C=input("青木君のHP:")
D=input("青木君のATK:")

int_A=int(A)
int_B=int(B)
int_C=int(C)
int_D=int(D)

while True:
    int_C-=int_B
    int_A-=int_D
    if int_C<=0:
        result="YES"
        break
    if int_A<=0:
        result="NO"
        break

print(result)

Submission status: Runtime Error

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

for i in range(100): # 繰り返し処理したい、とりあえず100回以上の繰り返しはないから100回繰り返す
    c -= b # 青木くんの体力cから高橋くんの攻撃力bぶん引く
#    print('c', c) # 残り体力確認用
    if c <= 0>: # 青木くん体力が0以下になったら
        print('Yes') # 高橋くんの勝ちなのでYes
        break # 体力が0になったら繰り返しも終了

    a -= d # 次に高橋くんの体力aから青木くんの攻撃力dを引く
 #   print('a',a) # 残り体力確認用
    if a < 1: # 高橋くん体力が0以下になったら
        print('No') # 青木くん勝利でNo
        break # 体力が0になったら繰り返しも終了
# どちらの体力も残ってたら次の繰り返し

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def resolve():
    a,b,c,d = map(int,input().split())
    A = math.ceil(c/b)
    B = math.ceil(a/d)
    print('Yes' if A <= B else 'No')
    
resolve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
46 4 40 5

Submission status: Runtime Error

Solution code:
mport 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: Runtime Error

Solution code:
    vals = [int(i) for i in input().split()]
    a = vals[0]
    b = vals[1]
    c = vals[2]
    d = vals[3]
    res2 = a//d + (1 if(a % d > 0) else 0)
    res1 = c//b + (1 if(c % b > 0) else 0)
    res = "Yes" if(res1 <= res2) else "No"
    print(res)

Submission status: Runtime Error

Solution code:
    vals = [int(i) for i in input().split()]
    a = vals[0]
    b = vals[1]
    c = vals[2]
    d = vals[3]
    res2 = a//d + (1 if(a % d > 0) else 0)
    res1 = c//b + (1 if(c % b) > 0 else 0)
    res = "Yes" if(res1 <= res2) else "No"
    print(res)

Submission status: Runtime Error

Solution code:
import itertools
N = int(input())
a = list(map(int,input().split()))
count=0
for a in list(itertools.combinations(a,3)):
  if a[0]!=a[1] and a[1]!=a[2] and a[0]!=a[2]:
    if a[1]+a[2]>a[0] and a[0]+a[2]>a[1] and a[0]+a[1]>a[2]:
      count+=1
  
print(count)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a , b , c , d = map(int,input().split())
for i in range(1,101):
    if a != 0 and c != 0:
        c = c - b
        a = a - d
    if c == 0 or a == 0:
        i = 100
    if c == 0:
        x = "Yes"
    elif a == 0:
        x = "No"
print(x)

Submission status: Runtime Error

Solution code:
a , b , c , d = map(int,input().split())
for i in range(1,101):
    if b != 0 and d != 0:
        c = c - b
        a = a - d
    if c == 0 or a == 0:
        i = 100
    if c == 0:
        x = "Yes"
    elif a == 0:
        x = "No"
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a , b , c , d = map(int,input().split())
for i in range(1,101):
    if b >= d:
        x = "Yes"
    elif d >= a:
        x = "No"
    if b == 0 or d == 0:
        i = 100
print(x)

Submission status: Runtime Error

Solution code:
a,b,c,d,=map(float,input().split())
e=b%c+b//c
f=d%a+d//a+1
if b-c<=0:print("No")
elif b-c>0 and d-a<=0:print("Yes")
elif b-c>0 and d-a>0:
    for i in range(min(e,f)):
        if min==e:
            print("No")
        else:
            print("Yes")

Submission status: Runtime Error

Solution code:
a,b,c,d,=map(float,input().split())
e=b%c+b//c
f=d%a+d//a+1
if b-c<=0:print("no")
elif b-c>0 and d-a<=0:print("yes")
elif b-c>0 and d-a>0:
    for i in range(min(e,f)):
        if min==e:
            print("no")
        else:
            print("yes")

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
if a%d>0:
   a=a//d+1
elif a%d==0:
   a=a//d
if c%b>0:
   c=c//b+1
elif c%b==0
if a>=c:
   print("yes")
else:
   print("no")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(C/B)
print(A/D)
if (math.ceil(C/B)-math.ceil(A/D))<1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
t=A
a=C
while t<1 or a<1:
  t=t-D
  a=a-B
print('YNeos'[t<a::2])

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

While True:
  
  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: Runtime Error

Solution code:
A,B,C,D=map(int,input().split())
X = 0
Y = o
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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

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

while y>0 or z>0:
    if z=z-a < 0:
        print('Yes')
        eixt()
    if y=y-c < 0:
        print('No')
        exit()

Submission status: Runtime Error

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

while y>0 or z>0:
    if z-a < 0:
        print('Yes')
        eixt()
    if y-c < 0:
        print('No')
        exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split(" "))
i = 0
while a > 0 or c > 0:
  if i%2 == 0:
    c -= b
    else:
      a -= d
  i += 1
print("YNeos"[i%2::2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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