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 getint():
    a = input().split()
    for i in range(len(a)):
        a[i] = int(a[i])
    return a

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

x, a = (int(x) for x in stdin.readline().rstrip().split())
print(0 if x<a else 10)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#130_A
x,a=map(int,input().split())
print(10*(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:
n,a=map(int,input().split())
if n<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 = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
import math
def main():
    t = [int(t)for t in input().split()]
    x,a = t[0],t[1]
    
    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 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(10)
else:
  print(0)

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:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

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

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, X: int, A: int) -> str:

        if X < A:
            return 0
        else:
            return 10


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(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:
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:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.6 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:
number = input().split(" ")
X = int(number[0])
A = int(number[1])
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:
    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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, A = MAP()

print(0 if X < A else 10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, A = [int(s) for s in 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:
import os, sys, re, math

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

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

def main():
    return ((x >= a) & 1) * 10

if __name__ == '__main__':
    ans = main()
    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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc130/tasks/abc130_a

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

Submission status: Accepted

Solution code:
X, A = (int(xa) for xa 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())

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

Submission status: Accepted

Solution code:
# Code for A - Rounding
# Use input() to fetch data from STDIN
[x, a] = [int(x) for x 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 = 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)
else:
    print(0)

Submission status: Accepted

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

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())
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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print(10*(s>=s[2]))

Submission status: Accepted

Solution code:
s=input();print(10*(s>=s[2]))

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

Submission status: Accepted

Solution code:
def LI():
  return [int(s) for s in input().split()]

X,A = LI()

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

Submission status: Accepted

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

    print(0 if x < a else 10)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

res = (int)(10 if X>=A else 0)

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
list = input().split(" ")
x = int(list[0])
a = int(list[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 X>=A:
    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()
nas = lambda: stdin.readline().split()

x, a = na()

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

Submission status: Accepted

Solution code:
# import itertools
# import math


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


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

# P = []
# S = []
# for i in range(N):
#     pp, ss  = map(int, input().split())
#     P.append(pp)
#     S.append(ss)

print(solve(X, A))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#python3
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:
"""
author : halo2halo
date : 12, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b = readline().split()
print(0 if a < b 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=(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())
print(0 if x<a else 10)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())
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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    x,a=INTM()
    if x<a:
        print(0)
    else:
        print(10)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(0 if x<a else 10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split(" ")]

print(10 if a >= b else 0)

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:
def main():
    X, A = map(int, input().split())
    if X < A:
        return 0
    else:
        return 10
    
if __name__ == '__main__':
    print(main())

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())
ans = 10 if X>=A else 0
print(ans)

Submission status: Accepted

Solution code:
x,a = map(int,input().split())
print('100'[x<a::2])

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

Submission status: Accepted

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

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

if N < 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)
elif X >= A:
    print(10)

Submission status: Accepted

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

print(10 if a>=b else 0)

Submission status: Accepted

Solution code:
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() )
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:
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:
    ans = 0
else:
    ans = 10

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


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


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


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

# B


def B():
    S = input()
    S = S[:-1]
    count = 0
    for i in range(len(S)//2):
        if (S[i] != S[-1-i]):
            count += 1

    print(count)
    print(1 << 2)
    return

# C


def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def flagcounter(x):
    if (x == 0):
        return 0
    return flagcounter(x >> 1)+(x & 1)


def C():
    N = II()
    L = []
    A=[]

    for i in range(N):
        A.append(II())
        LL=[]

        for j in range(A[i]):
            x, y = LI()
            LL.append((x-1, y))
        L.append(LL)
    # print(L)
    #print(L[0][0])
    ans=0
    for x in range(1 << N):
        ok=True
        for i in range(N):
            if(x & (1 << i)):
                for j,k in L[i]:
                    if (((x >> j) & 1) ^ k):
                        ok=False 
        if ok :
            ans=max(ans, flagcounter(x))

    print(ans)


# D


def D():

    a, b, x = LI()
    BIG = a*a*b/2
    if x > BIG:
        y = 2*b-(2*x/a/a)
        print(math.degrees(math.atan(y/a)))
    else:
        y = 2*x/a/b
        print(math.degrees(math.atan(b/y)))
    return

# E


def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':

    A()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0 if X < A else 10

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    a, b = [int(x) for x in input().split()]

    if(a < b):
        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)
    exit(0)
print(10)