Problem:


Score : 100 points

Problem Statement

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.

Constraints

1 \leq S \leq 100

1 \leq W \leq 100

Input

Input is given from Standard Input in the following format:

S W

Output

If the wolves will attack the sheep, print unsafe; otherwise, print safe.

Sample Input 1

4 5

Sample Output 1

unsafe

There are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.

Sample Input 2

100 2

Sample Output 2

safe

Many a sheep drive away two wolves.

Sample Input 3

10 10

Sample Output 3

unsafe



Sample input:
4 5


Sample output:
unsafe

Submission status: Accepted

Solution code:
# @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-27 10:29
# @url:https://atcoder.jp/contests/abc164/tasks/abc164_a
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
# region fastio

BUFSIZE = 8192

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
def main():
    nums=list(map(int,input().split()))
    s,w=nums[0],nums[1]
    if w>=s:
        print ("unsafe")
    else:
        print ("safe")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s , w = map(int,input().split())

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

else:
    print('safe')

Submission status: Accepted

Solution code:
#abc164a

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
WS = input().split()
S = int(WS[0])
W = int(WS[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
input_line = input().split()
hituzi = int(input_line[0])
ookami = int(input_line[1])
if hituzi > ookami:
    print("safe")

else:
    print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w=map(int,input().split())
print('unsafe'[2*(s>w):])

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
args = input().split()

s = int(args[0])
w = int(args[1])

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

Submission status: Accepted

Solution code:
#n=int(input())
s,w=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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

Submission status: Accepted

Solution code:
# input
S, W = map(int, input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s, w = map(int,input().split())
if s-w > 0:
  print('safe')
else:
  print('unsafe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    i = input()
    s, w = i.split()
    s = int(s)
    w = int(w)
    
    if (w >= s):
        print('unsafe')
    else :
        print('safe')
    
    return 

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W = map(int,input().split())

print('safe' if S>W else 'unsafe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W=map(int, input().split())

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

Submission status: Accepted

Solution code:
def solve(s, w):
    return "unsafe" if w >= s else "safe"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w = map(int,input().split())
if w >= s:
    print("unsafe")
elif w < s:
    print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = list(map(int,input().split()))
print('unsafe' if S<=W else 'safe')

Submission status: Accepted

Solution code:
N,W = map(int,input().split())

if N > W:
  print("safe")
  
else:
  print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
s,w=I()
if w>=s:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n>m:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    s, w = map(int,input().split())
    print("safe" if s > w else "unsafe")
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = input().split(' ')
s = int(lst[0])
w = int(lst[1])
if w>=s:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
from collections import deque
# input() reads a string with a line of input, stripping the '\n' (newline) at the end.
# This is all you need for most Kickstart problems.
#t = int(input())  # read a line with a single integer
for i in range(1, 2):
  s, w = [int(s) for s in input().split(" ")]  # read a list of integers, 2 in this case
  #print("Case #{}: {} {}".format(i, n + m, n * m))
  # check out .format's specification for more form1atting options
def test_cae():
  if w > s or  w==s:
    print("unsafe")
  else:
    print("safe")


test_cae()

Submission status: Accepted

Solution code:
S, W = [int(s) for s in input().split(" ")]
if S > W:
  print('safe')
else:
  print('unsafe')

Submission status: Accepted

Solution code:
print('un'*eval(input().replace(' ','<='))+'safe')

Submission status: Accepted

Solution code:
def solve(s, w):
    if w >= s:
        return "unsafe"
    else:
        return "safe"


def main():
    s, w = map(int, input().split())
    res = solve(s, w)
    print(res)


def test():
    assert solve(4, 5) == "unsafe"
    assert solve(100, 2) == "safe"
    assert solve(10, 10) == "unsafe"


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s, w = map(int, input().split())


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S, W = map(int, input().split())
    if S <= W:
        print("unsafe")
    else:
        print("safe")
    return 0

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
num = input().split()
#print(type(num[0]))



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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S, W = MI()
print('unsafe' if W >= S else 'safe')

Submission status: Accepted

Solution code:
S,W=map(int,input().split(" "))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W = map(int,input().split())

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

Submission status: Accepted

Solution code:
import sys

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

if S <= W:
    print('unsafe')
    sys.exit()

print('safe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = [int(x) for x in input().split()]
 
if W >= S:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
sheep, wolves = [int(i) for i in input().split(" ")]

if wolves >= sheep:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
s,w=map(int,raw_input().split());print "safe" if s>w else\
"unsafe"

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, w = [int(i) for i in input().split()]
if s <= w:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

Solution code:
sheep, wolve = [int(x) for x in input().split()]
if wolve >= sheep:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
test = list(map(int, input().split()))
S = test[0]
W = test[1]
if W >= S:
  print('unsafe')
else:
  print('safe')

Submission status: Accepted

Solution code:
s,w = map(int,input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	S,W = inputMap()

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

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    s, w = LI()
    print("unsafe" if s <= w else "safe")
    return


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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

ans = ''
if s > w:
    ans = 'safe'
else:
    ans = 'unsafe'

print(ans)

Submission status: Accepted

Solution code:
# A - Sheep and Wolves
def main():
    S, W = map(int, input().split())
    print("unsafe" if S <= W else "safe")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC164 A
decide_dict = {
    "True": "safe",
    "False": "unsafe"
}
S, W = input().split()
print(decide_dict[str(int(S) > int(W))])

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
safe = lambda boolean: print('safe') if boolean else print('unsafe')
ints = lambda: list(map(int, input().split()))
s,w = ints()
safe(s>w)

Submission status: Accepted

Solution code:
S,W = map(int, open(0).read().split())
if S > W:
  print('safe')
else:
  print('unsafe')

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
s, w = [int(num_str) for num_str in input().split()]
print('safe' if s > w else 'unsafe')

Submission status: Accepted

Solution code:
s, w = [int(x) for x in input().split()]

ans = 'safe'

if w >= s:
    ans = 'unsafe'

print (ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, W = map(int, input().split())

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

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

Submission status: Accepted

Solution code:
S,W=map(int, input().split())
print(["safe","unsafe"][S<=W])

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if a[0]<=a[1]:
 print("unsafe")
else:
 print("safe")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
sys.setrecursionlimit(300000)


def solve(S: int, W: int):
    if W >= S:
        ret = 'unsafe'
    else:
        ret = 'safe'
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    solve(S, W)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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

    if W >= S:
        print('{}'.format('unsafe'))
    else:
        print('{}'.format('safe'))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
s, w = map(int, input().split())
# 文字列の入力
if s <= w:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input().split(' ')
sheep = int(line[0])
wife = int(line[1])
if sheep <= wife:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a <= b:
  print("unsafe")
elif a > b:
  print("safe")

Submission status: Accepted

Solution code:
s, w = input().split(' ')
s = int(s)
w = int(w)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

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

Submission status: Accepted

Solution code:
s, w = (int(x) for x in input().split())
if s > w:
  print("safe")
if w >= s:
  print("unsafe")

Submission status: Accepted

Solution code:
s=input()
lis=s.split()
if int(lis[0])>int(lis[1]):
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())

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

Submission status: Accepted

Solution code:
s,w=map(int,input().split());print("un"*(s<=w)+"safe")

Submission status: Accepted

Solution code:
s, w = [int(x) for x in input().split()]

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

Submission status: Accepted

Solution code:
S = list(map(int,input().split()))
 
if S[1] >= S[0]:
 print('unsafe')
else:
 print('safe')

Submission status: Accepted

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

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

Submission status: Accepted

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

S,W = list(map(int, input().rstrip().split()))
#-----
print( "unsafe" if S <= W else "safe")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = list(map(int,input().split()))
res = X[0]<=X[1]
if res:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,w=[int(i) for i in input().split()]
print("unsafe" if w>=s else "safe")

Submission status: Accepted

Solution code:
il=[int(x) for x in input().split(' ')]
if il[0]>il[1]:
    print('safe')
else:
    print('unsafe')

Submission status: Accepted

Solution code:
S, W  = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
print("safe" if s[0] > s[1] else "unsafe")

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  #s = input()
  #s = input().split()
  s,w = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  if s > w:
    print("safe")
  else:
    print("unsafe")

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit, stdout
#setrecursionlimit(1000000)
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
    x=list(stdin.readline())
    x.pop()
    return x
def si(): return stdin.readline().rstrip()
#mod=1000000007
#res=['Yes', 'No']
############# CODE STARTS HERE #############
a, b=mi()
print('safe' if a>b else 'unsafe')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s , w = input().split()
s_num = int(s)
w_num = int(w)

if s_num > w_num:
  print("safe")
else :
  print("unsafe")

Submission status: Accepted

Solution code:
S, W  = map(int, input().split())

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

Submission status: Accepted

Solution code:
S,W = (int(x) for x in input().split())

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

Submission status: Accepted

Solution code:
SW = (input().split())
S = int(SW[0])
W = int(SW[1])

if 1 <= S and S <= 100 and 1 <= W and W <= 100:
  if W >= S:
    print('unsafe')
  else:
    print('safe')

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
if x<=y:
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

Solution code:
S,W=list(map(int,input().split(" ")))

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

Submission status: Accepted

Solution code:
#!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _ia(): return map(int, sys.stdin.readline().strip().split())


def main():
    s, w = _ia()
    if s <= w:
        return "unsafe"
    else:
        return "safe"


if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
s , w = map(int , input().split())

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

Submission status: Accepted

Solution code:
s, w = map(int, input().split())  # 入力

ans = 'safe'
if float(w) >= float(s):
    ans = 'unsafe'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,W = map(int, input().strip().split(' '))

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

Submission status: Accepted

Solution code:
S,W = map(int,input().split())

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

Submission status: Accepted

Solution code:
S, W = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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