Problem:

Problem A: Lunch

Problem

  ある日、川林くんは学食で昼食を食べようとしています。
  学食にはAランチ、Bランチ、Cランチの3種類の日替わりのランチメニューがあります。

  川林くんは食いしん坊なので3種類の日替わりのランチメニューをすべて1つずつ食べたいと思っています。

  しかし、川林くんは健康に気を使って摂取するカロリーの合計が最小になるように1種類のランチメニューを我慢し、異なる2種類のランチメニューを食べることにしました。

  ある日のAランチ、Bランチ、Cランチのカロリーが与えられた時、川林くんが我慢することになるランチメニューを求めてください。

Input

入力は以下の形式で与えられる。

$a$ $b$ $c$

  3つの整数$a$, $b$, $c$が空白区切りで与えられる。それぞれ、ある日のAランチ、Bランチ、Cランチのカロリーを表している。

Constraints

入力は以下の条件を満たす。

  
$1 \leq a, b, c \leq 5000 $

  
$a \neq b, b \neq c, c \neq a$

Output

  川林くんが我慢することになるメニュー名を1行に出力せよ。

  Aランチを我慢する場合は"A"

  Bランチを我慢する場合は"B"

  Cランチを我慢する場合は"C"

  と出力せよ。

Sample Input 1

1000 900 850

Sample Output 1

A

Sample Input 2

1000 800 1200

Sample Output 2

C



Sample input:
1000 900 850


Sample output:
A

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
x=["A","B","C"]
print(x[a.index(max(a))])

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if max(A, B, C) == A :
    print("A")
elif max(A, B, C) == B :
    print("B")
else :
    print("C")

Submission status: Accepted

Solution code:

a,b,c = [int(i) for i in input().split()]

if a > b and a > c:
    print("A")
elif b > a and b > c:
    print("B")
else:
    print("C")

Submission status: Accepted

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

Submission status: Accepted

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

if a > b and a > c:
    print ('A')
elif b > a and b > c:
    print ('B')
else:
    print('C')

Submission status: Accepted

Solution code:
menber = ["A","B","C"]
menu = [int(x) for x in input().split() ]

print(menber[menu.index(max(menu))])

Submission status: Accepted

Solution code:
lst=list(map(int,input().split()))
lst2=['A','B','C']
for i,j in enumerate(lst):
    if j==max(lst):
        print(lst2[i])

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(max([(a,'A'),(b,'B'),(c,'C')])[1])

Submission status: Accepted

Solution code:
S = list(map(int,input().split()))
if S.index(max(S)) == 0:
    print("A")
elif S.index(max(S)) == 1:
    print("B")
elif S.index(max(S)) == 2:
    print("C")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
l={'a':a,'b':b,'c':c}
keys=[k for k,v in l.items() if v==max(l.values())]
print(keys[0].upper())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = [ int(s) for s in input().split() ]
  
if a > b and a > c:
    print('A')
elif b > a and b > c:
    print('B')
elif c > a and c > b:
    print('C')

Submission status: Accepted

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

Submission status: Accepted

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

if a > b and a > c:
    print("A")
elif b > a and b > c:
    print("B")
else:
    print("C")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = list(map(int, input().split()))
x = max(X)
Y = ["A", "B", "C"]
print(Y[X.index(x)])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=list(map(int, input().split()))
print('ABC'[A.index(max(A))])

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
a = LI()
s = "ABC"
print(s[a.index(max(a))])
#B

#C

#D

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
A, B, C = map(int, raw_input().split())
if max(A, B, C) == A:
    print "A"
elif max(A, B, C) == B:
    print "B"
else:
    print "C"