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:
# -*- coding: utf-8 -*-

x,a,b = list(map(int, input().rstrip().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(a-x)<abs(b-x) 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
input = sys.stdin.readline

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

def main():
    mod=10**9+7
    x,a,b=MI()
    if abs(x-a)<abs(x-b):
        print("A")
    else:
        print("B")

main()

Submission status: Accepted

Solution code:
X,A,B=list(map(int,input().split()))
print(chr(65+((X-A)**2>(X-B)**2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

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


#main
if __name__ == '__main__':
    solve()

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def mealdelivery(x , a , b):

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力 : 数字3つ
x, a, b = map(int, input().split())

# 出力　a, b のうちxに近い方
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())
print('A' if abs(x-b) > abs(x-a) 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())
s=abs(x-a)
print('A' if s==min(s,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())

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

else:
    print("A")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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())
 
x_a = abs(x-a)
x_b = abs(x-b)

if x_a < x_b:
  print("A")
else:
  print("B")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

Solution code:
import math
import calendar
import fractions
import itertools

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(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(c-a) else "B")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if ax<bx:
  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:
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(a-x)<abs(b-x)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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(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:
import sys
input = sys.stdin.readline
x,a,b = [int(i) for i in input().split()]
da = abs(x-a)
db = abs(x-b)
if da > db :
    print('B')
else :
    print('A')

Submission status: Accepted

Solution code:


import numpy as np

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

Submission status: Accepted

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

if ax < bx:
    print("A")
else:
    print("B")

Submission status: Accepted

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

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:
num = input().split()
num_i = [int(s) for s in num]

x, a, b = num_i

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

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

x, a, b = MAP()

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

Submission status: Accepted

Solution code:
import sys


def solve(inp):
    (X, A, B) = map(int, inp.readline().strip().split(' '))

    if abs(X - A) < abs(X - B):
        return "A"
    else:
        return "B"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if abs(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('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")
elif abs(b-x) < abs(a-x):
    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:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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())
xa=abs(x-a)
xb=abs(x-b)
print('A' if xa<xb 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())

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

print("A" if A<B else "B")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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 = input().split()
x = int(x)
a = int(a)
b = int(b)
if x < a:
  dis_ax = a-x
else:
  dis_ax = x-a
if x < b:
  dis_bx = b-x
else:
  dis_bx = x-b
if dis_ax > dis_bx:
  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(lambda x: int(x), 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(' '))
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())

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:
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial
sys.setrecursionlimit(200000)
input = sys.stdin.readline

X, A, B = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
# S = input().strip()

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

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

Submission status: Accepted

Solution code:
import sys

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

def main():
    return 'A' if abs(a - x) < abs(b - x) else 'B'

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x, a, b = map(int, sys.stdin.readline().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(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):
    return abs(a - x) < abs(b - x) and 'A' or 'B'

# 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( 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("B")

else:
  print("A")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,a,b = map(int, input().split())
da = abs(a - x)
db = abs(b - x)
print('A' if da < db 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())
k=abs(x-a)
l=abs(x-b)
if k<l:
    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 = 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()))
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())
s = abs(a - x)
t = abs(b - x)
ans = "A"
if s > t:
    ans = "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:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    x,a,b=MI()
    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(" "))

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

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

t = abs(x-a)-abs(x-b)

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

Submission status: Accepted

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

if distance_a < distance_b:
    ans = "A"
else:
    ans = "B"

print(ans)

Submission status: Accepted

Solution code:
# ABC071a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
def main():
    i = list(map(int, input().split()))
    x = i[0]
    a = i[1]
    b = i[2]

    if not (1 <= x and x <= 1000 and 1 <= a and a <= 1000 and 1 <= b and b <= 1000):
        return
    if x == a or a == b or b == x or abs(x-a) == abs(x-b):
        return

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x, a, b = [int(x) for x in input().split()]
if abs(x - a) - abs(x - b) < 0:
    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): # aの方が近い場合
    print("A")
else: # bの方が近い場合
    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())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import bisect

x,a,b = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

#入力
x, a, b = map(int, input().split())
#N = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    x, a,  b = LI()
    if abs(x-a)-abs(x-b)<0:
        ans = "A"
    else:
        ans = "B"
    print(ans)


import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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