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())
if abs(x-a)>abs(x-b):print('B')
else:print('A')

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    if abs(x - a) < abs(x - b):
        print("A")
    elif abs(x - a) > abs(x - b):
        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("A")
elif abs(x-a) > abs(x-b):
  print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_position, a_store, b_store = map(int, input().split())

dis_a_s = abs(a_store - s_position)
dis_b_s = abs(b_store - s_position)

if dis_b_s > dis_a_s:
    print('A')
elif dis_a_s > dis_b_s:
    print('B')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
# abc071 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """5 2 7"""
        output = """B"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 999 1000"""
        output = """A"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

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 max(x, a) - min(x, a) < max(x, b) - min(x, b) else "B")

Submission status: Accepted

Solution code:
import sys

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


def main():
    x, a, b = map(int, readline().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(x-a) < abs(x-b):
  print("A")
else:
  print("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('A')
else:
    print('B')

Submission status: Accepted

Solution code:
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(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("AB"[abs(x-a)>abs(x-b)::2])

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:
a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
  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(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 - b) > abs(x - a):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
def main():
    x, a, b = map(int, input().split())
    print('A' if abs(x - a) < abs(x - b) else '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(float,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())
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())
if abs(x-a) <abs(x-b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if abs(b-a)>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('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 print('B')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if (x - a) ** 2 < (x - b) ** 2:
    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=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())
a=abs(X-A)
b=abs(X-B)
if a<b:
    ans="A"
elif b<a:
    ans="B"
print(ans)

Submission status: Accepted

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

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

disa = abs(x-a)
disb = abs(x-b)

print("A" if disa < disb 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())
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:
from collections import defaultdict,deque
import math
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())
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("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("A")
else:
  print("B")

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
if abs(a-x)>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(a-x) < abs(b-x):
  print('A')
else:
  print('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("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:
a, b, c = map(int, input().split())

d = a-b
if d < 0:
  d *= -1
e = a-c
if e < 0:
  e *= -1

if d >= e:
  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:
#n = int(input())
x, a, b = map(int, input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
A=abs(a-x)
B=abs(b-x)
print('A' if A < 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:
n,a,b=map(int,input().split())
if(abs(a-n) < abs(b-n)):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("AB"[abs(x-a)>abs(x-b)])

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

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


def main():
    x, a, b = map(int, readline().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())
da = abs(a - x)
db = abs(b - x)
if da < db:
  print("A")
else:
  print("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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

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

if (abs(x-a) < abs(x-b)):
    print("A")
elif (abs(x-a) > abs(x-b)):
    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())
A = abs(x-a)
B = abs(x-b)
if A > B:
  print('B')
if A < B:
  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())
D = {abs(X-A):"A", abs(X-B):"B"}

print(D[min(abs(X-A), abs(B-X))])

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:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    x, a, b = LI()

    if abs(x - a) < abs(x - b):
        print('A')
    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 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('B')
else:
    print('A')

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
da = abs(x-a)
db = abs(x-b)
print("A" if da < db 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())
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(b - x) > abs(a - x):
    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('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("B")
else:
  print("A")

Submission status: Accepted

Solution code:
# Problem A - Meal Delivery
# input
x, a, b = map(int, input().split())

# check
if abs(x-b)>abs(x-a):
    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())
if (abs(x-a) < abs(x-b)):
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
n,a,b = map(int,input().split())
if abs(n-a)>abs(n-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())
if abs(a-x)<abs(b-x):
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
def main():
    x, a, b = (int(i) for i 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())
if abs(x-a) > abs(x-b):
    print('B')
else:
    print('A')

Submission status: Accepted

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

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:
def solve():
    x, a, b = map(int, input().split())
    if abs(x-a) > abs(x-b):
        print('B')
    else:
        print('A')


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x, a, b = MAP()

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

Submission status: Accepted

Solution code:
tmp = input().split(" ")
x = int(tmp[0])
a = int(tmp[1])
b = int(tmp[2])

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

Submission status: Accepted

Solution code:
x, a,b = map(int, input().split())
xa = abs(a-x)
xb = abs(b-x)
if xa > xb:
	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())
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 = (int(T) for T in input().split())
print(['A','B'][min(abs(x-a),abs(x-b))==abs(x-b)])

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    x, a, b = i_map()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline=sys.stdin.readline
x,a,b=map(int,readline().split())

print(['A','B'][abs(x-a)>abs(x-b)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


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

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

    return


if __name__ == '__main__':
    main()

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

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())
dis_a = abs(x - a)
dis_b = abs(x - b)

if (dis_a > dis_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:
A=list(map(int, input().split()))
x=A[0]
a=A[1]
b=A[2]

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, a, b = M()
if abs(x-a) < abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
x,a,b=map(int,input().split())
ans={abs(x-a):'A',abs(x-b):'B'}
print(ans[min(abs(x-a),abs(x-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("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('B' if abs(x-b) < abs(x-a) else '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(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(' '))
if abs(a-x) < abs(b-x):
  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("B")
else:
    print("A")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
if a < b:
    c = ["A", "B"]
else:
    c = ["B", "A"]
print(c[0] if x < (a + b) / 2 else c[1])

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
li = [abs(x-a), abs(x-b)]
ans = ['A', 'B']
print(ans[li.index(min(li[0], li[1]))])

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','B'][abs(x-a)>abs(x-b)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = [int(s) for s in 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())
a = x - a
b = x - b

if a < 0:
    a = a * -1
if b < 0:
    b = b * -1

if a < b:
    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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

ad = abs(x-a)
bd = abs(x-b)

if ad<bd:
    print("A")
else:
    print("B")

Submission status: Accepted

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.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7


x, a, b = rm()
print('B' if abs(a-x) > abs(b-x) else '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(a-x)
b=abs(b-x)
print("A" if a<b else "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("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 print("B")

Submission status: Accepted

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

l1=abs(a-x)
l2=abs(b-x)

if l1<l2:
  print("A")
else:
  print("B")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

x, a, b = LI()

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

Submission status: Accepted

Solution code:
x,a,b=[int(i) for i in 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('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:
def resolve():
    x, a, b = map(int, input().split())
    la = abs(x-a)
    lb = abs(x-b)

    if la < lb:
        print("A")
    elif lb < la:
        print("B")
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
a = abs(x - a)
b = abs(x - b)
print('A' if a < 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())
print('AB'[(x+x>a+b)^(a>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(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())

flg=0
if b<a:
	b,a=a,b
	flg=1

ans = ["A","B"]

if 2*x<b+a:
	print(ans[flg])
else:
	print(ans[-1+flg])

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 collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
import sys
x,a,b = map(int,input().split())
if x < 0 or a < 0 or b < 0 or x > 1000 or a > 1000 or b > 1000:
    sys.exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
getList = lambda: list(map(int, input().split()))
x,a,b = getList()
if abs(a - x) < abs(b - x):
  print("A")
else:
  print("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())
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")