Problem:


Score : 100 points

Problem Statement

Snuke lives at position x on a number line.
On this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.

Snuke decided to get food delivery from the closer of stores A and B.
Find out which store is closer to Snuke's residence.

Here, the distance between two points s and t on a number line is represented by |s-t|.

Constraints

1 \leq x \leq 1000

1 \leq a \leq 1000

1 \leq b \leq 1000

x, a and b are pairwise distinct.

The distances between Snuke's residence and stores A and B are different.

Input

Input is given from Standard Input in the following format:

x a b

Output

If store A is closer, print A; if store B is closer, print B.

Sample Input 1

5 2 7

Sample Output 1

B

The distances between Snuke's residence and stores A and B are 3 and 2, respectively.
Since store B is closer, print B.

Sample Input 2

1 999 1000

Sample Output 2

A



Sample input:
5 2 7


Sample output:
B

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
da=abs(x-a)
db=abs(x-b)
if da<db:
  print("A")
elif da>db:
  print("B")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

X,A,B = I()
if abs(A-X) > abs(B-X):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from functools import reduce
from math import gcd


def lcm(a, b):
    # 最小公倍数
    g = gcd(a, b)
    return a // g * b


x, a, b = ints()
# https://atcoder.jp/contests/abc071/tasks/abc071_a
print('A' if abs(x - a) < abs(x - b) else 'B')

Submission status: Accepted

Solution code:
def solve():
    x, a, b = map(int, input().split())
    if min(abs(a-x), abs(b-x)) == abs(a-x):
        print("A")
    else:
        print("B")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

x,a,b=nii()
print('A' if abs(x-a)<abs(x-b) else 'B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
  print('A')
else:
  print('B')

Submission status: Accepted

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

x, a, b = mapint()
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print("A" if min(abs(x-a), abs(x-b))==abs(x-a) else "B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
A = abs(a-x)
B = abs(b-x)

if A > B:
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
if abs(X-A)>abs(X-B):
  print('B')
else:
  print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x-a)>abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

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

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa < xb:
    print("A")
else:
    print("B")

Submission status: Accepted

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

x_a = abs(x-a)
x_b = abs(x-b)

if (x_a > x_b):
    print("B")

else:
    print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int,input().split())
if abs(x - a) < abs(x - b):
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    x, a, b = list(map(int, input().split()))

    print('A') if abs(x - a) < abs(x - b) else print('B')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if abs(x -a) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Submission status: Accepted

Solution code:
def actual(x, a, b):
    # すぬけ君の位置から店A,B までの距離は異なる

    if abs(x - a) < abs(x - b):
        return 'A'

    return 'B'

x, a, b = map(int, input().split())
print(actual(x, a, b))

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    a = abs(a - x)
    b = abs(b - x)
    if a < b:
        print('A')
    else:
        print('B')
main()

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A") if abs(x-a)<abs(x-b) else print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A") if abs(x-a)<abs(x-b) else print('B')

Submission status: Accepted

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

if abs(a-x)<abs(b-x):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
y=abs(x-a)
z=abs(b-x)
if y<z:
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc071/tasks/abc071_a
# simulation
x, a, b = map(int, input().split())

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(a-x) > abs(b-x):
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
x, A, B = map(int,input().split())
a = abs(x-A)
b = abs(x-B)

if a > b:
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
  print('A')
else:
  print('B')

Submission status: Accepted

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

if abs(a-x)>abs(b-x):
  print('B')
else:
  print('A')

Submission status: Accepted

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

print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if(abs(x-a) > abs(x-b)):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
d1=abs(x-a)
d2=abs(x-b)
if d1<d2:print('A')
else:print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(a - x) < abs(b - x):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print('AB'[abs(x-a)>abs(x-b)])

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print(['A','B'][abs(x-a)>abs(x-b)])

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    if abs(x - a) < abs(x - b):
        ans = "A"
    else:
        ans = "B"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print(['A','B'][abs(x-a)>abs(x-b)])

Submission status: Accepted

Solution code:
x, a, b =map(int, input().split())
print("A" if abs(a-x)<abs(b-x) else "B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print("A" if abs(x-a) < abs(x-b) else "B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A" if abs(a-x)<abs(b-x) else "B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
distance_a = abs(a - x)
distance_b = abs(b - x)

if distance_a < distance_b:
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print("AB"[abs(x-a)>abs(x-b)])

Submission status: Accepted

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

k = (x - a) ** 2
l = (x - b) ** 2

if k < l:
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
da = abs(x - a)
db = abs(x - b)
if da < db: print('A')
else: print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if(abs(a- x)< abs(b- x)):
  print("A")
else:
  print("B")

Submission status: Accepted

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

if abs(a-x) < abs(b-x):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(x-a)<abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

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

if abs(x-a) < abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print('BA'[abs(x-a)<abs(x-b)])

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
DisXA=abs(a-x)
DisXB=abs(b-x)
if DisXA<DisXB:
    print('A')
else:
    print('B')

Submission status: Accepted

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

if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
#======================================================#
def main():
    x, a, b = MII()
    print('A' if abs(a-x) < abs(x-b) else 'B')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
i = abs(x-a)
j = abs(x-b)
if i < j:
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

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

A=abs(x-a)
B=abs(x-b)

if A>B:
  print('B')
else:
  print('A')

Submission status: Accepted

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

if abs(x-a) > abs(x-b):
  print('B')
else:
  print('A')

Submission status: Accepted

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

if abs(x-a)<abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

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

if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

if abs(a - x) > abs(b - x):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    x, a, b = mi()
    print('A') if abs(x-a) < abs(x-b) else print('B')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
  print('B')
else:
  print('A')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x, a, b=list(map(int, input().split()))
if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print("B" if abs(x-a) > abs(x-b) else "A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print("A" if abs(x-a) < abs(x-b) else "B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print("A" if abs(x - a) < abs(x - b) else "B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A" if abs(x-a)<=abs(x-b) else "B")

Submission status: Accepted

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

print('A' if abs(a-x) < abs(b-x) else 'B')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:

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

print('A' if (abs(a-x)<abs(b-x)) else 'B')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print('AB'[abs(a-x)>abs(b-x)])

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
def check():
    if abs(B-A)<abs(C-A):
        return 'A'
    return 'B'
print(check())

Submission status: Accepted

Solution code:
import sys
#import numpy as np
import math
#from fractions import Fraction
#import itertools
from collections import deque
#import heapq
from fractions  import gcd

input=sys.stdin.readline
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(x - a) > abs(x - b):
    print("B")
else :
    print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
z = input().split()
x = int(z[0])
a = int(z[1])
b = int(z[2])
A = x - a
B = x - b
if A < 0:
  A = A*-1
if B < 0:
  B = B*-1
if A > B:
  print('B')
else:
  print('A')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
    print("A")
    exit()
print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, a, b = map(int, readline().split())
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

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

if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

A = abs(x-a)
B = abs(x-b)

if A > B:
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A"if abs(x-a)<abs(x-b) else "B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b) :
    print('B')
else :
    print('A')

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
if abs(y-x) < abs(z-x):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
xa = (x-a)**2
xb = (x-b)**2

if xa > xb:
    print('B')
elif xb > xa:
    print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x-a)>abs(x-b) :
    print('B')
else :
    print('A')

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

if abs(a - x) > abs(b - x):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x, a, b = list(map(int, input().split()))
if abs(x - a) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

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

if abs(a - x) < abs(x - b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x-a) > abs(x-b):
	print("B")
else:	
	print("A")

Submission status: Accepted

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

if abs(x-a)<abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

x1 =abs(x - a)
x2 =abs(x - b)

if x1 > x2:
    print("B")

else:
    print("A")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x-a) <= abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
X, A, B = map(int, input().split())
print("A" if abs(X - A) < abs(X - B) else "B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print ("A") if abs(x-a) < abs(x-b) else print ("B")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print('A' if abs(a - x) <= abs(b - x) else 'B')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    x, a, b = map(int, input().split())
    print("A") if abs(x - a) < abs(x - b) else print("B")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

if abs(x-a) <  abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
print('A' if abs(x-a)<abs(x-b) else 'B')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 11:42:53 2020

@author: shinba
"""

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

if abs(x-a) > abs(x-b):
    print("B")
else:
    print("A")

Submission status: Accepted

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

if abs(x-a)<=abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if abs(x-a)<abs(x-b):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x, a, b = map(int, input().split())
print('BA'[abs(a - x) < abs(b - x)])

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(a-x)>abs(b-x):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    x,a,b=map(int,input().split())
    print('A' if abs(x-a)<abs(x-b) else 'B')
    
resolve()

Submission status: Accepted

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

def resolve():
    x,a,b=map(int, input().split())
    A=abs(a-x)
    B=abs(b-x)
    if A>B:
        print('B')
    else:
        print('A')

resolve()

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,b = inputIL()

if abs(x-a)>abs(x-b):
  print("B")
else:
  print("A")

Submission status: Accepted

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

print("A" if abs(x-a) <= abs(x-b) else "B")

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    x, a, b = map(int, input().split())
    if abs(x - a) < abs(x - b):
        print('A')
    else:
        print('B')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(a-x) > abs(b-x):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x,a,b=input().split()
x=int(x)
a=int(a)
b=int(b)
if x<a:
	distance_xa=a-x
else:
    distance_xa=x-a
if x<b:
  distance_xb=b-x
else:
  distance_xb=x-b
if distance_xa<distance_xb:
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    if abs(x-a) < abs(x-b):
        ans = 'A'
    else:
        ans = 'B'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

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

if abs(x - a) > abs(x - b):
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x-a) > abs(x-b):
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
def ABC_71_A():
    X,A,B = map(int, input().split())
    
    if abs(X-A) <= abs(X-B):
        print('A')
    else:
        print('B')

if __name__ == '__main__':

    ABC_71_A()

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
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
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, b = ri_()
print('A' if abs(a - x) < abs(b - x) else 'B')

Submission status: Accepted

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

xa = abs(x - a)
xb = abs(x - b)

if xa > xb:
    print("B")
else:
    print("A")

Submission status: Accepted

Solution code:
x, a, b = list(map(int,input().split()))
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:

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

print("A" if abs(a-x) < abs(b-x) else "B")

Submission status: Accepted

Solution code:
x, a, b = list(map(int,input().split()))
print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

Solution code:
def main():
    x,a,b = (int(x) for x in input().split())
    if abs(a-x) < abs(b-x): print('A')
    else: print('B')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split());print("BA"[abs(x-a)<abs(x-b)])

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
ad=abs(x-a)
bd=abs(x-b)

if ad > bd:
    print("B")
elif ad < bd:
    print("A")

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

x, a, b = map(int, input().split())
print("A" if abs(x - a) < abs(x - b) else "B")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(x-a)>abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print('A' if abs(x-a) < abs(x-b) else 'B')

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
print(['A', 'B'][abs(x - a) > abs(x - b)])

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
print(['A','B'][abs(x-a) > abs(x-b)])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if abs(a-b)>abs(c-a):
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
x,a,b = map(int,input().split())
if abs(a-x)<abs(b-x):
    print("A")
else:
    print("B")

Submission status: Accepted

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

if abs(X - A) < abs(X - B):
    print ('A')
else:
    print ('B')