Problem:


Score : 100 points

Problem Statement

Snuke is buying a bicycle.
The bicycle of his choice does not come with a bell, so he has to buy one separately.

He has very high awareness of safety, and decides to buy two bells, one for each hand.

The store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.
Find the minimum total price of two different bells.

Constraints

1 \leq a,b,c \leq 10000

a, b and c are integers.

Input

Input is given from Standard Input in the following format:

a b c

Output

Print the minimum total price of two different bells.

Sample Input 1

700 600 780

Sample Output 1

1300

Buying a 700-yen bell and a 600-yen bell costs 1300 yen.

Buying a 700-yen bell and a 780-yen bell costs 1480 yen.

Buying a 600-yen bell and a 780-yen bell costs 1380 yen.

The minimum among these is 1300 yen.

Sample Input 2

10000 10000 10000

Sample Output 2

20000

Buying any two bells costs 20000 yen.



Sample input:
700 600 780


Sample output:
1300

Submission status: Wrong Answer

Solution code:
import sys
S = input()

for i in range(1, len(S)):
  s = S[:-i]
  l = len(s) // 2
  if s[:l] == s[l:]:
    print(len(s))
    sys.exit()

Submission status: Wrong Answer

Solution code:
import sys
S = input()

for i in range(1, len(S)):
  s = S[:-i]
  l = len(s) // 2
  if s[:l] == s[l:]:
    print(len(s))

Submission status: Wrong Answer

Solution code:
lst = input().split()

for i in range(3):
   lst[i] = int(lst[i])

print(lst[0] + lst[1])

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
sorted(A)
print(A[0] + A[1])

Submission status: Wrong Answer

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

kei = 0
if a < b and a < c:
    kei += a
    if b < c:
        kei += b
    else:
        kei += b
elif b < a and b < c:
    kei += b
    if a < c:
        kei += a
    else:
        kei += c
else:
    kei += c
    if a < b:
        kei += a
    else:
        kei += c
print(kei)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r, g, b = input().split()

print(min(int(r) + int(g), int(r) + int(b), int(g) + int(r)))

Submission status: Wrong Answer

Solution code:
# 数値の取得
p_list = list(map(int,input().split()))

# 値段の安い2つを加算し出力
p_list.sort
pare = p_list[0] + p_list[1]
print(pare)

Submission status: Wrong Answer

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

if a>b:
  print(b+c)
 
elif b>c:
  print(a+c)
 
else:
  print(a+b)

Submission status: Wrong Answer

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

print(min(a + b, a + c, a + c))

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
a.sort()
print(a[:2])

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
ls=[a,b,c]
ls.sort()
print(a+b)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
a = list(map(int, input().split()))
print(sum(a[0:2]))

Submission status: Wrong Answer

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

x.sort

print(x[0] + x[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
print(a + b if a + b < b + c or a + b < c + a else (b + c if b + c < c + a else c + a))

Submission status: Wrong Answer

Solution code:
check = input().split()
check.sort()
print(int(check[0]) + int(check[1]))

Submission status: Wrong Answer

Solution code:
s=list(map(int, input().split()))
s.sort
print(s[0]+s[1])

Submission status: Wrong Answer

Solution code:
price=list(input().split())

price.sort()

print(int(price[0])+int(price[1]))

Submission status: Wrong Answer

Solution code:
price=list(input().split())

price.sort()

print(price[0]+price[1])

Submission status: Wrong Answer

Solution code:
a = list(sorted(list(map(int,input().split()))))
print(a[-1] + a[-2])

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
print(sorted(a)[-1] + sorted(a)[-2])

Submission status: Wrong Answer

Solution code:
abc = input().split()
abc.sort()
print(int(abc[0]) + int(abc[1]))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
x = [a+b, b+c, c+a]
sorted(x)
print(x[0])

Submission status: Wrong Answer

Solution code:
l=list(map(int,input().split()))
d=min(l)
e=min(l)
print(d+e)

Submission status: Wrong Answer

Solution code:
l=list(map(int,input().split()))
print(sum(sorted(l[:-1])))

Submission status: Wrong Answer

Solution code:
a = list(sorted(input().split()))
print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

Solution code:
import sys
import math
import bisect

def main():
    A = input().split()
    B = []
    for i in range(len(A)):
        for j in range(i + 1, len(A)):
            B.append(A[i] + A[j])
    print(min(B))
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
array = sorted(input().split())
print(array[0]+array[1])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
n=[a+b,a+c,b+c]
n.sort()
print(n[-1])

Submission status: Wrong Answer

Solution code:
L = input().split()
l = [int(L[i]) for i in range(len(L))]
l.sort
print(l[0]+l[1])

Submission status: Wrong Answer

Solution code:
x = sorted(input().split())
print(int(x[0])+int(x[1]))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
L=[a,b,c]
L.sort()
print(L[1]+L[2])

Submission status: Wrong Answer

Solution code:
a,b,c=[int(1) for i in input().split()]
list=[a,b,c]
list.sort()
print(list[0]+list[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(str, input().split()))
sorted(a)
print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

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

x = max(a,b,c)
if a == x:
  print(b+c)
elif b == x:
  print(a+c)
else:
  print(a+c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
list=sorted((input().split()))
print(int(list[0])+int(list[1]))

Submission status: Wrong Answer

Solution code:
abc = list(map(int,input().split()))
abc.sort()
print(sum(abc[:1]))

Submission status: Wrong Answer

Solution code:
s=list(map(int,input().split()))
print(sum(sorted(s)[::2]))

Submission status: Wrong Answer

Solution code:
a_L = list(map(int,input().split()))
a_L = sorted(a_L)
print(sum(a_L[0:1]))

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
a.sort()
print(sum(a)-min(a))

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
print(sum(a)-min(a))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,raw_input().split())
if a+b<a+c<b+c:
  print a+b
elif b+c<a+b<a+c:
  print b+c
else:
  print a+c

Submission status: Wrong Answer

Solution code:
l = list(map(int,input().split()))
print(sum(l)-2*max(l))

Submission status: Wrong Answer

Solution code:
def miner(a):
    
    a.sort
    ans = int(a[0]) + int(a[1])
    return ans

def main():
    a = list(map(int , input().split()))
    print(miner(a))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def miner(a):
    
    a.sort
    ans = int(a[-1]) + int(a[-2])
    return ans

def main():
    a = list(map(int , input().split()))
    print(miner(a))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

min = a + b

if min > (a + c):
    min = a + c
elif min > (b + c):
    min = b + c
else:
    min = a + b

print(min)

Submission status: Wrong Answer

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

min = a + b

if min > (a + c):
    min = a + c
elif min > (b + c):
    min = b + c

print(min)

Submission status: Wrong Answer

Solution code:
a=list(input().split())
a.sort()
print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

Solution code:
num = input().split()
num_i = [int(s) for s in num]

a,b,c = num_i
min_a = a+b

if(min_a > b+c):
    min_a = b+c
    if(min_a > c+a):
        min_a = c+a
print(min_a)

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
print(A[0] + A[1])

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a+b < a+c and c+b:
    print(a+b)
elif a+c < a+b and c+b:
    print(a+c)
else:
    print(b+c)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a+b < a+c and c+b:
    print(a+b)
elif a*c < a+b and c+b:
    print(a+c)
else:
    print(b+c)

Submission status: Wrong Answer

Solution code:
al = list(map(int,input().split()))
print(sum(al[:2]))

Submission status: Wrong Answer

Solution code:
import sys

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

m = max([a,b,c])

print(a + b + c - 2 * m)

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
res = sum(A) - min(A)
print(res)

Submission status: Wrong Answer

Solution code:
s=input().split()

s.sort()

print(int(s[0])+int(s[1]))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if a <= c and c <= b :
  print (int(a+b))
else:
  print(int(a*b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a_b = a+b
a_c = a+c
b_c = b+c

print(max(a_b,a_c,b_c))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
s = [a, b, c]
m = min(s)
s.remove(m)
print(sum(s))

Submission status: Wrong Answer

Solution code:
abc = list(map(int, input().split()))
abc.sort()
print(abc[-1]+abc[-2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
price = input().split(" ")
price = sorted(price)
print(int(price[0]) + int(price[1]))

Submission status: Wrong Answer

Solution code:
price = input().split(" ")
price = sorted(price)
print(price[0] + price[1])

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
print(sum(sorted([a, b, c])[:1]))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
ab = a + b
bc = b + c
ac = a + c
if ab > ac and ab > bc:
  print(ab)
elif bc > ab and bc > ac:
  print(bc)
else:
  print(ac)

Submission status: Wrong Answer

Solution code:
import numpy as np
bell_li = list(map(int, input().split()))
bell_np = np.array(bell_li)
bell_np_sorted = bell_np.argsort()[::-1]
print(bell_np_sorted[0] + bell_np_sorted[1])

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
print(a)
a.sort()
print(a[0]+a[1])

Submission status: Wrong Answer

Solution code:
s=list(input().split())
s.sort()
a=int(s[0])
b=int(s[1])
c=int(s[2])

print(a+b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a + b + c - min(a, b, c))

Submission status: Wrong Answer

Solution code:
print(sum(sorted(list(map(int, input().split())))[::-1][0:2]))

Submission status: Wrong Answer

Solution code:
List = list(map(int,input().split()))
List.sort()
print(List)
print(List[0]+List[1])

Submission status: Wrong Answer

Solution code:
List = list(map(int,input().split()))
List.sort
print(List[0]+List[1])

Submission status: Wrong Answer

Solution code:
lst = sorted(list(map(int, input().split())))
print(sum(lst[::2]))

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
a.sort()
print(a)
print(a[0]+a[1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(sum(sorted(list(map(int, input().split()))[:2])))

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
a.sort
print(a[0] + a[1])

Submission status: Wrong Answer

Solution code:
s = list(input())
for i in range(len(s)):
  s.pop()
  if s[:(len(s) // 2)] == s[len(s) // 2:]:
    print(len(s))
    break

Submission status: Wrong Answer

Solution code:
s = list(input())
for i in range(len(s)):
  s.pop()
  if s[:len(s) // 2 - 1] == s[len(s) // 2:]:
    print(len(s))
    break

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
a.sort
print(a[0]+a[1])

Submission status: Wrong Answer

Solution code:
a=sorted(list(map(int,input().split())), reverse=True)
print(sum(a[:2]))

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
print(sum(a)-min(a))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, raw_input().split())
print str(min([a + b, b + a, c + a]))

Submission status: Wrong Answer

Solution code:
def resolve():
    ls = []

    for s in map(int, input().split(' ')):
        ls.append(s)

    print(ls[0] + ls[1])
    pass


if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
s = input()
s_list = []

for i in s:
    s_list.append(i)
del s_list[-1]

while True:
    s_half = int(len(s_list)/2)
    s1 = s_list[:s_half]
    s2 = s_list[s_half:]
    if s1 == s2:
        print(s_half*2)
        break
    else:
        del s_list[-1]

Submission status: Wrong Answer

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

bell=sorted(bell,reverse=True)

print(bell)

print(bell[1]+bell[2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
min = a+b
if min > a+c:
    min = a+c
elif min > c+b:
    min = c+b
print(min)

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
min = a+b
if min >= a+c:
    min = a+c
elif min >= b+c:
    min = b+c
print(min)

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
min = a+b
if min > a+c:
    min = a+c
elif min > b+c:
    min = b+c
print(min)

Submission status: Wrong Answer

Solution code:
argv=input().split()

a=int(argv[0])
b=int(argv[1])
c=int(argv[2])

r=a+b

if  a+c < r:
    r= a+b

if  b + c < r:
    r= b+c

print(r)

Submission status: Wrong Answer

Solution code:
argv=input().split()

a=int(argv[0])
b=int(argv[1])
c=int(argv[2])

r=0

if a+b < a+c:
    r= a+b

if  b + c < r:
    r= b+c

print(r)

Submission status: Wrong Answer

Solution code:
print(sum(sorted(list(map(int,input().split())), reverse = True)[:2]))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split());print(max(a+b,b+c,a+c))

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)//2
for i in range(1,n):
    if s[:n-i] == s[n-i:2*(n-i)]:
        print(2*(n-i))
        break

Submission status: Wrong Answer

Solution code:
lines = list(input().split())
print(lines)
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum_list = [a+b, a+c, b+c]
print(min(sum_list))

Submission status: Wrong Answer

Solution code:
lines = list(input().split())
print(lines)
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum_list = [a+b, a+c, b+c]
print(max(sum_list))

Submission status: Wrong Answer

Solution code:
lines = input().split()
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum1 = a+b
sum2 = a+c
sum3 = b+c
sum_list = [sum1, sum2,sum3]
print(max(sum_list))

Submission status: Wrong Answer

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

ring.sort
print(ring[0] + ring[1])

Submission status: Wrong Answer

Solution code:
cost = list(map(int, input().split()))
cost.sort()
print(cost)
print(cost[0]+cost[1])

Submission status: Wrong Answer

Solution code:
cost = list(map(int, input().split()))
cost.sort
print(cost[0]+cost[1])

Submission status: Wrong Answer

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

if a+b <= a+c:
	if a+b  <= b+c:
		print(a+b)
	else:
		print(b+c)
else:
	print(a+c)

Submission status: Wrong Answer

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

if a+b < a+c:
	if a+b  < b+c:
		print(a+b)
	else:
		print(b+c)
else:
	print(a+c)

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
while True:
  s = s[:-2]
  n -= 2
  if s[:n//2] == s[n//2:]:
    print(n)
    break

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
l=[a,b,c]
sorted(l)
print(l[0]+l[1])

Submission status: Wrong Answer

Solution code:
a,b,c=input().split()
list=[a,b,c]
sorted(list)
print(int(list[0])+int(list[1]))

Submission status: Wrong Answer

Solution code:
#66a
a=[]
a.append(input().split())
print(a)
a.sort()
print(int(a[0][1])-int(a[0][0]))

Submission status: Wrong Answer

Solution code:
x,y,z=map(int,input().split())
if (x+y) <= (x+z)  and (x+y)<= (y+z):
  print(x+y)
if (x+z) <= (x+y) and (x+z) <= (y+z):
  print(x+z)
if (y+z) <= (x+y) and (y+z) <= (x+z):
  print(y+z)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
if a+b  <  c+b or b+c <c+b:
  print(c+b)
elif c+b  <  a+b or b+c <a+b:
  print(a+b)
else:
  print(a+c)

Submission status: Wrong Answer

Solution code:
str=input()
nedan=str.split()
max=0
sum=0

for i in nedan:
    if int(i)>max:
        max=int(i)

for i in nedan:
    if int(i)!=max:
        sum+=int(i)

print(sum)

Submission status: Wrong Answer

Solution code:
str=input()
nedan=str.split()
max=0
sum=0

for i in range(len(nedan)):
    if int(nedan[i])>max:
        max=i

for i in range(len(nedan)):
    if i!=max:
        sum+=int(nedan[i])

print(sum)

Submission status: Wrong Answer

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

s = a + b
t = a + c
u = b + c

if s >= t and s >= u:
    print(s)
elif t >= s and t >= u:
    print(t)
else:
    print(u)

Submission status: Wrong Answer

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

s = a + b
t = a + c
u = b + c

if s > t and s > u:
    print(s)
elif t > s and t > u:
    print(t)
else:
    print(u)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
p = []
p.append(a+b)
p.append(b+c)
p.append(c+a)
p.sort()
print(p[0] + p[1])

Submission status: Wrong Answer

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
c = int(arr_data[0][2])


if a<=b or b<=c:
    
    print(a+b)
    
elif b<=c or c<=a:

    print(b+c)
    
elif c<=a or a<=b:


    print(c+a)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
A=[a,b,c]
if a<=max(A) and b<=max(A):
    print(a+b)
elif b<=max(A) and c<=max(A):
    print(b+c)
elif c<=max(A) and a<=max(A):
    print(a+c)

Submission status: Wrong Answer

Solution code:
a=input().split();a.sort(key=int);print(a);print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

Solution code:
a=input().split();a.sort();print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

Solution code:
a=input().split();a.sort;print(int(a[0])+int(a[1]))

Submission status: Wrong Answer

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

data = input()
A = data.split(" ")
A.sort()
print(int(A[0])+int(A[1]))

Submission status: Wrong Answer

Solution code:
inp = list(input().split())
inp.sort()
print(int(inp[0]) + int(inp[1]))

Submission status: Wrong Answer

Solution code:
x = input()
flag = True

for i in range(len(x),0,-1):
    if (i % 2 == 0):
        #print(i, x[0:int(i/2-1)], x[int(i/2 - 1):i-2])
        if (x[0:int(i/2-1)] == x[int(i/2 - 1):i-2] and flag):
            print(i)
            flag = False
        else:
            pass
    else:
        pass

Submission status: Wrong Answer

Solution code:
import sys
inp = [x.strip() for x in sys.stdin]
for s in inp:
	lens = len(s)
	for i in reversed(range(lens)):
		news = s[:i]
		lennews = len(news)
		if lennews % 2 == 0 and news[:lennews/2] == news[lennews/2:]:
			print lennews
			break

Submission status: Wrong Answer

Solution code:
def read_int_list():
    return list(map(int, input().split()))

n = read_int_list()
sorted(n)
print(n[0]+n[1])

Submission status: Wrong Answer

Solution code:
def read_int_list():
    return (int(i) for i in input().split())

a,b,c = read_int_list()
print(min(a,b) + min(a,c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
print(a[0]+a[1])

Submission status: Wrong Answer

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

m =10**5
for i in range(2):
    m = min(m,abc[i]+abc[i+1])
print(m)

Submission status: Wrong Answer

Solution code:
s = input()
s= s[:-2]
 
while(True):
    s1, s2 = s[0:len(s)//2], s[len(s)//2:len(s)+1]
    if s1 == s2:
        print(len(s1)*2)
        break
 
    s = s[:-2]

Submission status: Wrong Answer

Solution code:
s = input()
s= s[:-2]
 
while(True):
    s1, s2 = s[0:len(s)//2], s[len(s)//2:len(s)]
    if s1 == s2:
        print(len(s1)*2)
        break
 
    s = s[:-2]

Submission status: Wrong Answer

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

min = min(number)

number.remove(min)

print(number[0] + number[1])

Submission status: Wrong Answer

Solution code:
price = input().split(" ")
price = sorted(price)
total = int(price[0])+int(price[1])
print(total)

Submission status: Wrong Answer

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

if (a+b) <= (a+c):
    print(a+b)
elif (a+c) <= (b+c):
    print(a+c)
elif (a+c) <= (b+c):
    print(a+c)
else:
    print(b+c)

Submission status: Wrong Answer

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

if (a+b) <= (b+c):
    print(a+b)
elif (b+c) <= (a+c):
    print(b+c)

Submission status: Wrong Answer

Solution code:
s = input()

s = s[:-1]
if len(s) % 2 != 0:
    s = s[:-1]


while(True):
    s1, s2 = s[0:len(s)//2], s[len(s)//2:len(s)]
    print(s1, s2)
    if s1 == s2:
        print(len(s1))
        break

    s = s[:-2]

Submission status: Wrong Answer

Solution code:
import numpy as np

a,b,c = map(int,input().split())
np.sum(np.sort([a,b,c])[0:2])

Submission status: Wrong Answer

Solution code:
a = input().split()
b = sorted(a)

print(int(b[0])+int(b[1]))

Submission status: Wrong Answer

Solution code:
S = list(input())
while(True):
    if(S == S[::-1]):
        print(int(len(S)))
        break
    del S[-1]

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
list = []
list.append(a)
list.append(b)
list.append(c)
print(list)
list.sort()
print(list[0]+list[1])

Submission status: Wrong Answer

Solution code:
a = input()
ind = len(a)
while True:
    a = a[0:ind-1]
    b = a[0:ind//2]
    c = b+b
    if a==c:
        print(len(c))
        break
    ind = len(a)

Submission status: Wrong Answer

Solution code:
a = [int(x) for x in input().split()]
s = 0
if a[0] <= a[1]:
    s = a[0]
    if a[1] <= a[2]:
        s += a[1]
    else:
        s += a[2]
else:
    s = a[1]
    if a[0] <= a[2]:
        s += a[0]
    else:
        s += a[1]
print(s)

Submission status: Wrong Answer

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

ans = a+b+c - min(a,b,c)
print(ans)

Submission status: Wrong Answer

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

#sys.stdin.readline().split()

min1 = a + b
min2 = b + c
min3 = a + c


if min1 <= min2:
    if min1 <= min3:
        print(min1)

elif min2 <= min1:
    if min2 <= min3:
        print(min2)

elif min3 <= min1:
    if min3 <= min2:
        print(min3)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split(" "))
price = [a, b, c]
price.sort
print(price[0]+price[1])

Submission status: Wrong Answer

Solution code:
print sum(map(int, raw_input().split())[:2])

Submission status: Wrong Answer

Solution code:
lis=input().split()
lis.sort()
print(int(lis[0])+int(lis[1]))

Submission status: Wrong Answer

Solution code:
def find_pair(nums):
    sorted(nums)
    return nums[0] + nums[1]

if __name__ == "__main__":
    #run_test(find_pair, test_pair)
    nums = tuple([int(text) for text in raw_input().split()])
    print(find_pair(nums))

Submission status: Wrong Answer

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

#お店にあるベルは 3 種類で、それぞれ a円、 b円、 c円です。
#この 3 つのうち、異なる 2 つのベルを選んで買うときの、値段の合計の最小値を求めて下さい。

#x = input().split()
x = [700, 600, 780]

y =[int(x[0]), int(x[1]), int(x[2])]

z = sorted(y)

ans = z[0] + z[1]

print(ans)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
d=[a,b,c]
sum = 0

for i in range(2):
    sum += d.pop()
print(sum)

Submission status: Wrong Answer

Solution code:
S=input()
s=S[0:-1]

for i in range(len(s)-1,-1,-1):
    if s[0:i]==s[i:(2*i)]:
        print(2*i)
        break

Submission status: Wrong Answer

Solution code:
#s = list(input())
s = input()
n = len(s)
count = 0   #消した数

if n % 2 == 1:
    count += 1

while s[0 : int((n-count)/2)] != s[int((n-count)/2) : n-count]:
    count += 2

print(n-count)

Submission status: Wrong Answer

Solution code:
import sys

inputStr = sys.argv

if len(inputStr)!=4:
	print 'value number is wrong. input 3 numbers.'
else:

	a =  int(inputStr[1])
	b = int(inputStr[2])
	c = int(inputStr[3])

	if((a>=1)and(a<=10000)and(b>=1)and(b<=10000)and(c>=1)and(c<=10000)):
		val = [ a+b, a+c, b+c]
		print max(val)

	else:
		print 'value is wrong.'

Submission status: Wrong Answer

Solution code:
s = input()
s = s[:len(s) - 1]
if len(s) % 2 != 0:
	s = s[:len(s) - 1]

while True:
	mid = int(len(s) / 2)
	if s[:mid] == s[mid:]:
		print(len(s))
		break
	else:
		s = s[:len(s) - 1]

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python

ss = raw_input()

while(True):
  ss = ss[:-1]
  leng = len(ss)
  former = ss[:leng/2]
  later  = ss[leng/2:]

  if former == later:
    leng = len(former) + len(later)
    break

print(leng)

Submission status: Wrong Answer

Solution code:
abc = input().split(' ')

abc =[ int(x) for x in abc]
s=  0
min_ = min(abc) 
if abc[0] == abc[1] == abc[2] :
    print(abc[0] + abc[1])
elif (abc[0] == min_ and abc[1]  == min_ or abc[0] == min_ and abc[2]  == min_ or 
                                    abc[2] == min_ and abc[1]  == min_):
    for i in abc:
        if i != min_:
            s += i
            print(s + min_)
    

else:    
    for i in abc:
        if i != min(abc):
            s += i
    print(s)

Submission status: Wrong Answer

Solution code:
a = input().split()

b = sorted(a)

c = int(b[0])+int(b[1])

print(c)

Submission status: Wrong Answer

Solution code:
price_list = input().split()

price_list.remove(max(price_list))

print(int(price_list[0]) + int(price_list[1]))

Submission status: Wrong Answer

Solution code:
A = input().split()

a = int(A[0])
b = int(A[1])
c = int(A[2])

minsum=a+b

if a+c < minsum:
    minsum = a+c
elif b+c < minsum:
    minsum = b+c

print(minsum)

Submission status: Wrong Answer

Solution code:
import sys
a=0
b=0
c=0
x=3


v,y,z =[int(x) for x in input().split(" ")]

a = v+y
b = y+z
c = z+v

if a<b and a<c:
	print (a)

if b<c and b<a:
	print (b)

if c<b and c<a:
	print (c)

Submission status: Wrong Answer

Solution code:
import sys
a=0
b=0
c=0
x=3


x,y,z =[int(x) for x in input().split(" ")]

a = x+y
b = y+z
c = z+y

if a<b and a<c:
	print (a)

if b<c and b<a:
	print (b)

if c<b and c<a:
	print (c)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
li = [a,b,c]
print(li[0] + li[1])

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
sorted(a)
print(a[0] + a[1])

Submission status: Accepted

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

sum = a + b + c
max = max([a, b ,c])

answer = sum - max
print(answer)

Submission status: Accepted

Solution code:
cost = list(map(int, input().split()))
print(sum(sorted(cost)[:2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
bell=[a, b, c]=list(map(int, input().split(" ")))
candidate=sorted(bell)
print(candidate[0]+candidate[1])

Submission status: Accepted

Solution code:
bell=[a, b, c]=list(map(int, input().split(" ")))

print(sorted(bell).pop(0)\
      +sorted(bell).pop(1))

Submission status: Accepted

Solution code:
# snuke 君は自転車を買いに来ました。 snuke 君はすでに買う自転車を決めたのですが、その自転車にはベルが付いていないため、
# 自転車とは別にベルも買う必要があります。 snuke 君は安全意識が高いので、ベルをどちらの手でも鳴らせるよう、両方のハンドルに 1 つずつ 付けることにしました。
# お店にあるベルは 3 種類で、それぞれ a 円、 b 円、 c 円です。 この 3 つのうち、異なる 2 つのベルを選んで買うときの、値段の合計の最小値を求めて下さい。

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

if a >= b and a >= c :
    print(b + c)
elif b >= a and b >= c:
    print(a + c)
elif c >= a and c >= b:
    print(a + b)

Submission status: Accepted

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

print(min(a+b,a+c,b+c))

Submission status: Accepted

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

print(a[0]+a[1])

Submission status: Accepted

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

Submission status: Accepted

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

prices = [a + b, a + c, b + c]

print(min(prices))

Submission status: Accepted

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

print(min(a+b,a+c,b+c))

Submission status: Accepted

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

bell_price = [a, b, c]

print(sum(bell_price) - max(bell_price))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(min(a+b,b+c,a+c))

Submission status: Accepted

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

a.sort()

print(a[0]+a[1])

Submission status: Accepted

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

print(a+b+c-max(a,b,c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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



print(min(a+b, b+c, a+c))

Submission status: Accepted

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

print(sum([a, b, c]) - max(a, b, c))

Submission status: Accepted

Solution code:
lst = input().split()

for i in range(3):
   lst[i] = int(lst[i])

lst.sort()
print(lst[0] + lst[1])

Submission status: Accepted

Solution code:
# A - ringring
def main():
    abc = list(map(int, input().split()))
    abc.sort()
    cnt = 0

    for _ in range(2):
        cnt += abc.pop(0)
    else:
        print(cnt)


if __name__ ==  "__main__":
    main()

Submission status: Accepted

Solution code:
D=list(map(int,input().split()))
D.sort()
print(D[0]+D[1])

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a.sort()
print(a[0] + a[1])

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
A = sorted(A)
print(A[0] + A[1])

Submission status: Accepted

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

ring=[]
ring.append(a)
ring.append(b)
ring.append(c)

ring.sort()
print(ring[0] + ring[1])