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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = list(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('B')
elif abs(x-a) < abs(x-b):
  print('A')

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 accumulate, permutations, combinations, product, groupby
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
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("B")
else:
	print("A")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Submission status: Accepted

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

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())
c=abs(a-x)
d=abs(b-x)
if c>d:
    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:
n,a,b = map(int,input().split())
if abs(n-a)<abs(n-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())

kyori1 = max(x,a) - min(x,a)
kyori2 = max(x,b) - min(x,b)

if kyori1 < kyori2:
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
a,b,c=map(int,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())
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","B"][abs(x-b)<=abs(x-a)])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

x,a,b=MI()
l1=abs(x-a)
l2=abs(x-b)
if l1<l2:
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if x < a:
    distance_xa = a - x
else:
    distance_xa = x - a
# print("distance_xa = ", distance_xa)

if x < b:
    distance_xb = b - x
else:
    distance_xb = x - b
# print("distance_xb = ", distance_xb)

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

Submission status: Accepted

Solution code:
# ABC071A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

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:
# n, T = map(int, input().split())
# t = list(map(int, input().split()))
# ans = 0
# for i in range(1,n):
#     d = t[i] - t[i-1]
#     if d < T:
#         ans = t[i]
#     else:
#         ans += T
# ans += T
# print(ans)

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(i) for i in input().split()]
n=abs(a-x)
m=abs(b-x)
if n>m:
  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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
#print("x = ", x)
#print("a = ", a)
#print("b = ", b)

if x < a:
  distance_xa = a - x
else:
  distance_xa = x - a
#print("distance_xa = ", distance_xa)

if x < b:
  distance_xb = b - x
else:
  distance_xb = x - b
#print("distance_xb = ", distance_xb)

if distance_xa < distance_xb:
  print("A")
else:
  print("B")

Submission status: Accepted

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

Submission status: Accepted

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

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 = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x = ", x)
# print("a = ", a)
# print("b = ", b)
if x < a:
 distance_xa = a - x
else:
 distance_xa = x - a
# print("distance_xa = ", distance_xa)
if x < b:
 distance_xb = b - x
else:
 distance_xb = x - b
# print("distance_xb = ", distance_xb)
if distance_xa < distance_xb:
 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())

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

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("A")
else:
  print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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


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

Submission status: Accepted

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

if s<t:
    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('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:
a,b,c = list(map(int,input().split()))
if abs(b-a) < abs(c-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())
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())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=input().rstrip().split()
n=[int(x) for x in n]

if abs(n[1]-n[0])<abs(n[2]-n[0]):
  print("A")
else:
  print("B")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

alen=abs(x-a)
blen=abs(x-b)

if alen<blen:
    print("A")
else:
    print("B")

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

Submission status: Accepted

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

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:
a,b,c = map(int, input().split())
if abs(b - a) > abs(c -a):
  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:
# https://atcoder.jp/contests/abc071/tasks/abc071_a

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

Submission status: Accepted

Solution code:
t = [int(v) for v in input().split(" ")]

n = t[0] - t[1]
n2 = t[0] - t[2]
if abs(n) > abs(n2):
  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:
import sys

x, a, b = map(int, sys.stdin.readline().split())

def main():
    db = abs(b - x)
    da = abs(a - x)
    ans = 'A' if da < db else 'B'
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 071: A – Meal Delivery
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())

dis_a = abs(x-a)
dis_b = abs(x-b)

if dis_a <= dis_b:
    print("A")
else:
    print("B")

Submission status: Accepted

Solution code:
import math
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
x,a,b =iim()

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    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())
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:
z,a,b=map(int,input().split());print('AB'[abs(z-a)>abs(z-b)])

Submission status: Accepted

Solution code:
import math

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

#print(*ans, sep='\n')

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 = [int(x) for x in 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())
print("A" if abs(x-a)<abs(x-b) else "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:
# Author: cr4zjh0bp
# Created: Sun Mar 22 22:02:37 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

x, a, b = na()
c, d = abs(x - a), abs(x - b)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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 = (int(x) for x 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("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:
#!/usr/bin/env python3
import sys


def solve(x: int, a: int, b: int):
    print("A" if abs(a - x) < abs(b - x) else "B")


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
    b = int(next(tokens))  # type: int
    solve(x, a, 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())
if abs(x - a) < abs(x - b):
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,a,b = [int(x) for x in 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 x>=a:
  i=x-a
else:
  i=a-x
if x>=b:
  j=x-b
else:
  j=b-x
print("A"if i<=j else"B")

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split(' ')]
if abs(l[0]-l[1]) < abs(l[0]-l[2]):
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
x, a, b = [int(i) for i in input().split()]
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("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:
#abc070 a 
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()))
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("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('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:
# A - Meal Delivery
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 = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
if abs(a[0]-a[1])<abs(a[0]-a[2]):
	print('A')
else:
	print('B')

Submission status: Accepted

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


def solve(x: int, a: int, b: int):
    if abs(a-x) > abs(b-x):
        return "B"
    else:
        return "A"


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    print(solve(x, a, 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())

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

Submission status: Accepted

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

s = x-a;t = x-b

if s < 0:
    s = -s
if t < 0:
    t = -t
    
if s > t:
    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, raw_input() .split())
c = abs(a-x)
d = abs(b-x)
if c < d and d > c:
    print "A"
else:
    print "B"

Submission status: Accepted

Solution code:
x,a,b=map(int,raw_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:
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
x, a, b = map(int,input().split())
if abs(x-a)<abs(x-b):
    print('A')
else:
    print('B')

Submission status: Accepted

Solution code:
L=list(map(int,input().split()))
A=abs(L[0]-L[1])
B=abs(L[0]-L[2])
if min(A,B)==A:
	print("A")
else:
	print("B")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d = int(b-a)
e = int(c-a)
if d < 0:
  d = -d

if e < 0:
  e = -e

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