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:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
X, a, b = [int(x) for x in input().split()]
da = abs(X-a)
db = abs(X-b)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    x,a,b = inputMap()
    
    if abs(x-a) < abs(x-b):
        print("A")
    else:
        print("B")
    
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, a, b = list(map(int, input().split()))
def MealDelivery(x, a, b):
    if abs(x -a) < abs(x -b):
        return 'A'
    elif abs(x -a) > abs(x -b):
        return 'B'
    else:
        return 'Even'
ans = MealDelivery(x, a, b)
print(ans)

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

Submission status: Accepted

Solution code:
#n = int(input())
#a = int(input())
#ls = list(input().split(" "))
#ls = list(map(int,input().split(" ")))
x,a,b = list(map(int,input().split(" ")))
#string = input()

distA = abs(x - a)
distB = abs(x - b)

if distA >= distB:
  print("B")
else:
  print("A")

Submission status: Accepted

Solution code:
x, a, b = map(int, input().split())
ax = int((((a-x)**2)**0.5)//1)
bx = int((((b-x)**2)**0.5)//1)
print('A') if ax < bx else print('B')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
x,a,b = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
def ab(x):
  if x > 0 :
    return x
  else:
    return -x


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

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, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

m, b, c = MAP()
# print(min(abs(a - c), abs(a - b)))
if abs(m - b) < abs(m - c):
    print("A")
else:
    print("B")

Submission status: Accepted

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

tmpa = abs(a - x)
tmpb = abs(b - x)
if tmpa < tmpb:
    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("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=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:
# ABC071-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:
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:
# -*- coding: utf-8 -*-

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

# solve
ans = 'A' if abs(x - a) < abs(x - b) else 'B'

# output
print(ans)

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

Submission status: Accepted

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

d_a = abs(x-a)
d_b = abs(x-b)

if d_a < d_b:
  print('A')
else:
  print('B')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = abs(a[0]-a[1])
c = abs(a[0]-a[2])

if b <= c:
  print("A")
else:
  print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def print_ans(x,a,b):
    """Print min(abs(x-a),abs(x-b))

    Parameters
    --------------

    Examples
    ------------
    >>> print_ans(3,0,1)
    B
    >>> print_ans(3,2,5)
    A
    >>> print_ans(2,5,9)
    A
    """
    #print(min(abs(x-a),abs(x-b)))
    if min(abs(x-a),abs(x-b)) == abs(x-b):
      print("B")
    else:
      print("A")




if __name__ == '__main__':
    x,a,b = map(int,input().split())
    print_ans(x,a,b)

Submission status: Accepted

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

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

# print(x)
# print(a)
# print(b)

# print(abs(x - a))
# print(abs(x - b))

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


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

x, a, b = nl()

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

Submission status: Accepted

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


def solve(x: int, a: int, b: int):
    abs_a = abs(x - a)
    abs_b = abs(x - b)

    if abs_a < abs_b:
        print('A')
    else:
        print('B')

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    a = int(next(tokens))  # type: int
    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())

y = x - a
z = x - b
if y < 0:
    y = -1 * y

if z < 0:
    z = -1 * z

if y < z:
    print("A")
else:
    print("B")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

from collections import Counter

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


abc()

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:
#!/usr/bin/env python3
import sys


def solve(x: int, a: int, b: int):
    if abs(a - x) < abs(b - x):
        ret = 'A'
    else:
        ret = 'B'
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    a = int(next(tokens))  # type: int
    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())
da = abs(x-a)
db = abs(x-b)
if da > db:
  print('B')
else:
  print('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, = list(map(int,input().split(" ")))
if abs(a-b)>abs(a-c):
    print("B")
else:
    print("A")

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

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 = 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:
import heapq
from collections import deque
from enum import Enum
import sys
import math
from _heapq import heappush, heappop

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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

    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    solve(x, a, b)


if __name__ == '__main__':
    main()

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:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,a,b=[int(i) for i in input().split()]
c,d=abs(a-x),abs(b-x)
if c<d:
    print("A")
elif c>d:
    print("B")

Submission status: Accepted

Solution code:

l = list(map(int, 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 = 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, raw_input().split())
aa = 0
bb = 0
if a > b:
    aa = a - b
elif a < b:
    aa = b - a
if a > c:
    bb = a - c
elif a < c:
    bb = c - a
if aa > bb:
    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('B' if abs(x-a)>abs(x-b) else 'A')

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc071/tasks/abc071_a
x,a,b = map(int, input().split())
print("B") if abs(a-x)>abs(b-x) else print("A")

Submission status: Accepted

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


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,s,d=map(int,input().split())
if abs(a-s)>abs(a-d):
  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:
l = [int(i) for i in input().split()]
print('A' if abs(l[0]-l[1])<abs(l[0]-l[2]) 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 =[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())
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())

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:

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

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

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

if __name__ == '__main__':
    submit()

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

Submission status: Accepted

Solution code:
import sys, os

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

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

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

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(x: int, a: int, b: int):
    return '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
    result = solve(x, a, b)
    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    x, a, b = (int(_) for _ in input().split())
    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())
print("B" if abs(x-a)>abs(x-b) else "A")

Submission status: Accepted

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

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 = (int(i) for i in 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())
print(["A","B"][abs(a-b) > abs(a-c)])

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 getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    X, A, B = getIntList()
    if abs(X-A) < abs(X-B):
        return 'A'
    else:
        return 'B'


ans = prob()
print(ans)

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)
print('A' if dis_a < dis_b else 'B')

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


x, a, b = inl()
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 - Meal Delivery
x, a, b = list(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=map(int, input().split())

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import math

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, a, b = [int(item) for item 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('B')
else:
  print('A')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[x,a,b] = list(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) else 'B'
print(ans)

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