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:
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:
a, b = list(map(int, input().split()))
if a > b:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
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("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())
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().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=[int(i) for i in input().split()]

if s<=w:
    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:
import sys
def main():
  s,w = list(map(int,(input().split())))
  if s<=w:
    print('unsafe')
    sys.exit()
  else:
    print('safe')
    sys.exit()

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 = 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("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:
S,W = map(int,input().split())
print('unsafe' if S<=W else 'safe')

Submission status: Accepted

Solution code:
s, w = (int(i) for i in 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())
ans = "unsafe"

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

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(a > b and "safe" or "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:
n, k = input().split(" ")
n = int(n)
k = int(k)
print("unsafe" if k >= n 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())

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 w >= s :
    print('unsafe')
else:
    print('safe')

Submission status: Accepted

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

if(NUM[0] > NUM[1]):
  print("safe")
elif(NUM[0] <= NUM[1]):
  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 = input().split()

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if b>=a:
    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("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 S <= W:
  print("unsafe")
else:
  print("safe")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


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


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print('safe' if S>W else '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:
S, W = input().split()
if int(S) <= int(W):
    print("unsafe")
else:
    print("safe")

Submission status: Accepted

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

if S<=W :
  print('unsafe')
if S>W :
  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' if S > W else 'unsafe')

Submission status: Accepted

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

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:
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")
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:
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())
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())
print(['unsafe','safe'][S>W])

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 = 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().split())
if S < W:
    print('unsafe')
elif S > W:
    print('safe')
elif S == W:
    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:
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:
from sys import exit

S, W = [int(x) for x in input().split()]

if S > W:
    print('safe')
    exit()

print('unsafe')

Submission status: Accepted

Solution code:
s,w=map(int,input().split())
if w>=s:
    print("unsafe")
    exit()
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 w < s:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    s, w = rl()
    if s > w:
        print ("safe")
    else:
        print ("unsafe")






mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    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:
# -*- coding: utf-8 -*-
"""
Created on Wed Jul  1 00:10:02 2020

@author: mapit
"""

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    S, W = MI()

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


if __name__ == '__main__':
    solve()

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

if b > c:
    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())
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:
#164A
#Sheep and Wolves

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().split())
if S > W:
    print("safe")
else:
    print("unsafe")

Submission status: Accepted

Solution code:
s,w = [int(s) for s in 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:
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:
  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())

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())
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('safe' if S > W else '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:
a,b = map(int,input().split())
if b>=a:
	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 W >= S:
  print('unsafe')
else:
  print('safe')

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

print('unsafe') if w >= s 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().split(" "))
if s>w:
  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 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
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

S, W = LI()
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 = list(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' if w < s else 'unsafe')

Submission status: Accepted

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

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:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,W = map(int,readline().split())
if W >= N:
    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().split())
print("safe") if s > w 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 s>w:
    print('safe')

elif s<=w:
    print('unsafe')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('unsafe' if b>=a 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 w >= s:
 print("unsafe")
else :
 print("safe")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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

def input_int():
    return int(input())


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


def input_int_list_in_line():
    return list(map(int, input().split()))


def input_int_tuple_list(n: int, q: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

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("unsafe")
else :
  print("safe")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

print('unsafe' if w >= s 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("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 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('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:
#入力例全てOKだけど黄色#
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:
def main():
  s, w = map(int, input().split())
  
  if s > w:
    print('safe')
  else:
    print('unsafe')
  
  
  
  
main()

Submission status: Accepted

Solution code:
import copy

def main():
    h, o = map(int, input().split(' '))
    if h <= o:
        print('unsafe')
    else:
        print('safe')
main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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())
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:
# 164 A

n, m = map(int, input().split())
if n <= m:
    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("unsafe")
    exit(0)
print("safe")

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())
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().split())
print ("safe" if s>w else "unsafe")

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def sheep_and_wolves():
    condition = input()
    condition_list = condition.split()
    S = int(condition_list[0])
    W = int(condition_list[1])
    
    if S > W:
        print('safe')
        return
    elif S <= W:
        print('unsafe')
        return

sheep_and_wolves()

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("unsafe") if w>=s else print("safe")

Submission status: Accepted

Solution code:
import sys
def main():
    S,W=tuple(map(int,sys.stdin.readline().split()))
    print('unsafe') if S<=W else print('safe')
if __name__=='__main__':main()

Submission status: Accepted

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

x=int(a[0])
y=int(a[1])

if x>y:
  print("safe")
else:
  print("unsafe")

Submission status: Accepted

Solution code:
import sys
from collections import deque
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

def Main():
    s,w = IL()
    if s<=w:
        print('unsafe')
    else:
        print('safe')
    return

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 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" 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 = map(int,input().split())
ans = "safe"
if(S<=W):
  ans = "unsafe"
print(ans)

Submission status: Accepted

Solution code:
S, W = list(map(int, input().split()))
if S <= W :
    print("unsafe")
if S > W :
    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:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

s,w = na()

if w >= s:
  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:
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')
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:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1364",problemID = "A",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    s,w = invr()
    print("unsafe" if w >= s else "safe")
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Accepted

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

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())
print("unsafe" if S<=W else "safe")