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:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

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

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

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""



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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X, A = (map(int, input().split()))
if X < A:
    print(0)
else:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

XA = list(map(int, input().split()))

if XA[0] < XA[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:
x, a = [int(v) for v in input().split()]

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

Submission status: Accepted

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

import sys
input = sys.stdin.readline

def io_generator():
	return input()

#+++++++++++++++++++

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

#++++++++++++++++++++

if __name__ == "__main__":
	io= lambda : io_generator()
	print (main(io))

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:
    ans = 0
else:
    ans = 10

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

Submission status: Accepted

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

s = list(map(int,input().split()))

if s[0] < s[1]:
    print(0)
else:
    print(10)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

fin = sys.stdin.readline
X, A = [int(elem) for elem in fin().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] = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from sys import exit
X, A = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
# exit()
if X < A:
    print(0)
else:
    print(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:
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 = 10
else:
    ans = 0
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def read_input():
    x, a = map(int, input().split())
    return x, a


def submit():
    x, a = read_input()

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

if __name__ == '__main__':
    submit()

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

input = lambda: stdin.readline()
main()

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

XA = input().split(' ')
X = int(XA[0])
A = int(XA[1])

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:
a,b=list(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:
#  --*-coding:utf-8-*--


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    data = input().split()
    X = int(data[0])
    A = int(data[1])
    if X < A:
        print(0)
    else:
        print(10)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, itertools, collections
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, A = map(int,input().split()) # 複数の数字を変数に格納

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

Submission status: Accepted

Solution code:
import sys

x, a = list(map(int, sys.stdin.readline().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:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [X, A] = string_to_int(inputs[0])
    if X >= A:
        return 10
    else:
        return 0


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

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

X,A =[int(x) for x in input().split()]

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

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

Submission status: Accepted

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

XA = input()
X = int(XA.split(' ')[0])
A = int(XA.split(' ')[1])

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
inp = input()
split_input = inp.split()
x = int(split_input[0])
a = int(split_input[1])
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:

def solve():
    pass

def main():
    X, A = [int(x) for x in 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)
elif x >= a:
    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 = map(int,input().split())
if x >= y:
  print(10)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

print(0 if X < A else 10)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X,A = [int(i) for i in input().split(" ")]
if X < A:
    print("0")
elif A <= X:
    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:
# n=int(input())
# a,b=map(int, input().split())
# c=list(map(int, input().split()))
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# a=100
# b=0.987654321
# print('{0:06d}-{1:6f}'.format(a,b))  # 0埋めのときの出力
# 000100-0.987654

import numpy as np
import math
import copy

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

Solution code:
x, a = map(int ,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:
A,X = [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:
    print(0)

else:
    print(10)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

def main():
    input = sys.stdin.readline
    X, A = map(int, input().split())

    if X < A:
        return 0
    else:
        return 10

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
x,a=map(int,input().split())
ans=0
if(x>=a):
    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:
from sys import stdin
X, A = [int(_) for _ in stdin.readline().rstrip().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, raw_input().split(' '))
if X < A:
    print '0'
else:
    print '10'

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def main():
    n = [int(i) for i in input().split()]
    if n[0] < n[1]:
        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:
m, n = [int(i) for i in input().split()]
if(m >= n):
  print(10)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

ans = 0 if x<a else 10

print(ans)

Submission status: Accepted

Solution code:
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,10)[X>=A])

Submission status: Accepted

Solution code:
read = input 
rn = lambda :list(map(int, read().split()))
x,a = rn()
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:
#!/usr/bin/env python3
import sys


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    buf = input()
    buflist = buf.split()
    X = int(buflist[0])
    A = int(buflist[1])
    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)

if x >= a:
  print(10)

Submission status: Accepted

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



"""
import sys


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


def main(args):
    X, A = map(int, input().split())
    ans = solve(X, A)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
XA = [int(i) for i in input().split()]
answer = -1
if(XA[0] < XA[1]):
    answer = 0
else:
    answer = 10
print(answer)

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

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 '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

#n=int(input())
#a=[int(i) for i in input().split()]
print(ans)

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X,A=MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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:
n, k = list(map(int, input().split()))

if n < k:
  print(0)
else:
  print(10)

Submission status: Accepted

Solution code:
import math

#n = int(input())
n, m = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#list = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = input()
#list = list(s)


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

Submission status: Accepted

Solution code:
# coding:utf-8


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)

debug = True
#debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)


# n = int(input())
# a, b = map(int, input().split())
# int_list = list(map(int, input().split()))
# l = list(input().split())

def solve():
    x, a = map(int, input().split())\

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

solve()

Submission status: Accepted

Solution code:
a = 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:
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()]
print(0 if X < A else 10)

Submission status: Accepted

Solution code:
# 2019/06/16
# AtCoder Beginner Contest 130 - A

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

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

# Output
print(ans)

Submission status: Accepted

Solution code:
#A

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:
import sys
from collections import Counter, deque, defaultdict

# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7

# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
# A = [int(input()) for _ in range(N)]

X, A = [int(x) for x in input().split()]


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 16 20:55:03 2019

@author: Yamazaki Kenichi
"""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
(N,M) = (int(i) for i in input().split(" "))
print(0 if N < M else 10)

Submission status: Accepted

Solution code:
from itertools import combinations
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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


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