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:
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:
from bisect import bisect_left, bisect_right; from collections import Counter, defaultdict, deque, OrderedDict; from copy import deepcopy; from fractions import gcd; from functools import lru_cache, reduce; from math import ceil, floor; from sys import stdin, setrecursionlimit
import heapq as hq; import itertools as its; import operator as op


# globals
inf = float('inf')
input = stdin.readline


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


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input().strip()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().strip().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    setrecursionlimit(4100000)
    main()

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

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

Submission status: Accepted

Solution code:
hoge = input().split()
x = int(hoge[0])
a = int(hoge[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)
elif a <= x:
  print(10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

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

def rl():
    return list(input().split())

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

def main():
    x, a = rli()
    if x < a:
        print(0)
    else:
        print(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())

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:
str = input()

X = int(str.split()[0])
A = int(str.split()[1])
if (X < A):
	s = 0
else :
	s = 10

print("{}".format(s))

Submission status: Accepted

Solution code:
ans = 0
n, k = [ int(v) for v in input().split() ]
if n >= k:
	ans += 10
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

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

x, a = na()
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:
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:
def main():
    x, a = [int(val) for val in input().split()]
    print(0 if x < a else 10)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

X, A = (int(i) for i in input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x,a = list(map(int,input().split()))
ret = 10
if x < a:
    ret = 0
print(ret)

Submission status: Accepted

Solution code:
H,W = map(int,input().split(' '))
if H<W:
    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:
xa = list(map(int, list(input().split())))
x = xa[0]
a = xa[1]

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

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
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:
import sys
from operator import itemgetter
from collections import deque

input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def solve():
    X, A = list(map(int, input().split()))
    if X < A:
        return 0
    return 10


def main():
    print(solve())


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [X, A] = [int(input_raw[0]), int(input_raw[1])]
    if X < A:
        print 0
    else:
        print 10
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
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, raw_input().split())
if X < A:
 print '0'
else:
 print '10'

Submission status: Accepted

Solution code:
# ABC130A
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:
def main():
    X, A = map(int, input().split())
    if X >= A:
        print(10)
    else:
        print(0)


main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X, A = MI()
    if X < A:
        print(0)
    else:
        print(10)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


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



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

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

x, a = getList()
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:
import sys

input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X, A):
    return 0 if X < A else 10


def main():
    X, A = read_int_n()
    print(slv(X, A))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
# 一次元累積和
from itertools import accumulate
from bisect import bisect_left, bisect_right

# import numpy as np
# from scipy.special import perm
# from scipy.special import comb

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

# 四方向: 右, 下, 左, 上
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
 
def i_inpl(): return int(input())
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")

########

X, A = l_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)
else:
	print(10)

Submission status: Accepted

Solution code:


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


def gcd(arr):
    g = gcd_core(arr[0], arr[1])
    for i in range(2, len(arr)):
        g = gcd_core(g, arr[i])
    return g

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
import itertools

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,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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


def solve(X: int, A: int):
    if(X >= A):
        print(10)
    else:
        print(0)

    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(X, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

mi = lambda: map(int, input().split())

X, A = mi()

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

Submission status: Accepted

Solution code:
import sys
# input = sys.stdin.readline
inf = 10 ** 18

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

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

Submission status: Accepted

Solution code:
import sys

ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsm = lambda: map(str, sys.stdin.readline().split())
nsl = lambda: list(nsm())


x, a = nm()
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:
# -*- coding: utf-8 -*-
"""
AtCoder A
"""

import sys, math, random
import numpy as np

# N = int(input())
# A = list(map(int,input().split())) # N row 1 column
# A = [int(input()) for _ in range(N)] # 1 row N column
# S = str(input()) # str(input()) == input() -> 'abc'
# S = list(input()) # abc -> ['a','b','c']
# S.replace('ABC','X') # "testABCABC" -> "testXX"
# S=numpp.assaray(S)=="#"
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LLS(): return [list(sys.stdin.readline().rstrip()) for _ in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()



def main():
    X, A = list(map(int,input().split()))
    if X<A:
        print("0")
    else:
        print("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:
def abc():
    x, a = map(int, input().split())
    print(0 if x < a else 10)


abc()

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
Max = sys.maxsize
def l():
    return list(map(int,input().split()))
def m():
    return map(int,input().split())
def onem():
    return int(input())
def s(x):
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa == x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x):
    return " ".join(map(str,x))

x,c = m()

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

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

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

print(ans)

Submission status: Accepted

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


def solve(X: int, A: int):
    if X < A:
        ret = 0
    else:
        ret = 10
    print(ret)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

x,a = na()

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:
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 = (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:
import sys
sys.setrecursionlimit(10 ** 7)


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def SI(): return input()


def main():
    X, A = LI()
    if X < A:
        print(0)
        return
    print(10)


main()

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 permutations, combinations, product
#from operator import itemgetter, mul
from copy import deepcopy,copy
#from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd


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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x, a = MAP()

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

Submission status: Accepted

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


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 = sys.stdin.readline


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

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

Submission status: Accepted

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

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:
def getlist():
	return list(map(int, input().split()))

X, A = getlist()
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(10*int(bool(x >= a)))

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,y = map(int,input().split())
if x<y:
    print(0)
if x>=y:
    print(10)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

x, a = li()

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().strip().split(' '))
print(0 if X < A else 10)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

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

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

def main():

	#N = int(input())
	X, A = map(int, input().split(" "))

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



if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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:
def main():
    x,a = map(int,input().split())
    if x < a:
        print(0)
    else:
        print(10)


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:
import sys
# from bisect import bisect_right
# gcd
# from fractions import gcd
# from math import ceil, floor
# from copy import deepcopy
# from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', 'c', 'b', 'c', 'b', 'a']
# print(S.most_common(2))  # [('b', 5), ('c', 4)]
# print(S.keys())  # dict_keys(['a', 'b', 'c'])
# print(S.values())  # dict_values([3, 5, 4])
# print(S.items())  # dict_items([('a', 3), ('b', 5), ('c', 4)])
# from collections import Counter
# import math
# from functools import reduce
#
# fin = open('in_1.txt', 'r')
# sys.stdin = fin
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template

# def solve(L, A, B, M):
#     ret, digits = 0, 0
#     for d in range(18, 0, -1):
#         lo = 10 ** (d - 1)
#         hi = 10 ** d - 1
#         if hi < A or A + B * (L - 1) < lo:
#             continue
#         imin = 0 if lo <= A else (lo - A + B - 1) // B
#         init = A + B * imin
#         if init > hi:
#             continue
#         imax = L - 1 if A + B * (L - 1) <= hi else imin + (hi - init) // B
#         n = imax - imin + 1
#         p = 10 ** d % M
#         a = matpow([[0,1,0], [0,0,1], [1,1,1]], n, M)
#         # a[0][3] = sum p^i for i in [0, n-1]
#         # a[1][3] = sum i * p^i for i in [0, n-1]
#         # sum (A + B * (imax - i)) * p^i for i in [0, n-1]
#         sub = (A + B * imax) % M * a[1][3] % M + M - (B * a[0][3] % M)
#         ret += sub % M * pow10(digits, M) % M
#         digits += d * (imax - imin + 1)
#     return ret % M


# def pow10(p, mod):
#     if p % 2 == 1:
#         return 10 * pow10(p - 1, mod) % mod
#     elif p > 0:
#         sub = pow10(p // 2, mod)
#         return sub * sub % mod
#     else:
#         return 1


# def matpow(a, p, mod):
#     if p % 2 == 1:
#         return matmul(a, matpow(a, p - 1, mod), mod)
#     elif p > 0:
#         b = matpow(a, p // 2, mod)
#         return matmul(b, b, mod)
#     else:
#         n = len(a)
#         return [[1 if i == j else 0 for j in range(n)] for i in range(n)]


# def matmul(a, b, mod):
#     n = len(a)
#     ret = [[0 for j in range(n)] for i in range(n)]
#     for i in range(n):
#         for k in range(n):
#             for j in range(n):
#                 ret[i][j] += a[i][k] * b[k][j]
#         for j in range(n):
#             ret[i][j] %= mod
#     return ret





if __name__ == '__main__':

    # write code
    X,A = mi()
    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:
x,a  = list(map(lambda x: int(x),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 = 10
print(ans)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import bisect
from datetime import datetime as dt
import bisect
import math

def gcd(a, b):
    return math.gcd(a, b)

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

class slist(list):
    def __init__(self, *args, **kw):
        list.__init__(self, *args, **kw)
        self.sort()

    def append(self, value):
        bisect.insort(self,value)

    def index_left(self, value):
        return bisect.bisect_left(self, value)


if __name__ == '__main__':
    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)