TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a,b,c,d=map(int,input().split())
n=1
while c-b*n>0 and a-d*n>0:
    n+=1
if c-b*(n+1)<=a-d*(n+1):
    print('Yes')
else:
    print('No')

s=int(input())
w=int(input())
print('unsafe' if w>=s else 'safe')

s,w=map(int,input().split())
print('unsafe' if w>=s else 'safe')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
N = int(input())
a = []

for i in range(N):
  a.append(input())
  
b = set(a)
print(len(b))

N = input().split(" ")
TL = int(N[0])
TA = int(N[1])
AL = int(N[2])
AA = int(N[3])
a = 0

while a == 0:
  AL = AL - TA
  if AL <= 0:
    a = 1
    break
  TL = TL - AA
  if TL <= 0:
    a = 2
    break
if a == 1:
  print("Yes")
elif a == 2:
  print("No")


a = input().split(" ")
s = int(a[0])
w = int(a[1])

if w >= s:
  print("unsafe")
else:
  print("safe")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = map(int, input().split())
if s >= w:
    print("unsafe")
else:
    print("safe")


s, w = map(int, input().split())
if s > w:
    print("safe")
else:
    print("unsafe")


Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
S, W = map(int, input().split())
if W >= S:
	print(unsafe)
else:
	print(safe)

S, W = map(int, input().split())
if W >= S:
	print('unsafe')
else:
	print('safe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
n, s = map(int, input().split())

if n>s:
	print("sefe")
else:
	print("aunsafe")

n, s = map(int, input().split())
print("safe") if n>s else print("unsafe")

Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s = int(input())
w = int(input())
if w>=s:
  print("unsafe")
else:
  print("safe")

s,w=map(int,input().split())
if w>=s:
  print('unsafe')
else:
  print('safe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a,b=map(int,input().split)
if a=<b:
    print("unsafe")
else:
    print("safe")

a,b=map(int,input().split())
if a=<b:
    print("unsafe")
else:
    print("safe")

a,b=map(int,input().split())
if a<=b:
    print("unsafe")
else:
    print("safe")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s,w =map(input().split())
 
if s>w:
  print("safe")
else:
  print("unsafe")

s,w =map(input().stlip())

if s>w:
  print("safe")
else:
  print("unsafe")
  

s,w =map(int,input().split())
 
if s>w:
  print("safe")
else:
  print("unsafe")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a = input()
b = input()
if b>=a:
    print("unsafe")
else:
    print("safe")

a,b = map(int,input().split())
if b>=a:
    print("unsafe")
else:
    print("safe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s = input()
n = len(s)
if n < 4:
  quit()
l,r = 0,4
ans = [[[],[]] for _ in range(n+3)]
for i in range(4,8):
  l = 0
  while l+i <= n:
    if int(s[l:(l+i)])%2019 == 0:
      ans[l+1][0].append(l+i)
      ans[l+i+1][1].append(l+1)
    l += 1
final = 0
cnt = 1
for i in range(n+1):
  if ans[i][0] and ans[i][1]:
    cnt += 1
    final += cnt
  elif ans[i][0]:
    final += 1
    cnt = 1
print(final)

s,w = map(int,input().split())
if w >= s:
  print("unsafe")
else:
  print("safe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s,w=map(int.input().split())
if s<=w:
  print('unsafe')
else:
  print('safe')

s,w=map(int.input().split())
if s<=w:
  print(unsafe)
else:
  print(safe)

s,w=map(int.input().split());
if s<=w:
  print('unsafe');
else:
  print('safe');


s,w=map(int.input().split());
if s<=w:
  print(unsafe);
else:
  print(safe);


s,w=map(int,input().split())
if s<=w:
  print('unsafe')
else:
  print('safe')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a = input().spolit()

if int(a[0]) > int(a[1]):
  print("safe")
else:
  print("unsafe")

a = input().split()

if int(a[0]) <= int(a[1]):
  print("unsafe")
else:
  print("safe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = input().split()
if s <= w:
    print('safe')
else:
    print('unsafe')

s, w = map(int, input().split())
if s <= w:
    print('unsafe')
else:
    print('safe')

Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = map(int, input().split())

if s =< w:
    print('unsafe')
else:
    print('safe')

s, w = map(int, input().split())

if s <= w:
    print('unsafe')
else:
    print('safe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = list( map( int ,input() )) 
if w >= s:
	print('unsafe')
else:
	print('safe')

s, w = list( map( int , input().split() )) 
if w >= s:
	print('unsafe')
else:
	print('safe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s = int(input())
w = int(input())

if w >= s:
    print('unsafe')
else:
    print('safe')

s, w = map(int, input().split())

if w >= s:
    print('unsafe')
else:
    print('safe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S = read().decode().rstrip()

prod = [str(2019 * i) for i in range(1, 100)]

cnt = 0
for p in prod:
    cnt += sum(S.startswith(p, i) for i in range(len(S)))

print(cnt)


import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S, W = map(int, read())

if W >= S:
    print("unsafe")
else:
    print("safe")


    

import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S, W = map(int, read().split())

if W >= S:
    print("unsafe")
else:
    print("safe")



Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s,w=input().split()
if s<=w:
  print(unsafe)
if s>w:
  print(safe)

S,W=input().split()
if S<=W:
  print(unsafe)
else:
  print(safe)

s,w=input().split()
if s<=w:
  print(unsafe)
else:
  print(safe)

s,w=map(int, input().split())
if s<=w:
  print("unsafe")
else:
  print("safe")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
n = int(input())
y = []
for x in range(n):
    y.append(input())
print(len(set(y)))

S, W = map(int, input().split())
print('Unsafe' if S <= W else 'Safe')


S, W = map(int, input().split())
print('Unsafe' if W >= S else 'Safe')


S, W = map(int, input().split())
print('unsafe' if W >= S else 'safe')


Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
S = int(input())
W = int(input())

if S<W:
    print('unsafe')
elif S>W :
    print('safe')


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

S,W = map(int,input().split())
if S<=W:
    print('unsafe')
elif S>W:
    print('safe')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a,b=map(int,input().split())
if b>=a:
  print("unsafe")
 else:
  print("safe")

a,b=map(int,input().split())
if b>=a:
    print("unsafe")
else:
    print("safe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
A, B, C, D = map(int, input().split())

for _ in range(10000):
  C -= B
  if C <= 0:
    print("Yes")
    exit()

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


s, w = map(int, input().split())

if s > w:
  print("safe")
else:
  print("unsafe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
S, W = map(int, input().split())
if W>=S:
  print("unsafe")
 else:
  print("safe")

s = input()
b = len(s)
c = 0
f = 0
while True:
    if f == b:
        break
    elif b - f <= 2:
        f = 0
        b -= 1
    else:
        if int(s[f:b]) % 2019 == 0:
            c += 1
            f += 1
        else:
            f += 1
print(c)


S, W = map(int, input().split())
if W >= S:
    print("unsafe")
else:
    print("safe")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
A, B = map(int, input().split())

if A <= W:
    print("unsafe")
else:
    print("safe")

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

if A <= B:
    print("unsafe")
else:
    print("safe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = map(int, input().split())
if w > s:
  print('unsafe')
else:
  print('safe;)

s, w = map(int, input().split())
if w >= s:
  print('unsafe')
else:
  print('safe')


Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a, b, c, d = map(int,input().split())


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


s,w = map(int,input().split())

if s > w:
    print('safe')
elif s =< w:
    print('unsafe')

s,w = map(int,input().split())

if s =< w:
    print('unsafe')
elif s > w:
    print('safe')
    

s,w = map(int,input().split())

if s <= w:
    print('unsafe')
elif s > w:
    print('safe')
    


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
a,b= map(int,imput().split())
c = 'unsafe'
if a>b:
  c = 'safe'
print(c)

S,W = map(int,input().split())
if S > W:
  print('safe')
else:
  print('unsafe')

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

a,b = map(int,stdin.readline().rstrip().split())

if b <= a:
    print("unsafe")
else:
    print("safe")


from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

a,b = map(int,stdin.readline().rstrip().split())

if b >= a:
    print("unsafe")
else:
    print("safe")

Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
S = int(input())
W = int(input())

if (S <= W) :
    print("unsafe")
else :
    print("safe")



S,W = map(int,input().split())

if (S <= W) :
    print("unsafe")
else :
    print("safe")



Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s = int(input())
w = int(input())
 
if w>=s :
  print("unsafe")
else : 
  print("safe")

s = int(input())
w = int(input())

if w>=s :
  print("unsafe")
else : 
  print("safe")

s, w = map(int, input().split())
print('safe') if s > w else print('unsafe')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = map(int, input().split())

if w >= s:
    print("unsage")
else:
    print("sage")

s, w = map(int, input().split())

if w >= s:
    print("unsafe")
else:
    print("safe")

Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s, w = map(int, input().split())
if s > w:
  print(safe)
else:
  print(unsafe)

s, w = map(int, input().split())
if s > w:
  print("safe")
else:
  print("unsafe")

Verdicts: Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
S, W = list(map(int, input().split()))
if W >= S :
    print("Unsafe")
else:
    print("Safe")

S, W = map(int.input(" ")) 
if W >= S :
    print("Unsafe")
else:
    print("Safe")

S, W = list(map(int, input().split()))
if W >= S :
    print("unsafe")
else:
    print("safe")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s,w = map(int,input().split())
if s >= w:
    print("unsafe")
else:
    print("safe")


s,w = map(int,input().split())
if s > w:
    print("unsafe")
else:
    print("safe")


s,w = map(int,input().split())
if s > w:
    print("safe")
else:
    print("unsafe")


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):
s,w = map(int,input().split())

if s>=w:
  print('unsafe')
else:
  print('safe')


s,w = map(int,input().split())
 
if w>=s:
  print('unsafe')
else:
  print('safe')

Verdicts: Wrong Answer

Accepted
Problem: There are S sheep and W wolves.  If the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.  If the wolves will attack the sheep, print `unsafe`; otherwise, print `safe`.

Submission attempts (in order):

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



if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 


if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")


HPlist = list(map(int, input().split()))
HPlist[0] = A
HPlist[1] = B
HPlist[2] = C
HPlist[3] = D



if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 


if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")

N = int(input())

keihin = []


for i in range(N):
    if keihin.count(input()) == 0:
        keihin.append(input())


print(len(keihin))



HPlist = list(map(int, input().split()))
HPlist[0] = A
HPlist[1] = B
HPlist[2] = C
HPlist[3] = D

int aokiDeath
int takahashiDeath


if C % B == 0:
    aokiDeath = C // B
else:
    aokiDeath = C // B + 1 


if A % D == 0:
    takahashiDeath = A // D
else:
    takahashiDeath = A // D + 1

if aokiDeath <= takahashiDeath:
    print("Yes")
else:
    print("No")


S, W = map(int, input().split())

if W >= S:
    print("unsafe")
else:
    print("safe")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
import sys
a,b,c,d=map(int,input().split())
while a>0 or c>0:
  c-=b
  if c<1:
    print("Yes")
    sys.exit()
  a-=d
print("No")

import sys
a,b,c,d=map(int,input().split())
while a>0 or c>0:
  c-=b
  if c<1:
    print("Yes")
    sys.exit()
  a-=d
print("NO")

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a , b , c , d = input().split()

a=int(a)
b=int(b)
c=int(c)
d=int(d)

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



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

a=int(a)
b=int(b)
c=int(c)
d=int(d)

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



Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = list(map(int, input().split()))

c1 = (C+B-1) // B  
c2 = (A+D-1) // D

print(c2, c2)

if c1 == c2:
    ans = 'Yes'
elif c1 < c2:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

c1 = (C+B-1) // B  
c2 = (A+D-1) // D

# print(c2, c2)

if c1 == c2:
    ans = 'Yes'
elif c1 < c2:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
t_hp, t_pwr, a_hp, a_pwr = map(int, input().split())

while True:
    a_hp -= t_pwr
    t_hp -= a_pwr

    if a_hp < 0:
        print("Yes")
        break
    elif t_hp < 0:
        print("No")
        break

t_hp, t_pwr, a_hp, a_pwr = map(int, input().split())

while True:
    a_hp -= t_pwr
    t_hp -= a_pwr

    if a_hp <= 0:
        print("Yes")
        break
    elif t_hp <= 0:
        print("No")
        break

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import math
a, b, c, d = map(int, input().split())
if math.ceil(a//d) + 1 >= math.ceil(c//b) :
  print('Yes')
else:
  print('No')


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

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


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


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):

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

x = (a+d-1)//d
y = (b+c-1)//b

if x >= y:
	print("yes")
else:
	print("no")


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

x = (a+d-1)//d
y = (b+c-1)//b

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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")

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:
  c=c//b
if a>=c:
  print("YES")
else:
  print("NO")

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


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int,input().split())
while True:
    if C > 0:
        C -= B
        if C > 0 and A > 0:
            A -= D
        elif C <= 0:
            print('Yes')
            break
        else:
            print('No')
            break
    else:
        print('Yes')
        break

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int,input().split())
turn = 0
while a > 0 or c > 0:
  if turn%2 == 0:
    c -= b
  else:
    a -= d
print('Yes' if a > 0 else 'No')

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

Verdicts: Time Limit Exceeded

Accepted
Problem: 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`.

Submission attempts (in order):
import math

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

number_of_turns_takahsi = math.ceil(C / B)
number_of_turns_aoki = math.ceil(A / D)
print(number_of_turns_takahsi, number_of_turns_aoki)

answer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'

print(answer)


import math

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

number_of_turns_takahsi = math.ceil(C / B)
number_of_turns_aoki = math.ceil(A / D)
# print(number_of_turns_takahsi, number_of_turns_aoki)

answer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'

print(answer)


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
 import math
 A,B,C,D = map(int,input().split())
 turn = math.ceil(A/D)
 if turn*B >= C:
     print("Yes")
else:
    print("No")     

import math
A,B,C,D = map(int,input().split())
turn = math.ceil(A/D)
if turn*B >= C:
    print("Yes")
else:
    print("No")     

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = [int(x) for x in input().split()]
run = True
while run:
    C -= B
    if C <= 0:
        run = False
        result = "Yes"
        continue
    A -= D
    if A <= 0:
        run = False
        result = "No"
        continue

A, B, C, D = [int(x) for x in input().split()]
t = A // D
a = C // B
if t >= a:
    print("yes")
else:
    print("no")

A, B, C, D = [int(x) for x in input().split()]
t = A // D
a = C // B
if t >= a:
    print("Yes")
else:
    print("No")

A, B, C, D = [int(x) for x in input().split()]
t = A // D
a = C // B
if t >＝ a:
    print("Yes")
else:
    print("No")

A, B, C, D = [int(x) for x in input().split()]
while True:
    C -= B
    if C <= 0:
        result = "yes"
        break
    A -= D
    if D <= 0:
        result = "no"
        break
print(result)

A, B, C, D = [int(x) for x in input().split()]
t = A // D
a = C // B
if t >= a:
    print("Yes")
else:
    print("No")

A, B, C, D = [int(x) for x in input().split()]
run = True
while run:
    C -= B
    if C <= 0:
        run = False
        result = "Yes"
        continue
    A -= D
    if A <= 0:
        run = False
        result = "No"
        continue
print(result)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < --(c//b)::2])


a, b, c, d = map(int, input().split())
print('YNeos'[a//d < c//b::2])


a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < -(-c//b)::2])


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int,input().split())
 
Takahashi = A
Aoki = B
 
while Takahashi >= 0 or Aoki >=0:
  Aoki -= B
  if Aoki <= 0:
    print('Yes')
    break
  Takahashi -= D
  if Takahashi <= 0:
    print('No')
    break

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = list(map(int, input().rstrip().split()))

i = 0
result = None

while not result:
    if i % 2 == 0:
        d = d - b
        if d <= 0:
            result = 'Yes'
    else:
        a = a - c
        if a <= 0:
            result = 'No'

print(result)



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

i = 0
result = None

while not result:
    if i % 2 == 0:
        c = c - b
        if c <= 0:
            result = 'Yes'
    else:
        a = a - d
        if a <= 0:
            result = 'No'

    i = i + 1

print(result)



Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
N=list(map(int,input().split()))
takahashi=N[2]/N[1]
aoki=N[0]/N[3]

print(takahashi)
print(aoki)

if aoki%1!=0:
   aoki=aoki+1 

if takahashi<aoki:
  print("Yes")
else:
  print("No")


N=list(map(int,input().split()))
if N[2]<=N[1]:
    print("Yes")
    exit()

takahashi=N[2]/N[1]
aoki=N[0]/N[3]

if aoki%1!=0:
   aoki=aoki+1 

if takahashi%1!=0:
    takahashi=takahashi+1
    

if takahashi<=aoki:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]


print(-1*(-1*Line[2] // Line[1]))
print(-1*(-1*Line[0] // Line[3]))

if -1*(-1*Line[2] // Line[1]) <= -1*(-1*Line[0] // Line[3]):
    print("Yes")
else:
    print("No")

input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]


# print(-1*(-1*Line[2] // Line[1]))
# print(-1*(-1*Line[0] // Line[3]))

if -1*(-1*Line[2] // Line[1]) <= -1*(-1*Line[0] // Line[3]):
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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()

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):

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

if A // D == 0:
    A_zero_num = A // D
else:
    A_zero_num = A // D +1

if C // B == 0:
    C_zero_num = C // B
else:
    C_zero_num = C // B +1

if A_zero_num == C_zero_num:
    print("Yes")

elif A_zero_num > C_zero_num:
    print("No")

else:
    print("Yes")


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

for i in range(100):
    A = A - D
    C = C - B

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

    elif A <= 0:
        print("No")
        break

    else:
        continue

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d=map(int,input().split())

e=a//d
f=c//b

if e+1>=f:
  print('Yes')
else:
  print('No')

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

e=a//d
f=c//b

if a%d>0 and c-(e+1)*b<=0:
  print('Yes')
elif a%d==0 and c-e*b<=0:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
from math import ceil
a, b, c, d = map(int, input().split())
if ceil(a/d) >= ceil(c/d):
  print("Yes")
else:
  print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d=map(int,input().split())

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = [int(n) for n in input().split()]
takahasi_turn = C / B
aoki_turn = A / D
if int(takahasi_turn) == int(aoki_turn):
    print("Yes")
elif takahasi_turn >= aoki_turn:
    print("Yes")
else:
    print("No")


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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
x = list(map(int, input("Enter a multiple value: ").split()))
for i in x:
    x[1] -= x[2]
    x[0] -= x[3]
if x[0]<0:
    print("No")
else:
    print("Yes")

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

Verdicts: Wrong Answer

Accepted