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

Submission status: Accepted

Solution code:
#create date: 2020-06-29 13:35

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    x, a = na()
    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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
x,a  = map(int, input().split())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a,b=map(int,input().split())
print("0"*(a<b)or 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())
print(10*(x>=a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input().split()
x=int(n[0])
A=int(n[1])
if x<A:
    print("0")
else:
    print("10")

Submission status: Accepted

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

if x<a:
    print('0')

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

0<X<9
0<A<9

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

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

X, A = map(int, sys.stdin.readline().strip().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 A<=X:
    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:
a,b=map(int, input().split())
assert 0<=a,b<=9

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

Submission status: Accepted

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


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())
print("0" if X < A else "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:
arr = input().split()
x,a = int(arr[0]),int(arr[1])
if x < a: print(0)
else: print(10)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    return


if __name__ == '__main__':
    main()

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

#a = int(input())
#b = list(map(int, input().split()))
x, a = map(int, input().split())
#s = input()
#s,t = input().split()
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

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

Submission status: Accepted

Solution code:
def MI():
    return map(int, input().split())

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

X, A = MI()

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b=map(int,input().split())
if b-a>0:
    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()))
# a = list(map(int, input().split()))
# data = [list(map(int, input().split())) for i in range(n)]
# k = int(input())
# a = list(map(int, input().split()))
# ab_sorted = sorted(ab, key=lambda x: x[0])
#ab = [list(map(int, input().split())) for i in range(n)]
# print(min(15*n, 100*(n//10+1), 100*(n//10)+15*(n % 10)))
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


def solve():
    X, A = map(int, input().split())

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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, raw_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:
# 初期入力
import sys
input = sys.stdin.readline
X,A = (int(x) for x in input().split())
if A <= X:
    print(10)
else:
    print(0)

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


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

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

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

X = abc[0]
A = abc[1]

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 = (int(a) for a in input().split()) 

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

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[0]>=num[1]:
    print(10)
  else:
    print(0)

main()

Submission status: Accepted

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

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())
print(0 if a < b 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:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


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

Submission status: Accepted

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

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(y) for y 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 intMap(): return map(int,input().split())

x,a = intMap()

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

Submission status: Accepted

Solution code:
print(int(eval('>='.join(input().split())))*10)

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [int(x) for x 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(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())
print(0) if X<A else print(10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# check
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:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, a = M()
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 os

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 collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import numpy as np
import sys
sys.setrecursionlimit(10**6)

#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
input_list = lambda : list(map(int,input().split()))


x,a=input_list()
if x<a:
    print(0)

else:
    print(10)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy

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 = list(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(0if 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
import math
import bisect

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*(X>=A))

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############
X,A = inputIL()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue May 12 00:18:12 2020

@author: shinba
"""


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:
def rounding(x, a):

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    X, A = (int(x) for x in input().split())
    if X >= A:
        print(10)
    else:
        print(0)


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,A = map(int, input().split())
# R = int(input())
# B = int(input())
# C = int(input())
# b = input()
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())

print(0 if x<a else 10)

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_130_A()

Submission status: Accepted

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

Submission status: Accepted

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


solve()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

Submission status: Accepted

Solution code:
# ABC130A

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:
# A - Rounding

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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