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:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, a = (int(i) for i in input().split())

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

Submission status: Accepted

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

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

ans = 10

if X < A:
    ans = 0

print(ans)

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:
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","10"][a<=x])

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:
from sys import stdin

X, A = [int(x) for x in stdin.readline().rstrip().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)
elif x>=a:
  print(10)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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 itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np
# import math
# import random
# import fractions
# import sys
# sys.setrecursionlimit(100000)
# N = int(stdin.readline().rstrip().split()[0])
# A = [int(x) for x in stdin.readline().rstrip().split()]
# N, X = [int(x) for x in stdin.readline().rstrip().split()]
# S = stdin.readline().rstrip().split()[0]

X, A = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7

if x<a:
	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:
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())
Y=0
if X<A:
    Y=0
else:
    Y=10

print(Y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 0<= X,A <=9

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)
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:
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(10)
elif x < a:
  print(0)

Submission status: Accepted

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

X = int(input_line[0])
A = int(input_line[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:
    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:
N = input().split()
X = int(N[0])
a = int(N[1])

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:
inputs = list(map(int, input().split()))
X,A = inputs
if X>=A:
    print(10)
else:
    print(0)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
X, A = map(int, input().split())
if X < A:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
n = input().split()
x = int(n[0])
a = int(n[1])

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

Submission status: Accepted

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

from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

X, A = map(int, raw_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(10)
else:
	print(0)

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 = input().split()
X = int(X)
A = int(A)

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x, a = map(int, input().split())
print([0, 10][x >= a])

Submission status: Accepted

Solution code:
# using main() makes code faster from the point of view of "access to variables in global name-space"
# def main():

# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
import sys
sys.setrecursionlimit(10**7)
from itertools import combinations, permutations # https://docs.python.org/ja/3/library/itertools.html
from math import factorial
def combinations_count(n, r):
    # faster than the following code
    # def combinations_count(n, r):
    #     return factorial(n) // (factorial(n - r) * factorial(r))
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
    return result
def combination_with_repetition_count(n, r):
    return combinations_count(n + r - 1, r)
from collections import deque, Counter # https://docs.python.org/ja/3/library/collections.html#collections.deque
from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
from operator import itemgetter # ex: List.sort(key=itemgetter(1))
from functools import reduce
from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
def gcds(numbers):
    return reduce(gcd, numbers)
def lcm(x, y):
    return (x * y) // gcd(x, y)
def lcms(numbers):
    return reduce(lcm, numbers, 1)

# first create factorial_list
# fac_list = mod_factorial_list(n)
INF = 10 ** 18
MOD = 10 ** 6 + 3
modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
def modinv(a, p = MOD):
    # evaluate reciprocal using Fermat's little theorem:
    # a**(p-1) is identical to 1 (mod p) when a and p is coprime
    return modpow(a, p-2, p)
def modinv_list(n, p = MOD):
    if n <= 1:
        return [0,1][:n+1]
    else:
        inv_t = [0,1]
        for i in range(2, n+1):
            inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
        return inv_t
def modfactorial_list(n, p = MOD):
    if n == 0:
        return [1]
    else:
        l = [0] * (n+1)
        tmp = 1
        for i in range(1, n+1):
            tmp = tmp * i % p
            l[i] = tmp
        return l
def modcomb(n, k, fac_list = [], p = MOD):
    # fac_list = modfactorial_list(100)
    # print(modcomb(100, 5, modfactorial_list(100)))
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    if len(fac_list) <= n:
        a = factorial(n) % p
        b = factorial(k) % p
        c = factorial(n-k) % p
    else:
        a = fac_list[n]
        b = fac_list[k]
        c = fac_list[n-k]
    return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
def modadd(a, b, p = MOD):
    return (a + b) % MOD
def modsub(a, b, p = MOD):
    return (a - b) % p
def modmul(a, b, p = MOD):
    return ((a % p) * (b % p)) % p
def moddiv(a, b, p = MOD):
    return modmul(a, modpow(b, p-2, p))


# initialize variables and set inputs
#initialize variables
    # to initialize list, use [0] * n
    # to initialize two dimentional array, use [[0] * N for _ in range(N)]
# set inputs
    # open(0).read() is a convenient method:
    # ex) n, m, *x = map(int, open(0).read().split())
    #     min(x[::2]) - max(x[1::2])
    # ex2) *x, = map(int, open(0).read().split())
    #     don't forget to add comma after *x if only one variable is used
# calculate and output
    # output pattern
    # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6

# set test data
# sys.stdin = open('sample.txt') # for test

# functions used
r = lambda: sys.stdin.readline().strip() #single: int(r()), line: map(int, r().split())
R = lambda: list(map(int, r().split())) # line: R(), lines: [R() for _ in range(n)]
Rmap = lambda: map(int, r().split())
# set inputs

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


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

Submission status: Accepted

Solution code:
s = input().split()
print(0 if int(s[0]) < int(s[1]) else 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())

answer = 0 if X < A else 10
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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:
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 = [int(s) for s in input().split(" ")]

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

Submission status: Accepted

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

if x < a:
    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:
from sys import stdin

x, a = [int(x) for x in stdin.readline().rstrip().split()]

ans = 0
if x < a:
    ans = 0
else:
    ans = 10

print(ans)

Submission status: Accepted

Solution code:
ll= lambda : list(map(int,input().split()))
testcases=1
# testcases=int(input())
for testcase in range(testcases):
	[n,k]=ll()
	if n < k:
		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:

def solve():
    X, A = [int(_) for _ in raw_input().split()]
    if X < A:
        ret = 0
    else:
        ret = 10
    print ret

if __name__ == '__main__':
    solve()

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\n")
else:
  print("10\n")

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 a > x:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
x, a = [int(x) for x 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:

def main():
    x, a = map(int,input().split())
    if(x < a):
        return 0
    elif(x >= a):
        return 10
    else:
        exit()

if __name__ == "__main__":
    print(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:
i = list(map(int, input().split()))
 
if i[0] < i[1]:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
#n = int(input()) 
x,a = (int(i) for i 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 = input().split()
X = int(X)
A = int(A)

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

Submission status: Accepted

Solution code:
def main():
    inputs = input().split()
    X, A = int(inputs[0]), int(inputs[1])

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/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)
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, raw_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())

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

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:
x,a = map(int, raw_input().split())

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

Submission status: Accepted

Solution code:
# coding: utf-8
import time
import re
import math
 
def main():
    X,A=map(int,input().split())
    if X<A:
        print(0)
    else:
        print(10)
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#n=int(input())
# global n,A,s,memo,mx,mn,L,B

Submission status: Accepted

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

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:
x, a = map(int, input().split())

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

Submission status: Accepted

Solution code:
#coding:utf-8

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:
#!/usr/bin/env python

import sys

x, a = [ int(x) for x in sys.stdin.readline().split() ]

print( 10 * int(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:
lista = input().split(" ")
a, b= lista
a = int(a)
b = int(b)
if (a<b):
    c=0
else:
    c=10
print(c)

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(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:
# -*- coding: utf-8 -*-
x,a=input().split()
if(x>=a):
    print(10)
else:
    print(0)

Submission status: Accepted

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

def solve():
    return str(10*int.__ge__(*map(int, input().split())))

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
# coding: utf-8
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:
def main():
    x, a = (int(z) for z in input().split())
    if x < a:
        print(0)
    else:
        print(10)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input().split()
if int(s[1])>int(s[0]):
    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 = input().split(" ")
if (x < a) :
  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:
x,a=raw_input().split()
x,a=int(x),int(a)
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] = [int(i) for i in 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:
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 a>x:
    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:
xa = input().split()
x = int(xa[0])
a = int(xa[1])
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:
def inpl(): return list(map(int, input().split()))
X, A = inpl()
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:
#n = int(input())
#m = int(input())
#k = int(input())
#n, m = map(int, input().split())
#n, m, k = map(int, input().split())
#a = list(map(int, input().split()))
#table = []
'''
for i in range h:
    temp = list(map(int, input().split()))
    table.append(temp)
'''
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X, A = list(map(int, input().split()))
print('0' if X < A else '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:
i = list(map(int, input().split()))
if i[0] >= i[1] :
    print("10")
else :
    print("0")

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")
elif x >= a:
    print("10")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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)
if x >= a:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = input().split(" ")
n = int(list[0])
m = int(list[1])
if n>=m:
  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(10)
else:
  print(0)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n=input().split(" ")
n[1]=int(n[1])
n[0]=int(n[0])
if (n[0] <n[1]):
    print(0)
else:
    print(10)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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


if __name__ == '__main__':
    solve()

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 < 0:
    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:
x, a = input().split()
x = int(x)
a = int(a)

if x < a:
  print(0)
else:
  print(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:
# 2019 6/16
# ABC130 Rounding

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')
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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    x, a = map(int, input().split())
    
    if x < a:
        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:
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:
import numpy as np

i = np.array([int(v) for v in input().rstrip('\n').split()])
print("0") if i[0] < i[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(10)
elif x < a:
    print(0)

Submission status: Accepted

Solution code:
X,A=(int(x) for x 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)
else:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,x=map(int,input().split())
if a<x:
  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 = [int(i) for i in input().split()]
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
#a, b, c, d = (int(i) for i in input().split())  
#W = [int(i) for i in input().split()] 
import math

X, A = (int(i) for i in input().split())
if X >= A:
    print(10)
else:
    print(0)
    # flag = 0
# a_list = []

Submission status: Accepted

Solution code:
# coding: utf-8
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:
# coding: utf-8
# Your code here!

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 = [int(c) for c in input().split()]
print(0 if X<A else 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:

if __name__ == '__main__':
    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())
print([0,10][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:
ax = input().split()
x = int(ax[0])
a = int(ax[1])
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
X, A = (int(x) for x 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:
    res = 0
else:
    res = 10

print(res)

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:
#
import sys
import math
import numpy as np
import itertools


# いくつか入力
x,a = (int(i) for i in input().split())  

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if X < A:
    out = 0
else:
    out = 10

print(out)

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)