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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
S = list(input())
s = list(set(S))
s.sort()
alfa = list('abcdefghijklmnopqrstuvwxyg')
ans = 0
if(len(s)==len(alfa)):
  print('None')
  sys.exit()
else:
  for i in range(len(s)):
    if(s[i]!=alfa[i]):
      print(alfa[i])
      sys.exit()
  print(alfa[len(s)+1])

Submission status: Wrong Answer

Solution code:
import sys
S = list(input())
s = list(set(S))
s.sort()
alfa = list('abcdefghijklmnopqrstuvwxyg')
ans = 0
if(len(s)==len(alfa)):
  print('None')
else:
  for i in range(len(s)):
    if(s[i]!=alfa[i]):
      print(alfa[i])
      sys.exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
data=['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',]
s=list(input())
t=sorted(s)
i=0
while (t[i]==data[i] and i<25):
    i=i+1
if i<25:
    print(data[i])
else:
    print('None')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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


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

    ans = min(abs(x - a), abs(x - b))
    
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
if a < b < c:
    print( 'A' )
elif a < c < b:
    print( 'A' )
elif b < a < c:
    print( 'B' )
elif b < c < a:
    print( 'B' )
else:
    print( 'C' )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if (b-a)>=(c-b):
  print(c-b)
else:
  print(b-a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
S_set = set(S)

for i in range(97,123):
    if chr(i) not in S_set:
        print(chr(i))
        exit()
print("None")

Submission status: Wrong Answer

Solution code:
X, A, B = map(int, input().split())

print(min(abs(X-A), abs(B-X)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = list(input())
S.sort()
import bisect
a_uni = ord('a')

Search = S
for i in range(26):
    char = chr(a_uni+i)

    if Search and Search[0] == char:
        ind = bisect.bisect_right(S,char)
        Search = S[ind:]
        continue
    print(char)
    exit()
print('None')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    x, a, b = map(int, input().split())
    distance_a = a - x
    distance_b = b - x
    if distance_a < 0:
        distance_a = distance_a * -1
    elif distance_b < 0:
        distance_b = distance_b * -1
    if distance_a > distance_b:
        print('B')
    else:
        print('A')
main()

Submission status: Wrong Answer

Solution code:
def main():
    x, a, b = map(int, input().split())
    distance_a = a - x
    distance_b = b - x
    if distance_a < 0:
        distance_a = distance_a * -1
    elif distance_b < 0:
        distance_b = distance_a * -1
    if distance_a > distance_b:
        print('B')
    else:
        print('A')
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())
s = set(s)
s = sorted(s)
m = 'abcdefghijklmnopqrstuvwxyz'

for i in range(len(m)):
    if s[i] != m[i]:
        print(m[i])
        exit(0)

    if i + 1 != len(m) and i + 1 == len(s):
        print(m[i + 1])
        exit(0)

print('None')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(abs(x-a),abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if ad > bd:
    print("A")
elif ad < bd:
    print("B")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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-a):
	print(b)
else:
	print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

kyori1 = abs(x - a)
kyori2 = abs(x - a)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import string

s = set(input())

a = set(string.ascii_lowercase)
b = sorted(list(a - s))
ans = b[0] if len(b) else "None"
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
s = list(set(input()))
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')
count=0
#if s include all alp, print None and exit 
if len(s) == 25:
    print('None')
    sys.exit()

for s_,alp_ in zip(s,alp):
    count += 1  
    if s_ != alp_ :
        print(alp_)
        sys.exit()
    
print(alp[count])

Submission status: Wrong Answer

Solution code:
import sys
s = list(set(input()))
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

count = 0
for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        sys.exit()
    count += 1

print('None' if count == 24 else alp[count])

Submission status: Wrong Answer

Solution code:
import sys
s = list(input())
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        sys.exit()

print(None)

Submission status: Wrong Answer

Solution code:
s = list(input())
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        exit()

print('None')

Submission status: Wrong Answer

Solution code:
import sys
s = list(input())
s.sort()
alp = list('abcdefghijklmnopqrstuvwxyz')

for s_,alp_ in zip(s,alp):
    if s_ != alp_ :
        print(alp_)
        sys.exit()

print('None')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
z,a,b=map(int,input().split());print('BA'[(z-a)//(z-b)==0])

Submission status: Wrong Answer

Solution code:
z,a,b=map(int,input().split());print('AB'[(z-a)//(z-b)!=0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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 c
else:
    print d

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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:
  c = -c

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,a,b = map(int,input().split())
print(["B","A"][2*x<(b+a)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(x_a,x_b)

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

Submission status: Wrong Answer

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: Wrong Answer

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

print(min(abs(x-a),abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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 (a+b)/2>x else 'B')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = str(input())
alphabet = ["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"]

for i in s:
    if i in alphabet:
        alphabet.remove(i)
if len(alphabet)!=0:
    print(alphabet[0])
else:
    print("None")

Submission status: Wrong Answer

Solution code:
s = str(input())
alphabet = ["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"]

for i in s:
    if i in alphabet:
        alphabet.remove(i)
if len(alphabet)!=0:
    print(alphabet[0])
else:
    print("Nome")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
## 以下だめだった。
S = list(input())

# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]

print(all(97<=ord(elem)<=122 for elem in S))
# 除外文字を配列に入れる
excludeS = []
flag = True
for i in range(len(alphabets)):
    if alphabets[i] not in S and all(97<=ord(elem)<=122 for elem in S):
        excludeS.append(alphabets[i])
        flag = False

if flag:
    print('None')
else:
    # 辞書順に並び変えて一番小さい文字を求める
    sortedExcludeS = sorted(excludeS)
    print(sortedExcludeS[0])

# ## これが正答
# S = list(input())
 
# flg = True

# #aからzに対応する
# for i in range(ord('a'), ord('z') + 1):
#     # chr(i)に対応するアルファベットの個数がS内で0だった場合の処理
#     if S.count(chr(i)) == 0:
#         flg = False
#         ans = chr(i)
#         break
 
# print("None" if flg else ans)

Submission status: Wrong Answer

Solution code:
## 以下だめだった。
S = list(input())

# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]

# 除外文字を配列に入れる
excludeS = []
for i in range(len(alphabets)):
    if alphabets[i] not in S and all(97<=ord(elem)<= 122 for elem in S):
        excludeS.append(alphabets[i])
        flag = False
    else:
        flag = True

if flag:
    print('None')
else:
    # 辞書順に並び変えて一番小さい文字を求める
    sortedExcludeS = sorted(excludeS)
    print(sortedExcludeS[0])

# ## これが正答
# S = list(input())
 
# flg = True

# #aからzに対応する
# for i in range(ord('a'), ord('z') + 1):
#     # chr(i)に対応するアルファベットの個数がS内で0だった場合の処理
#     if S.count(chr(i)) == 0:
#         flg = False
#         ans = chr(i)
#         break
 
# print("None" if flg else ans)

Submission status: Wrong Answer

Solution code:
S = list(input())

# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]

# 除外文字を配列に入れる
excludeS = []
for i in range(len(alphabets)):
    if alphabets[i] not in S:
        excludeS.append(alphabets[i])
        flag = False
    else:
        flag = True

if flag:
    print('None')
else:
    # 辞書順に並び変えて一番小さい文字を求める
    sortedExcludeS = sorted(excludeS)
    print(sortedExcludeS[0])

Submission status: Wrong Answer

Solution code:
S = list(input())

# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]

# 除外文字を配列に入れる
excludeS = []
for i in range(len(alphabets)):
    if alphabets[i] not in S:
        excludeS.append(alphabets[i])
        flag = False
        if alphabets[i] == 'Z':
            flag = True
    else:
        flag = True

if flag:
    print('None')
else:
    # 辞書順に並び変えて一番小さい文字を求める
    sortedExcludeS = sorted(excludeS)
    minExcludeS = min(sortedExcludeS)
    print(minExcludeS)

Submission status: Wrong Answer

Solution code:
S =  list(input())
S.sort()
S = set(S)
alphabet = list("abcdefghijklmnopqrstuvwxyz")

for i in alphabet:
    if i in S:
      if i == "z":
        print("None")
      else:
          pass
    elif i not in S:
        print(i)
        break

Submission status: Wrong Answer

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

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

print(r)

Submission status: Wrong Answer

Solution code:
S = input()
X = [chr(i) for i in range(ord('a'), ord('z')+1)]

ans = ''
for x in X:
    if x not in S:
        ans = x
        break
if ans:
    print(ans)
else:
    print('None')

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=list(input())
a=[chr(i) for i in range(97,97+26)]
x=0
for i in range(26):
    if s.count(a[i])==0:
        print(a[i])
        x+=1
        break
if x==0:
    print('None')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, a, b = [int(_) for _ in input().split()]
print(min(abs(a-x), abs(b-x)))

Submission status: Wrong Answer

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

print(min(abs(x - a), abs(x - b)))

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import sys

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

print(min(abs(x-a), abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

print(min(abs(x-a), abs(x-b)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#2019/10/22
#S = open(0).read()
S = input()
# print(S)
set_S=set(S)
# print(set_S)
alpha = "abcdefghijklmnopqrstuvwxyz"
# print(alpha)
productSet = sorted(set_S^set(alpha))
#print(productSet)
print("None" if len(productSet)==0 else productSet[0])

Submission status: Wrong Answer

Solution code:
#2019/10/22
S = open(0).read()
# print(S)
set_S=set(S)
# print(set_S)
alpha = "abcdefghijklmnopqrstuvwxyz"
# print(alpha)
productSet = sorted(set_S^set(alpha))
#print(productSet)
print("None" if len(productSet)==0 else productSet[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
S = input()
cnt = [False] * 26
for i in S:
    if i in "abcdefghijklmnopqrstuvwxyz":
        cnt[ord(i) - ord('a')] = True
 
for i in range(len(cnt)):
    if not cnt[i]:
        print(chr(ord('a')+i))
        sys.exit()
print("None")

Submission status: Wrong Answer

Solution code:
import sys
S = input()
cnt = [False] * 30
for i in S:
    if i in "abcdefghijklmnopqrstuvwxyz":
        cnt[ord(i) - ord('a')] = True
 
for i in range(len(cnt)):
    if not cnt[i]:
        print(chr(ord('a')+i))
        sys.exit()
print("None")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys  # {{{
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools
# }}}

# pre-defined{{{
sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe
# }}}

def local_input():# {{{
    from pcm.utils import set_stdin
    import sys
    from pathlib import Path
    parentdir = Path(os.path.dirname(__file__)).parent
    inputfile = parentdir.joinpath('test/sample-1.in')
    if len(sys.argv) == 1:
        set_stdin(inputfile)
# }}}

def solve():
    print(1)
    return 0

if __name__ == "__main__":# {{{
    try:
        local_input()
        def dump(*args):
            names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
            print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)
    except:
        def dump(*args):
            pass

    solve()

# vim: set foldmethod=marker:}}}

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


S=input()

Alp="qwertyuiopasdfghjklzxcvbnm"

Q=sorted(set(S)^set(Alp))

if len(Q)>0:
	print(Q[0])
else:
	print("None")

Submission status: Wrong Answer

Solution code:
x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
x_a = (x - a) ** 2
x_b = (x - b) ** 2

if x_a > x_b:
	print("b")
# elif x_a == x_b:
# 	print("A = B")
else:
	print("A")