Problem:


Score : 100 points

Problem Statement

X and A are integers between 0 and 9 (inclusive).

If X is less than A, print 0; if X is not less than A, print 10.

Constraints

0 \leq X, A \leq 9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X A

Output

If X is less than A, print 0; if X is not less than A, print 10.

Sample Input 1

3 5

Sample Output 1

0

3 is less than 5, so we should print 0.

Sample Input 2

7 5

Sample Output 2

10

7 is not less than 5, so we should print 10.

Sample Input 3

6 6

Sample Output 3

10

6 is not less than 6, so we should print 10.



Sample input:
3 5


Sample output:
0

Submission status: Accepted

Solution code:
s=input();print("100"[s[0]<s[2]::2])

Submission status: Accepted

Solution code:
X, A = map(int,input().split())
if X<A:print(0)
else:print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
ans=10*(x>=a)
print(ans)

Submission status: Accepted

Solution code:
X,A=map(int,input().split(" "))
print(0 if X<A else 10)

Submission status: Accepted

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

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

if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if X < A: print(0)
if X >= A: print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print(0 if x<a else 10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x < a:
	print("0")
if x >= a:
	print("10")

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print("10"*(x>=a)+"0"*(x<a))

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if(x < a):
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
# ABC 130
X ,A =map(int,input().split(" "))
if X < A:
    print(0)
elif A<=X:
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x<a:
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>=b:
  print('10')
else:
  print('0')

Submission status: Accepted

Solution code:
line = input()
print(10 if (int)(line.split(" ")[0]) >= (int)(line.split(" ")[1]) else 0)

Submission status: Accepted

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

def main():
    X, A = map(int, open(0).read().split())

    if (X < A):
        print(0)
    else:
        print(10)


main()

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print("0") if x<a else print("10")

Submission status: Accepted

Solution code:
#A
x,a = map(int,input().split())

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
if x<a:
  print(0)
else:
  print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
# map(int, input().split())
# int(input())
# input().split()
# mojiretu = ','.join(str_list)
# sorted(input())

x, a = map(int, input().split())
print('0') if x < a else print('10')

Submission status: Accepted

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

if a>=b:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:

x,a=map(int,input().split())
if x<a:
    print(0)

else:
    print(10)

Submission status: Accepted

Solution code:
# AtCoder
X, A = map(int, input().split())
if A > X:
    print(0)
elif X >= A:
    print(10)

Submission status: Accepted

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

if x >= a:
    print("10")
else:
    print("0")

Submission status: Accepted

Solution code:
#a
a,b=map(int, input().split())
if a < b:
    print("0")
else:
    print("10")

Submission status: Accepted

Solution code:
def q1():
    X, A = (int(i) for i in input().split())
    if X < A:
        print(0)
    else:
        print(10)


if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
[X,A] = list(map(int,input().split()))

if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print(["0","10"][x>=a])

Submission status: Accepted

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

if x < a:
  print(0)
elif x >= a:
  print(10)

Submission status: Accepted

Solution code:
x,a = map(int, input().split())
if x<a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
a,s=map(int,input().split())
print(10 if a>=s else 0)

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    x, a = mi()
    print(10) if x >= a else print(0)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = input().split()
x = int(n[0])
a = int(n[1])
if x < a:
  print(0)
elif x >= a:
  print(10)

Submission status: Accepted

Solution code:
X, A = list(map(int, input().split()))
if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())

print("0") if X < A else print("10")

Submission status: Accepted

Solution code:
x, a=map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())

if 0<=X<=9 and 0<=A<=9:
    if X<A:
        print(0)
    elif X>=A:
        print(10)
else:
    pass

Submission status: Accepted

Solution code:
def main():
    X, A = map(int, input().split())
    if X < A:
        print(0)
    else:
        print(10)
if __name__ == "__main__":
    main()

Submission status: Accepted

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

if x<a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:

x,a = map(int,input().split())

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

if(a > x):
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=[int(i)for i in input().split()]
if x>=a:
  print("10")
else:
  print("0")

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if x < a:
    print(0)
elif x >= a:
    print(10)

Submission status: Accepted

Solution code:
x, a = input().split()
print(10) if x >= a else print(0)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

X, A = map(int, input().split())
print(0 if X < A else 10)



# def main():

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

Submission status: Accepted

Solution code:
x,a=map(int,input().split());print(0 if x<a else 10)

Submission status: Accepted

Solution code:
print(0 if eval(input().replace(' ','<')) else 10)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    x,a = map(int, input().split())
    if x < a:
        print(0)
    else:
        print(10)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,a =map(int,input().split())
if x<a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if x < a:
    print("0")

else:
    print("10")

Submission status: Accepted

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

if x >= a:
    print(10)
else:
    print(0)

Submission status: Accepted

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

if x<a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
#--Rounding

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

if (a < b):
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, A = MAP()
print(0 if X <A else 10)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X < A:
    print(0)
elif X >= A:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a =map(int,input().split())
if x < a:
     print(0)
else:
     print(10)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X<A:
    print('0')
else:
    print('10')

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X < A:
    print(int(0))

else:
    print(int(10))

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if x < a:
    ans = 0
else:
    ans = 10
print(ans)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X < A:
	print(0)
else:
	print(10)

Submission status: Accepted

Solution code:
x,a = map(int, input().split())
if x<a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
print(0 if eval(input().replace(" ", "<")) else 10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x < a:
  print('0')
else:
  print('10')

Submission status: Accepted

Solution code:
x,a = map(int, input().split())
print(0 if x < a else 10)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if(X < A):
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x<a: print(0)
elif x>=a: print(10)

Submission status: Accepted

Solution code:
x,a = input().split()
if (x>=a):
    answer = 10
else:
    answer = 0
print(answer)

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if  x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

if x<a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x, a = map(int,input().split())
print(0 if x < a else 10)

Submission status: Accepted

Solution code:
x, a = list(map(int,input().split()))
if x >= a:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    x,a=map(int,input().split())
    if x<a:
        print(0)
    else:
        print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())

if A > X:
  print(0)
elif X >= A:
  print(10)

Submission status: Accepted

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

if a[0] >= a[1]:
  print(10)
else:
  print(0)

Submission status: Accepted

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

if x >= a:
    print(10)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if (x<a):
    print(0)
else: 
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int, input().split())
if x < a:
    print(0)
else :
    print(10)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())

if(X<A):
    print("0")
else:
    print("10")

Submission status: Accepted

Solution code:
import sys

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")


x,a = MI()

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
X, A = map(int, input().split())
print(0 if X < A else 10)

Submission status: Accepted

Solution code:
XA = list(map(int, input().split()))
if XA[0]<XA[1]:
  print(0)
else:
  print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,A=map(int, input().split())
if(X<A):
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print('0' if x<a else '10')

Submission status: Accepted

Solution code:
x, a = map(int,input().split())
if x < a:
     print("0")
else:
     print("10")

Submission status: Accepted

Solution code:
x,a=map(int,input().split());print(0)if x<a else print(10)

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if x>=a:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
# coding: utf-8
# hello worldと表示
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

x,a=MI()
if x<a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X , A = map(int, input().split())
#print(X, A)

if X < A :
    print("0")
else :
    print("10")

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
print(0 if x<a else 10)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
print(0 if x<y else 10)

Submission status: Accepted

Solution code:
a, b = list(map(int,input().split()))
if a < b:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
inputted = list(map(int, input().split()))
X = inputted[0]
A = inputted[1]

answer = 0 if X < A else 10

print(answer)

Submission status: Accepted

Solution code:
X, A  = map(int, input().split())
print("0" if X < A else "10")

Submission status: Accepted

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

if x < a :
    print(0)
else :
    print(10)

Submission status: Accepted

Solution code:
A,X = map(int,input().split())
if A >= X : print("10")
else : print("0")

Submission status: Accepted

Solution code:
X, A = map(int, input().split())

if X >= A:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x<a:
    print('0')
else:
    print('10')

Submission status: Accepted

Solution code:
# Rounding
# https://atcoder.jp/contests/abc130/tasks/abc130_a

from sys import stdin, stdout

x, a = map(int, stdin.readline().split())
if x < a:
    stdout.write("0\n")
else:
    stdout.write("10\n")

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if (X < A):
    print(0)
else:
    print(10)

Submission status: Accepted

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

if x < a:
    print(0)
elif x >= a:
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int, input().split())
print(0) if x<a else print(10)

Submission status: Accepted

Solution code:
X, A = [int(num) for num in input().split()]
if X < A:
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if X < A:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
X, A = list(map(int, input().split()))
if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
 
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:

x,a = map(int,input().split())

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
a=0
if X>=A:
  a=10
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, A = map(int,input().split())
if X < A: print(0)
else: print(10)

Submission status: Accepted

Solution code:
# ABC 130: A – Rounding
x, a = map(int, input().split())
print(0 if x < a else 10)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())

if X<A:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x, a= input().split()
x, a= int(x), int(a)
if x < a:
    print('0')
else:
    print('10')

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
if x>=a:
    print(10)
else:
    print(0)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
if X<A:
    print(0)
if X>=A:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if X < A:
    print (0)
else:
    print (10)

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  x, a = map(int, readline().split())
  if x<a:
    print(0)
  else:
    print(10)
  
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
p,q = input().split()
if int(p) < int(q):
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x, a = [int(i) for i in input().split()]
if x < a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    x, a = input_nums()
    if x < a: print(0)
    else: print(10)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
if X<A:
    print("0")
else:
    print("10")

Submission status: Accepted

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

if x < a:
  print(0)
else:
  print(10)

Submission status: Accepted

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

if x < a: print(0)
else: print(10)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
print(0) if X<A else print(10)

Submission status: Accepted

Solution code:
import sys

x, a = map(int, sys.stdin.readline().split())

def main():
    print(0 if x < a else 10)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x, a = map(int, input().split())
if a<=x:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print(10 if a>=b else 0)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if X < A:
  print('0')
else:
  print('10')

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X<A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
s = input().split()
#print(s)
#print(s[0])
#print(s[1])
if s[0] < s[1]:
	print("0")
else:
	print("10")

Submission status: Accepted

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

if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
if x<a:print(0)
else:print(10)

Submission status: Accepted

Solution code:
X, A = map(int,input().split())
if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
if X<A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
#A
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if X < A:
  print('0')
else:
  print('10')

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x < a:
  print(0)
else:
  print(10)

Submission status: Accepted

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

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int,input().split())

if X>=A:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())
if(X<A):
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
ans = 0
if x < a:
    ans = 0
else:
    ans =10
print(ans)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print(0 if a<b else 10)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a<b:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
if X<A:
  print('0')
else:
  print('10')

Submission status: Accepted

Solution code:
X,A = map(int,input().split())

if(X < A):
    print(0)
else:
    print(10)

Submission status: Accepted

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

if a<b:
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
X,A=map(int,input().split())
if X<A:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    X, A = list(map(int, sys.stdin.buffer.readline().split()))
    print(0 if X < A else 10)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if x<a:
    print('0')
else:
    print('10')

Submission status: Accepted

Solution code:
x, a = (int(x) for x in input().split())
v = 0 if (x < a) else 10
print(v)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())

if X < A:
  print(0)
else :
  print(10)

Submission status: Accepted

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

from sys import stdin, stderr

def main():
   X, A = map(int, stdin.readline().split())
   print(0 if X < A else 10)

   return 0

if __name__ == '__main__': main()

Submission status: Accepted

Solution code:
import sys
import os


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

    X, A = list(map(int, sys.stdin.buffer.readline().split()))
    print(0 if X < A else 10)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if x < a:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
# coding: utf-8
X, A = map(int, input().split())
# print(X, A)

if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
x,a = map(int,input().split())

ans = 0 if x<a else 10

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

Submission status: Accepted

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

print("0" if x<a else "10")

Submission status: Accepted

Solution code:
# A
x,a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())

if X<A:
    print(0)
elif X>=A:
    print(10)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>=b:
  print('10')
else:
  print('0')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a<b:
    print('0')
else:
    print('10')

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

X, A = map(int, input().split())
print(0 if X < A else 10)

Submission status: Accepted

Solution code:
n,a = map(int,input().split())
if n < a:
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print(0 if(x<a) else 10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())
print(10 if X >= A else 0)

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    return 0 if N < M else 10

print(solve())

Submission status: Accepted

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

if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
if a>x:
    print(0)
elif x>=a:
    print(10)

Submission status: Accepted

Solution code:
N , M = (map(int , input().split()))
if N < M:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = map(int, input().split())

if X < A:
  print("0")
else:
  print("10")

Submission status: Accepted

Solution code:
x, a = [int(x) for x in input().split()]
print(10 * (x >= a))

Submission status: Accepted

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

if a < b:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

X, A = lr()
print(0 if X < A else 10)
#

Submission status: Accepted

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

if x < a:
    print("0")
elif x >= a:
    print("10")

Submission status: Accepted

Solution code:
# ABC135 A

def main():
    x, a = map(int, input().split())

    if x < a:
        print(0)
    else:
        print(10)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
print([0,10][x>=y])

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a >= b:
  print(10)
else:
  print(0)

Submission status: Accepted

Solution code:
X,A = map(int,input().split())

if (X < A):
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print((x>=a)*10)

Submission status: Accepted

Solution code:
a , b = map(int , input(). split())
if a < b :
    print(0)
else :
    print(10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if x < a:
    print('0')
else:
    print('10')

Submission status: Accepted

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

if x <a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

if A<B:
  ans = 0
else:
  ans = 10
print(ans)

Submission status: Accepted

Solution code:
X,A = map(int,input().split(" "))

if X<A:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x,a=map(int,input().split())
print(0if x<a else 10)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
if(x < a):
    ans=0
else:
    ans=10

print(ans)

Submission status: Accepted

Solution code:
def main():
    x, a = map(int, input().split())
    if x < a:
        ans = 0
    else:
        ans = 10
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x,a = list(map(int, input().split()))
ans = 0 if x <a else 10
print(ans)