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: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
M = min([divmod(A,D)[0],divmod(C,B)[0]])
C_1 = C-B*M
A_1 = A-D*M
if C_1 - B <= 0 and C_1>0 and A_1>0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
P =  list(map(int,input().split()))
A = P[0]
B = P[1]
C = P[2]
D = P[3]

p = math.floor(C/B)
q = math.floor(A/D)
    
if p == 1 and q == 0:
    print('No')
elif p == q:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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


if (abs(a-b))%2==1 and (abs(c-d)%2)==0:
    print('No')
else:
    print('yes')

Submission status: Wrong Answer

Solution code:
class monster:
    stamina = 0
    attack= 0
    def __init__(self,stamina,attack):
        self.stamina = stamina
        self.attack = attack


abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]



taka = monster(a,b)
aoki = monster(c,d)

while(1):
    aoki.stamina = aoki.stamina-taka.attack
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<0 :
        print('Yes')
        break
    elif aoki.stamina<0:
        print('No')
        break
    else:
        pass

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if (a+b)%2==1 and (c+d)%2==0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
def solve(a, b, c, d):
    c = c % b
    a = a % d

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


if __name__ == '__main__':
    inputs = list(map(int, input().split()))
    solve(inputs[0], inputs[1], inputs[2], inputs[3])

Submission status: Wrong Answer

Solution code:
line = input().split()
a=int(line[0])
b=int(line[1])
c=int(line[2])
d=int(line[3])
e=c//b
f=a//d
if e>f:
  print("Yes")
elif e==f and a%d>0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def Sol(a,b,c,d):
    
    if a%d != 0:
        m_aoki = int(a/d) + 1
    else:
        m_aoki = int(a/d)

    if c%b != 0:
        m_taka = int(c/b) + 1
    else:
        m_taka = int(c/b)
        
    if m_taka <= m_aoki:
        print("YES")
    else:
        print("NO")

    return

    

#for t in range(int(input())):
n,k,c,d = map(int,input().split())
#n = int(input())
#arr = []
#for i in range(n):
#    arr.append(input())
#arr = list(map(int,input().split()))
#k = input()
#n = int(input())
Sol(n,k,c,d)

Submission status: Wrong Answer

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

ans1=0
ans2=0
for i in range(201):
    A=A-i*D
    if A <1 :
        ans1 = i
        break
for j in range(201):
    C=C-j*B
    if  C< 1:
        ans2 = j
        break
if i>=j:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
class monster:
    stamina = 0
    attack= 0
    def __init__(self,stamina,attack):
        self.stamina = stamina
        self.attack = attack


abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]



taka = monster(a,b)
aoki = monster(c,d)

while(1):
    aoki.stamina = aoki.stamina-taka.attack
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<0 :
        print('YES')
        break
    elif aoki.stamina<0:
        print('NO')
        break
    else:
        pass

Submission status: Wrong Answer

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


if (a+b)%2==1 and (c+d)%2==0:
    print('No')
else:
    print('yes')

Submission status: Wrong Answer

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

aoki_count = A//D
takahashi_count = C//B

if aoki_count < takahashi_count:
    print("Yes")
elif aoki_count == takahashi_count:
    if A%D >= 0:
        print("Yes")
    else:
        print("No")
elif aoki_count > takahashi_count:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t > a:
    print('Yes')
elif t == a and a1 == 0:
    print('Yes')
elif t == a and t1 != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))

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

Submission status: Wrong Answer

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

flag = True

# 高橋の体力の商とあまり
Ta = A//D
Td = A%D

# 青木の体力の商とあまり
Aa = C//B
Ad = C%B

if Ta==Aa:
	if Td>Ad:
		flag=False
	else:
		flag=True
elif Ta<Aa:
	flag=True
elif Ta>Aa:
	flag=False
	
if flag:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

ttol=a%d
atol=c%b
    
    
if ttol>=atol:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
for i in(0,100):
	healthOfA=healthOfA-strengthOfT
	if healthOfA<0:
		a=i
		break
for p in(0,100):
	healthOfT=healthOfT-strengthOfA
	if healthOfT<0:
		break
if p<i:
	print("No")
else:
	print("Yes")

Submission status: Wrong Answer

Solution code:

class Main:
    t1, a1, t2, a2= map(int,input().split());
    w = "t1"
    while t1 >= 0 and t2 >= 0:
        if t2 <= 0:
            w = "t1"
            break;
        t2 = t2 - a1;
        if t1 <= 0:
            w = "t2"
            break;
        t1 =  t1 - a2;

    if w == "t1":
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
#a,b :先攻
aoki = c//b #１０回耐える
taka = a//d  #１０回耐える
nokori_a = c - (aoki+1)*b
#nokori_t = a - aoki*d

if aoki < taka:
  print("Yes")
  
elif aoki == taka: #その回で勝負つくか次で勝負決まる
  if aoki==c/b:
    print("Yes")
  elif not taka == a/d:
    print("Yes")
elif aoki ==1 + taka:
  if not taka==a/d:
    if nokori_a <=0:
      print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

flag = True

# 高橋の体力の商とあまり
Ta = A//D
Td = A%D

# 青木の体力の商とあまり
Aa = C//B
Ad = C%B

if Ta==Aa:
	if Td>Ad:
		flag=True
	else:
		flag=False
elif Ta<Aa:
	flag=True
elif Ta>Aa:
	flag=False
	
if flag:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
import time
A,B,C,D = 3,3,10,1

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

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

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

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

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

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

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

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if c%b ==0 :
    e = c//d
else:
    e = c//d + 2
if a%d ==0:
    f = a//d 
else:
    f = a//d +2
if f >e:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int, input().split())
for i in range(1,201):
  while A > 0 and C > 0:
    if i%2==1:
      C=C-B*(((i-1)/2)+1)
    if i%2==0:
      A=A-D*(i/2)
  if A > 0 and C < 0:
    print('Yes')
  if A < 0 and C > 0:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = C /B
a = A /D

if B >= C:
    ans = "Yes"
elif B < C and D >= A:
    ans = "No"
else:
    if t <= a+1 :
        ans = "Yes"
        if A % D == 0 and C % B ==0:
            ans = "Yes"
        elif A % D == 0:
            ans = "No"

print(ans)

Submission status: Wrong Answer

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

ans1=0
ans2=0
for i in range(101):
    A=A-i*D
    if A <1 :
        ans1 = i
        break
for j in range(100):
    C=C-j*B
    if  C< 1:
        ans2 = j
        break
if i>=j:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
P =  list(map(int,input().split()))
A = P[0]
B = P[1]
C = P[2]
D = P[3]

p = math.floor(C/B)
q = math.floor(A/D)
    

if p == q:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int, input().split())
if ((A and B and C and D) >=1) and ((A and B and C and D) <=100):
        AOKI = C-B
        TAKA = A-D
        if AOKI>=0:
            print("Yes")
        else:
            print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

class Main:
    t1, a1, t2, a2= map(int,input().split());

    while t1 >= 0 and t2 >= 0:
        if t2 <= 0:
            break;
        t2 = t2 - a1;
        if t1 <= 0:
            break;
        t1 =  t1 - a2;

    if t1 > t2:
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

def Sol(a,b,c,d):
    
    if a%d != 0:
        m_aoki = int(a/d) + 1
    else:
        m_aoki = int(a/d)

    if c%b != 0:
        m_taka = int(c/b) + 1
    else:
        m_taka = int(c/b)
        
    if m_taka <= m_aoki:
        print("YES")
    else:
        print("NO")

    return

    

#for t in range(int(input())):
n,k,c,d = map(int,input().split())
#n = int(input())
#arr = []
#for i in range(n):
#    arr.append(input())
#arr = list(map(int,input().split()))
#k = input()
#n = int(input())
Sol(n,k,c,d)

Submission status: Wrong Answer

Solution code:
n,m,a,b=map(int,input().split())
if b-m<=0:
    print("Yes")
else:
    if n-a<=0:
        print("No")
    else:
        if a-n<=0:
            print("Yes")
        else:
            if m-b<=0:
                print("No")

Submission status: Wrong Answer

Solution code:
import math
a,b,c,d = map(int,input().split())
#a c hp
#b d atk
t_n = math.ceil(c / b)
a_n = math.ceil(a / d)

if t_n <= a_n:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A, B, C, D= map(int,input().split())
if (A+B)>(C+D):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A,B,C,D=input().split()
A = int(A)
B = int(B)
C = int (C)
D = int(D)
E = A - D
F = C - B
if E < F or A - B ==0:
    print ('Yes')
else:
    print ('No')

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if c%b ==0 :
    e = c//d
else:
    e = c//d + 1
if a%d ==0:
    f = a//d
else:
    f = a//d +2
if f >e:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

flag = True

# 高橋の体力の商とあまり
Ta = A//D
Td = A%D

# 青木の体力の商とあまり
Aa = C//B
Ad = C%B

if Ta==Aa:
	if Td>Ad:
		flag=True
	else:
		flag=False
elif Ta<Aa:
	flag=True
else:
	flag=False
	
if flag:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

class Main:

    t1, a1, t2, a2= map(int,input().split());

    while t1 >= 0 and t2 >= 0:
        if t2 <= 0:
            break;
        t2 -= a1;
        if t1 <= 0:
            break;
        t1 -= a2;

    if t1 >= t2:
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
line = input().split()
a=int(line[0])
b=int(line[1])
c=int(line[2])
d=int(line[3])
e=c//b
f=a//d
if e>=f:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t+1 > a:
    print('Yes')
elif t+1 == a and t1 != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=list(map(int,input().split()))
i=a
j=c
u=0
l=0
while a>d :
    a-=d
    u+=1
while c>b:
    c-=b
    l+=1
g=min(l,c)
x=i-g*d
y=j-g*b
    

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
HT,ST,HA,SA = map(int,input().split())
if(HT>=HA or ST>=SA):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:

class Main:

    t1, a1, t2, a2= map(int,input().split());

    while t1 > 0 and t2 > 0:
        if t2 <= 0:
            break;
        t2 -= a1;
        if t1 <= 0:
            break;
        t1 -= a2;

    if t1 >= t2:
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split()))
while n[0]>0 or n[2]>0:
    n[2] = n[2] - n[1]
    if n[2] <= 0:
        break
    n[0] = n[0] - n[3]

if n[0]>=n[2]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C,D=input().split()
A = int(A)
B = int(B)
C = int (C)
D = int(D)
if A - B > C and C -D<A or A - B ==0:
    print ('Yes')
else:
    print ('No')

Submission status: Wrong Answer

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

    if A<=0:
        print('No')
    else:
        A=A-D

Submission status: Wrong Answer

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

if C//B == A//D:
  if C%B > A%D:
    print('No')
  else:
    print('Yes')  
elif C//B == A//D +1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
x = input()
taka_hp = int(x.split()[0])
taka_attack = int(x.split()[1])
ao_hp = int(x.split()[2])
ao_attack = int(x.split()[3])

while (taka_hp > 0 and ao_hp > 0):
    ao_hp = ao_hp - taka_attack
    taka_hp = taka_hp - ao_attack
else:
    if taka_hp == 0:
      print("No")
    elif ao_hp == 0:
      print("Yes")

Submission status: Wrong Answer

Solution code:
N=[int(x) for x in input().split()]
if not N[2]%N[1]==0:
   c=N[2]//N[1]+1
else:
    c=N[2]//N[1]
if not N[0]%N[3]==0:
   c=N[0]//N[3]+1

   d=N[0]//N[3]+1
else:
    d=N[0]//N[3]
if d>c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c, d = map(int, input().split())
if c%b ==0 :
    e = c//d
else:
    e = c//d + 1
if a%d ==0:
    f = a//d
else:
    f = a//d +1
if f >e:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  # Takashi
while (ht > 0 or ha > 0):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Submission status: Wrong Answer

Solution code:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t+1 >= a and t1 != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

    a -= d
    if a < 0:
        print('Yes')
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

A,B,C,D = map(int,input().split())
if C<=0:
    print('Yes')
else:
    C=C-B

if A<=0:
    print('No')
else:
    A=A-D

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x = a//d +1
y = c//b

if y == 1:
  if x <= y:
  	print("NO")
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
#a,b :先攻
aoki = c//b #１０回耐える
taka = a//d  #１０回耐える
nokori_a = c - (aoki+1)*b
#nokori_t = a - aoki*d

if aoki < taka:
  print("Yes")
  
elif aoki == taka:
  if not taka == a/d:
    print("Yes")
elif aoki ==1 + taka:
  if not taka==a/d:
    if nokori_a <=0:
      print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# a,b,c,d
a = list(map(int,input().split()))
# r1 = abs(a[1] - a [2])
r2 = abs(a[2] - a[3])
if r2 != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a_hp,a_at,b_hp,b_at = map(int,input().split())
n = b_hp//a_at
m = a_hp//b_at
if n<=m+1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N=[int(x) for x in input().split()]
if not N[2]%N[1]==0:
   c=N[2]//N[1]+1
else:
    c=N[2]//N[1]
if not N[0]%N[3]==0:
   c=N[0]//N[3]+1

   d=N[0]//N[3]+1
else:
    d=N[0]//N[3]
if d>=c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  # Takashi
while (ht == 0 or st == 0):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Submission status: Wrong Answer

Solution code:
line = input().split()
a=int(line[0])
b=int(line[1])
c=int(line[2])
d=int(line[3])
e=c//b
f=a//d
if e>=f:
  g=e
else:
  g=f
h=int(c)
j=int(a)
for i in range(ｇ):
	h=h-b
	j=j-d
	if h <= 0:
		print("Yes")
	elif j <= 0:
		print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
if max(a,b)>max(c,d):
    print('Yes')
elif max(a,b)==max(c,d):
    if a+b>=c+d:
        print('Yes')
    else:
        print('No')
else:
    if min(a,b)>=min(c,d):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x = input()
taka_hp = int(x.split()[0])
taka_attack = int(x.split()[1])
ao_hp = int(x.split()[2])
ao_attack = int(x.split()[3])

while (taka_hp > 0 and ao_hp > 0):
    ao_hp = ao_hp - taka_attack
    taka_hp = taka_hp - ao_attack
else:
    if taka_hp == 0:
      print("No")
    else:
      print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ABCD=input()
ABCD=ABCD.split()
A=int(ABCD[0])
B=int(ABCD[1])
C=int(ABCD[2])
D=int(ABCD[3])
while(1):
    C=C-B
    if(C<=0):
        print('No')
        break
    A=A-D
    if(A<=0):
        print('Yes')
        break

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
N = C//B
M = A//D
n = C % B
m = A % D
 
if N < M:
  print('Yes')
elif N > M:
  if N + 1 == M and m ==0:
    print('Yes')
  else:
    print('No')
elif N == M:
  if n == 0:
    print('Yes')
  elif m == 0:
    print('No')
  else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

class Main:

    t1, a1, t2, a2= map(int,input().split());

    while(t1 <= t2 or t1 >= t2):
        if t2 <= 0:
            break;
        t2 -= a1;
        if t1 <= 0:
            break;
        t1 -= a2;

    if t1 >= t2:
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,m,a,b=map(int,input().split())
if b-m<=0:
    print("Yes")
else:
    if n-a<=0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
a,b,c,d = map(int, input().split())
#a,b :先攻
aoki = c//b #１０回耐える
taka = a//d  #１０回耐える
nokori_a = c - (taka+1)*b
#nokori_t = a - aoki*d

if aoki < taka:
  print("Yes")
  
elif aoki == taka:
  if not taka == a/d:
    print("Yes")
elif aoki ==1 + taka:
  if not taka==a/d:
    if nokori_a <=0:
      print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A1,A2,B1,B2 = map(int, input().split())
X = B1-A2
Y = A1-B2
if X>Y:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
class monster:

    def __init__(self, hp, ap):
        self.hp = hp
        self.ap = ap

        
def battle(player1, player2):
    if player2.hp // player1.ap == 0:
        return "No"
    for i in range(player2.hp // player1.ap):
        attack(player1, player2)
        attack(player2, player1)
        if player2.hp <= 0:
            return 'Yes'
    return 'No'

def attack(attacker, receiver):
    receiver.hp -= attacker.ap

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

print(battle(takahashi, aoki))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = map(int, input().split())
list1=[]
for i in num:
    list1.append(i)
if (list1[0]+list1[1])<(list1[2]+list1[3]):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:

class Main:

    t1, a1, t2, a2= map(int,input().split());

    while(t1 <= t2 or t1 >= t2):
        if t2 <= 0:
            break;
        t2 -= a2;
        if t1 <= 0:
            break;
        t1 -= a1;
        
    if t1 >= t2:
        print("Yes");
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
TaHP,TaAP,AoHP,AoAP = map(int, input().split())

Flag_Ta = True

while( TaHP > 0 or AoHP > 0):
#	print(TaHP)
#	print(AoHP)
	if	Flag_Ta:
		AoHP = AoHP - TaAP
		Flag_Ta = False
	else:
		TaHP = TaHP - AoAP
		Flag_Ta = True
if TaHP > 0:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
ABCD=input()
ABCD=ABCD.split()
A=int(ABCD[0])
B=int(ABCD[1])
C=int(ABCD[2])
D=int(ABCD[3])
while(1):
    C=C-B
    #print(C)
    if(C<0):
        print('No')
        break
    A=A-D
    #print(A)
    if(A<0):
        print('Yes')
        break