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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 130
# A - Rounding
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())
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:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    X,A=mi()
    print(0 if X<A else 10)





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:
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())
print("1"*(X>=A)+"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:
#a=int(input())
#b,c=int(input()),int(input())
# c=[]
#  for i in b:
#     c.append(i)
X,A = map(int,input().split())
# f = list(map(int,input().split()))
#j = [input() for _ in range(a)]
# h = []
# for i in range(e1):
#     h.append(list(map(int,input().split())))
if X>=A:
    print("10")
if X<A:
    print("0")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
#lis = 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:
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:
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(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:
a = list(map(int,input().split()))
# b = list(map(int,input().split()))

if a[0]<a[1]:
    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:
a = list(map(int,input().split()))
if a[0] >= a[1]:
  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:
X,Y = map(int,input().split())
if X < Y:
    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:
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())
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 Rounding

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

Submission status: Accepted

Solution code:
print(eval(input().replace(" ",">="))*10)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

main()

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:
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,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:
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=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 * (x >= a))

Submission status: Accepted

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

print(0 if X<A else 10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
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:
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:
    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:
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=[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:
a,b = input().split(" ")
if int(a)<int(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:
# coding = SJIS
x, a = map(int, input().split())
ans = 0
if x >= a:
    ans = 10
else:
    ans = 0
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:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

x,a=mp()
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 '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=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" if x < a else "10")

Submission status: Accepted

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

Submission status: Accepted

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

def solve(X, A):
  return (X >= A) * 10


if __name__ == '__main__':
  print(solve(*map(int, input().split())))

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

Submission status: Accepted

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

X, A = LI()


def main():
    ans = 0 if X < A else 10
    print(ans)


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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc126/tasks/abc130_a

x, a = map(int, input().strip().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 = [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()))
print(0 if x < a else 10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]


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

Submission status: Accepted

Solution code:
tmp = input().split(" ")

X = int(tmp[0])
A = int(tmp[1])

if X >= A:
  print("1", end="")
print("0")

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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= 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')
cons = 10 ** 7
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
primes(cons)

Submission status: Accepted

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

Submission status: Accepted

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

# A - Rounding /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# X,Aは 0 以上 9以下の整数です。
# Xが A 未満の時 0、A 以上の時 10を出力してください。

# 制約
#     0≤X,A≤9
#     入力は全て整数である

# 入力
# 入力は以下の形式で標準入力から与えられる。
# X A

# 出力
# Xが A 未満の時 0、A 以上の時 10を出力せよ。

# 入力例 1
# 3 5

# 出力例 1
# 0

# 3は 5 未満であるので、0を出力してください。

# 入力例 2
# 7 5

# 出力例 2
# 10

# 7は 5 以上であるので、10を出力してください。

# 入力例 3
# 6 6

# 出力例 3
# 10

# 6は 6 以上であるので、10 を出力してください。


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    X, A = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(M):
    #     valueses.append(list(map(int, lines[i+1].split())))

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

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3 5']
        lines_export = [0]
    if pattern == 2:
        lines_input = ['7 5']
        lines_export = [10]
    if pattern == 3:
        lines_input = ['6 6']
        lines_export = [10]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    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,y = map(int,input().split())
if x<y:
	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())
print(10*(X>=A))

Submission status: Accepted

Solution code:
n, k = (int(xi) for xi in input().split())

if n<k:
  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 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())

print(int(X >= A) * 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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a < b :
    print(0)
if a>= b:
    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 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 a>x 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:
import sys
X,A = map(int,input().split())

if not ( 0 <= X <= 9 and 0 <= A <= 9 ): sys.exit()

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

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

X, A = rl()

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

Submission status: Accepted

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(int,input().split())
  
x,a=input2()
if x<a:
	print(0)
else:
	print(10)

Submission status: Accepted

Solution code:
s = input().split(" ")
if int(s[0]) < int(s[1]):
  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:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列

    if N<K:print(0)
    else:print(10)




if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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 = lambda: sys.stdin.readline().rstrip()

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:
n, k = map(int, input().split())
# n = int(input())
# li = list(map(int, input().split()))
print(0 if n<k else 10)

Submission status: Accepted

Solution code:
x,a = 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:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7
a, b = rm()
print(10 if a >= b else 0)

Submission status: Accepted

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

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

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 = (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())
print([10,0][x<a])