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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

# N = int(input())
# L = [int(x) for x in input().split()]
X, A = map(int, input().split())
# S = input()

print(0 if X < A else 10)

Submission status: Accepted

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# s = input()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

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 getLnInput():
    return input().split()

x, a = map(int, getLnInput())
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('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= 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 if X>=A else 0)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())
 
def ss_raw():
    return input().split()
 
def ints_raw():
    return tuple(map(int, ss_raw()))


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


DIV = 10**9+7

def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret


def main():
    ans =0
    X,A = ints_raw()

    return 0 if X<A else 10

print(main())

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def read():
    X, A = list(map(int, input().strip().split()))
    return X, A


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


if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

x,a = get_nums_l()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(_) for _ in input().split())

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x,a = f()

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

solve()

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify, heapreplace
from collections import defaultdict


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

if __name__ == '__main__':
    Solution().main()

Submission status: Accepted

Solution code:
N, K = map(int, input().split())

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

Submission status: Accepted

Solution code:


def main():
    a, b = map(int, raw_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())

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
from collections import deque  # 双方向キュー
from collections import defaultdict  # 初期化済み辞書
from heapq import heapify, heappush, heappop, heappushpop  # プライオリティキュー
from bisect import bisect_left, bisect_right  # 二分探索
#import numpy as np  # 1.8.2
#import scipy  # 0.13.3

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    X, A = i2nn()
    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:
#!/usr/bin/env python
x, a = map(int, input().split())
if x < a:
    print(0)
else:
    print(10)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
X,A = list(map(int,input().split(" ")))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

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

def main():
  x,a=LI()

  if x<a:
    return 0
  else:
    return 10

print(main())

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    x,a = LI()
    if x < a:
        return 0

    return 10


print(main())

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:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

x, a = mi()

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

print(10 if x >= y else 0)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import random
import collections
import math
import itertools
import bisect

def real_main():
    x, a = read_int_array()
    if x < a:
        print(0)
    else:
        print(10)


def solve():
    pass


def main():
    if False and 'PYCHARM_HOSTED' in os.environ:
        main_pycharm()
    else:
        real_main()


from copy import deepcopy
def main_pycharm():
    solution = solve

    test_inputs = None
    test_outputs = None
    judge = None
    slow_solution = None
    if solution is not None:
        if test_outputs is not None:
            test_with_answers(solution, test_inputs, test_outputs)
        if judge is not None:
            test_with_judge(solution, test_inputs, judge)
        if slow_solution is not None:
            test_with_slow_solution(solution, test_inputs, slow_solution)


def test_with_answers(solution, inputs_answers):
    total, wrong = 0, 0
    for args, test_ans in inputs_answers:
        ans = solution(*args.copy())
        if ans != test_ans:
            print('WRONG! ans=%s, test_ans=%s, args=%s' % (ans, test_ans, args))
            wrong += 1
        else:
            print('GOOD')
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))


def test_with_judge(solution, inputs_gen, judge):
    total, wrong = 0, 0
    for args in inputs_gen:
        ans = solution(*deepcopy(args))
        if not judge(deepcopy(ans), *deepcopy(args)):
            print('WRONG! ans=%s, args=%s' % (ans, args))
            wrong += 1
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))


def test_with_slow_solution(solution, inputs_gen, solution_slow):
    total, wrong = 0, 0
    for args in inputs_gen:
        ans = solution(*deepcopy(args))
        slow = solution_slow(*deepcopy(args))
        if ans != slow:
            print('WRONG! ans=%s, slow=%s, args=%s' % (ans, slow, args))
            wrong += 1
        total += 1
    print('ALL %d TESTS PASSED' % total if not wrong else '%d out of %d tests are WRONG' % (wrong, total))


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

def read():
    return input()

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

def read_array(sep=None, maxsplit=-1):
    return input().split(sep, maxsplit)

def read_int_array():
    return [int(a) for a in read_array()]

# endregion

if __name__ == "__main__":
    main()

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 = list(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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, A = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
x, a = map(int, 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:
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 numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    x,n = LI()
    if x < n:
        print(0)
    else:
        print(10)
    return

#B
def B():
    n = I()

    return

#C
def C():
    n = I()

    return

#D
def D():
    n = I()

    return

#E
def E():
    n = I()

    return

#F
def F():
    n = I()

    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ri = lambda: int(input())
#rl = lambda: [int(x) if x.isdecimal() else x for x in input().split()]
#rl = lambda: list(input().split()))
rl = lambda: map(int,input().split())
rr = lambda N: [list(l) for l in zip(*[rl() for _ in range(N)])]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD = 10**9+7

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

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import string
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")



X, A = list(map(int, sys.stdin.readline().split()))
if X < A:

    print(0)
else:
    print(10)

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

X, A = nl()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def YesNo(x): return 'Yes' if x else 'No'
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 input()

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

print(main())

Submission status: Accepted

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

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

Submission status: Runtime Error

Solution code:
#ABC130 B

N,X = map(int,input().split())
L = list(map(int,input().split()))
D = [0,L[0]]
count = 0
for i in range(2,N+2):
    D.append(D[i-1]+L[i-2])
for i in range(0,N+2):
    if D[i]<= X:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int x, a;
  cin >> x >> a;
  if (x < a) cout << 0 << endl;
  else cout << 10 << endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
W, H, x, y = map(int, input().split())

if x == W / 2 and y == H / 2:
  print((W * H) / 2, 1)
else:
  print((W * H) / 2, 0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = int(input())
#lis = list(map(int,input().split()))
if a<b:
    print(0)
else:
    print(0)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
W,H,X,Y = map(int,input().split())
if W/2 == X and H/2 == Y:
    f = 1
else:
    f = 0
print(W*H/2, f)

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
a = list(map(int,input().split()))
c = 0
r = [0]*N
r[0] = a[0]
minus = 0
minusidx = 0
start = 0
if r[0] >= K:
    c+=N
    minus += r[0]
    minusidx += 1
    start = 1
for i in range(1,N):
    r[i] = r[i-1] + a[i]
    if r[i]-minus >= K:
        c+= N-i
        for j in range(i):
            minus = r[minusidx]
            minusidx += 1
            if r[i] - minus >= K:
                c += N - i
            else:
                break
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# A Rounding
x, a = map(int, input())
if x < a:
    print(0)
else:
    print(1o)

Submission status: Runtime Error

Solution code:
def Input():
    return mapt(int, input().split(" "))

def main():
    a, b = Input()
    print(0 if a < b else 10)

main()

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
s=0
l=list(map(int,input().split()))
c=1
for i in range(n):
  s+=l[i]
  if(s<=k):
    c+=1
  else:
    break
print(c)

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()

def main():

    N, K = NMI()
    A = NLI()
    
    left = 0
    shakutori = 0
    ans = 0
    
    for left in range(N):
        shakutori = 0
        right = left
        
        while shakutori < K and right <N:
            shakutori += A[right]
            right+= 1
            
        if shakutori >= K:
            ans += N-right+1
        else:
            break
        
    print(ans)
    


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
W,H,x,y = map(int,input().split())
flg = 0
if W/2 == x and H/2 ==y:
    ans = (W*H)/2
    flg = 1
elif W/2 == x or H/2 ==y:
    ans = (W*H)/2
    flg = 0
else:
    tatemax = min(W-x,x)*H
    yokomax = min(H-y,y)*W
    if tatemax == yokomax:
        ans = tatemax
        flg =1
    else:
        ans = max(tatemax,yokomax)
        flg =0
print(str(ans)+ " " + str(flg))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:

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

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a =input()
x=input()
A = int(a)
X = int(x)
if A<X:
    print("0")
else:
    print("10")

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = list(map(int, input().split()))

cnt = 0
sum_val = 0
e = 0
for s in range(0, N):
    if (s != 0):
        sum_val = sum_val - l[s - 1]

    while e < N and sum_val < K:
        sum_val = sum_val + l[e]
        e = e + 1

    if (sum_val >= K):
        cnt = cnt + (N - e + 1)


print(cnt)

Submission status: Runtime Error

Solution code:
a=list(map(int,input().split()))
b=list(map(int,input().split()))
no=0
for i in range(0,a[0]):
    if b[i]<=a[1]:
        no+=1 
print(no)

Submission status: Runtime Error

Solution code:
w,h,x,y=map(int,input().split())
ans=0
if (2*x==w)&(2*y==h):
  ans=1
print((w*h)/2,ans)

Submission status: Runtime Error

Solution code:
w,h,x,y=map(int,input().split())
print((w*h)/2,(2*x==w)&(2*y==h))

Submission status: Runtime Error

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

X,A =list(map(int,input().split()))
print(X//A*10)

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

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

print(10 if ri() >= ri() else 0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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