Problem:


Score : 100 points

Problem Statement

Two students of AtCoder Kindergarten are fighting over candy packs.

There are three candy packs, each of which contains a, b, and c candies, respectively.

Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.

Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Constraints

1 ≦ a, b, c ≦ 100

Input

The input is given from Standard Input in the following format:

a b c

Output

If it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.

Sample Input 1

10 30 20

Sample Output 1

Yes

Give the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.

Sample Input 2

30 30 100

Sample Output 2

No

In this case, the student who gets the pack with 100 candies always has more candies than the other.

Note that every pack must be given to one of them.

Sample Input 3

56 25 31

Sample Output 3

Yes



Sample input:
10 30 20


Sample output:
Yes

Submission status: Accepted

Solution code:
candies = list(map(int, input().split()))
candies.sort()
if candies[2] == candies[0] + candies[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

print("Yes" if max(a) == sum(a) - max(a) else "No")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
s = sum(l)
for i in range(3):
    if l[i] == s-l[i]:
        print('Yes')
        exit()
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem A - キャンディーと2人の子供

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

# initialization
is_ok = False

# check
if a+b==c:
    is_ok = True
elif a+c==b:
    is_ok = True
elif b+c==a:
    is_ok = True

# output
if is_ok:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# デバッグ用
GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)

#本体ここから

#S = input()
#N = int(input())
#S, T = input().split()
a, b, c = map(int, input().split())
#W = [input() for _ in range(N)]
#A = list(map(int, input().split()))

#GBN_DEBUG = True

if (a + b == c) or (b + c == a) or (c + a == b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
*a,=map(int, input().split())
a.sort()
if a[0]+a[1]==a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if a == b+c or b == a+c or c == a+b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
u = [a,b,c]
u.sort()
if u[0] + u[1] == u[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

tmp = [a, b, c]
tmp.sort()
if tmp[0] + tmp[1] == tmp[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
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
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

a = LIST()
a.sort()
if a[0] + a[1] == a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if a+b == c or a+c == b or b+c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a+b == c or a+c == b or b+c == a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(map(int, input().split()))
S = sorted(S)
print("Yes" if S[0]+S[1] == S[2] else "No")

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
sum = a+b+c
flag = False
if sum/2 == a + b:
  flag = True
if sum/2 == b + c:
  flag = True
if sum/2 == c + a:
  flag = True

if flag == True:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
candies = [a, b, c]
candies.sort()

if candies[0] + candies[1] == candies[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき


if a+b==c or b+c==a or c+a==b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a=sorted(list(map(int,input().split())))
if a[0]+a[1]==a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

ok = False
for i in range(len(a)):
    if a[i] == sum(a) - a[i]:
        ok = True
if ok:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a + b == c or a == b + c or a + c == b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=sorted(map(int,input().split()))
if a+b==c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if a+b == c or b+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if (a+b+c)-max(a,b,c)==max(a,b,c):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if a == b + c:
  print ("Yes")
elif b == a + c:
  print ("Yes")
elif c == a + b:
  print ("Yes")
else:
  print ("No")

Submission status: Accepted

Solution code:
nums = sorted(list(map(int, input().split())))
result = 'Yes' if (nums[0] + nums[1] == nums[2]) else 'No'
print(result)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a+b==c or a+c==b or b+c==a:
  print('Yes')
  exit()
print('No')

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
    a,b,c=MI()
    if a+b+c==2*max(a,b,c):
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

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

if in_list[0] == in_list[1] + in_list[2] or in_list[1] == in_list[2] + in_list[0] or in_list[2] == in_list[1] + in_list[0]:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

Solution code:
c = map(int, input().split())
c = sorted(c)
ans = 'Yes' if c[0] + c[1] == c[2] else 'No'
print(ans)

Submission status: Accepted

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

A.sort()

if A[0] + A[1] == A[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#ABC047.A
a,b,c = map(int,input().split())
if a + b ==c or a +c==b or b+c ==a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if sum(a) == max(a) * 2:
    print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
a = sorted([int(x) for x  in input().split()])
print('Yes' if a[0] + a[1] == a[2] else 'No')

Submission status: Accepted

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

ans = 'No'

mi = lst.index(max(lst))
mx = lst.pop(mi)

if mx == sum(lst):
    ans = 'Yes'
    
print(ans)

Submission status: Accepted

Solution code:
#ABC047 A
a,b,c=map(int,input().split())
if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a =  list(map(int, input().split()))
if sum(a)-max(a) == max(a):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#abc047 a 
p=list(map(int,input().split()))
if max(p)==(sum(p)-max(p)):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
candy_list = [int(i) for i in input().split()]

max_candy = candy_list.pop(candy_list.index(max(candy_list)))

if max_candy == sum(candy_list):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

As = sorted(A)
if As[2] == As[1]+As[0]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
p = max(l)
s = min(l)
wa =sum(l)
m = wa - p - s
if m + s == p:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
if sum(A)/2 in A:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
List=sorted(map(int,input().split()))[::-1]
print("Yes" if List[0]==List[1]+List[2] else "No")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline

lst1 = list(map(int,readline().split()))

for i in range(3):
    if lst1[i] == sum(lst1)-lst1[i]:
        print("Yes")
        exit()
print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

l = list(map(int,input().split()))

l.sort()

if l[2] == l[0] + l[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l= sorted(list(map(int,input().split())))
if l[0] + l[1] == l[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
x=list(map(int, input().split()))
x.sort()
if x[0]+x[1]==x[2]:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
# A - キャンディーと2人の子供
a,b,c=list(map(int,input().split()))

m=max([a,b,c])
r=sum([a,b,c])-m
if m==r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
packs = sorted(list(map(int, input().split())))
if packs[2] - packs[1] == packs[0]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
ans = False
if a == b + c or b == a + c or c == a + b:
    ans = True
if ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

print('Yes' if a[0] == a[1]+a[2] else 'No')

Submission status: Accepted

Solution code:
List = sorted(list(map(int,input().split())))
print('Yes' if List[0] + List[1] == List[2] else 'No')

Submission status: Accepted

Solution code:
a=[int(i) for i in input().split()]
res=False
for i in range(3):
    if a[i]*2==sum(a):res=True
print("Yes"if res else"No")

Submission status: Accepted

Solution code:
A = sorted(list(map(int,input().split())))
print('Yes' if A[2]==A[1]+A[0] else 'No')

Submission status: Accepted

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

if A+B == C or A+C ==B or B+C == A:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if (a+b == c)| (a+c == b)| (c+b == a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

nums.sort()
print( "Yes" if nums[2]==nums[0]+nums[1] else "No" )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l = sorted(l)
if l[0] + l[1] == l[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
l = [a, b, c]
l.sort()
if l[0] + l[1] == l[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if a+b==c or a+c==b or b+c==a:
    print("Yes")
else: 
    print("No")

Submission status: Accepted

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

big = max(a,b,c)
total = a + b + c
if total == big*2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def check(a, b, c):
    if a + b == c:
        return 'Yes'

    if a + c == b:
        return 'Yes'

    if b + c == a:
        return 'Yes'

    return 'No'

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

Submission status: Accepted

Solution code:
input1 = list(map(int,input().split()))
a = input1[0]
b = input1[1]
c = input1[2]
if a + b == c or a + c == b or b + c == a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c=sorted(map(int,input().split()))
print('Yes' if a+b==c else 'No')

Submission status: Accepted

Solution code:
#047_A
s=sorted(list(map(int,input().split())))
print('Yes' if s[0]+s[1]==s[2] else 'No')

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a.sort()
if a[0] + a[1] == a[2]:
    print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
# A
l = list(map(int, input().split()))
l.sort()
if l[0]+l[1] == l[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
L=list(map(int,input().split()))
L.sort()
if L[0]+L[1]==L[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

    if a + b == c or b + c == a or c + a == b:
        print("Yes")
    else:
        print("No")


main()

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
if max(x) == sum(x) - max(x):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))
x.sort()
if x[0]+x[1]==x[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x=sorted(map(int,input().split()))
print("Yes" if x[0]+x[1]==x[2] else "No")

Submission status: Accepted

Solution code:
def main():
    candies = list(map(int, input().split()))
    print("Yes" if candies[0] + candies[1] == candies[2] or candies[1] + candies[2] == candies[0] or
                   candies[0] + candies[2] == candies[1] else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L=list(map(int,input().split()))
S=sorted(L)
if S[0]+S[1]==S[2] or S[0]==S[1]+S[2]:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
print("Yes" if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1] else "No")

Submission status: Accepted

Solution code:
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))
MOD = 10 ** 9 + 7


a, b, c = MI()
if a + b == c or b + c == a or c + a == b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

print("Yes" if a+b==c else "No")

Submission status: Accepted

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

if sum(total_list[:2]) == total_list[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
# スペース区切りの整数の入力
a, b, c = map(int, input().split())

if a == (b+c):
  print('Yes')
elif (a+b) == c:
  print('Yes')
elif (a+c) == b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
if a[0]+a[1] == a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
n = (a+b+c)/2
if n == max(a, b, c):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
 
 
def main():

    # mapは引数1の関数を引数2へ当てはめる 
    num_candy = list(map(int,input().split(' ')))
    max_candy = max(num_candy)
 
    if sum(num_candy) / 2 == max_candy:
        print("Yes")
    else:
      print("No")
 
    return 0
 
 
if __name__ == '__main__':
    main()

Submission status: Accepted

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

b = max(a)

if sum(a) / 2 == b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#A - キャンディーと2人の子供

num = list(map(int,input().split()))

if max(num) == sum(num)/2 :
  print('Yes')
else :
  print('No')

Submission status: Accepted

Solution code:
S,M,L=sorted(list(map(int,input().split())))
print('Yes' if S+M==L else "No")

Submission status: Accepted

Solution code:
import copy
a = list(map(int,input().split()))
nokori  = copy.copy(a)
count = max(a)
nokori.remove(count)
"""
if a[0] == a[1] == a[2]:
    print("No")
"""
if int(nokori[0] + nokori[1]) == count:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
A.sort()
if A[2] == A[1] + A[0]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

print('YNeos'[A[0] + A[1] != A[2]::2])

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if a[0]+a[1]==a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a == (b + c) or (a + b) == c or (a + c) == b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
list = input().split()
list = [int(n) for n in list]
list.sort(reverse=True)

if list[0] == list[1] + list[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if a + b == c or a + c == b or b + c == a:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
x = sorted(list(map(int, input().split())))
if sum(x[:2]) == x[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a= list(map(int, input().split()))
a.sort()
if a[0] + a[1] == a[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if max(a)*2==sum(a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a+b == c or b+c == a or c+a == b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(a: int, b: int, c: int):
    abc = sorted([a, b, c])
    if abc[0]+abc[1] == abc[2] or abc[0] == abc[1]+abc[2]:
        yes()
    else:
        no()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

sm = sum([a, b, c])

if sm/2 in set([a, b, c]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
flag=False
if (a+b)==c:
    flag=True
if (a+c)==b:
    flag=True
if (b+c)==a:
    flag=True
if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#ABC047 A

s = sorted(list(map(int,input().split())))
if s[0] + s[1] == s[2] or s[0] == s[1] + s[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
print("Yes" if a+b==c else "No")

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
abc.sort()
print('Yes' if abc[-1] == abc[0] + abc[1] else 'No')

Submission status: Accepted

Solution code:
a,b,c=sorted(map(int,input().split()))
print("Yes" if a+b==c else "No")

Submission status: Accepted

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

if a+b == c or b+c == a or a+c == b:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

if a + b == c or a + c == b or b + c == a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
print('YNeos'[sum(l)!=max(l)*2::2])

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
f = False
if a == b + c:
    f = True
elif b == a + c:
    f = True
elif c == a + b:
    f = True

if f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()
if (l[0]+l[1]==l[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
lis = list(map(int, input().split()))
lis.sort(reverse=True)
if lis[0]==lis[1]+lis[2]: print('Yes')
else: print('No')

Submission status: Accepted

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

if a == b + c or b == a + c or c == a + b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('Yes')if a+b+c == max(a,b,c)*2 else print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
m = [a, b, c]
maxvalue = 0
for i in range(len(m)):
    if m[i] > maxvalue:
        maxvalue = m[i]
if a + b + c - maxvalue == maxvalue:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list=list(map(int, input().split()))
list.sort()
if list[0]+list[1] == list[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(["No","Yes"][sum(a)==2*max(a)])

Submission status: Accepted

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

# キャンディーを同じ個数に分けられるなら Yes を、そうでなければ No を出力せよ。
list = [a, b, c]
list.sort()
if list[0] + list[1] == list[2] :
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
l = [a,b,c]
l.sort()
if l[0] + l[1] == l[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 047
# A - キャンディーと2人の子供
a, b, c = map(int, input().split())
if a+b == c:
    print('Yes')
elif b+c == a:
    print('Yes')
elif c+a == b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
print('Yes') if l[0]+l[1] == l[2] else print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
Z=(a+b+c)/2
if Z==a or Z==b or Z==c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if (a[2] == a[0]+a[1]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a+b==c or a+c==b or b+c==a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if a[2]==a[0]+a[1]:print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if (A+B)==C or (A+C)==B or (B+C)==A:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def share_candies(a_candybag, b_candybag, c_candybag):

    sum_of_candy_list = [a_candybag, b_candybag, c_candybag]
    most_candies = sorted(sum_of_candy_list, reverse=True)[0]
    sum_of_candies = a_candybag + b_candybag + c_candybag
    if most_candies == sum_of_candies - most_candies:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(share_candies(a, b, c))

Submission status: Accepted

Solution code:

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

a.sort(reverse = True)

if a[0] == a[1]+a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
if l[0] + l[1] == l[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print("YNeos"[not(a+b+c==max(a,b,c)*2)::2])

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 2, Feb, 2020
"""

import sys
import itertools

import numpy as np

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

A= list(map(int, readline().split()))

print('Yes' if max(A) == sum(A)-max(A) else 'No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
list = [a, b, c]
list.sort()
if list[0] + list[1] == list[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a,b,c = [int(i) for i in input().split()]
if a + b == c or a + c == b or b + c == a :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
sl = sorted(n)
print("Yes" if sl[0]+sl[1]==sl[2] else "No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a.sort()
if a[2] == a[0] + a[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


def main():
    A, B, C = list(map(int, input().split()))
    print('Yes'if max([A, B, C]) == (
        sum([A, B, C]) - max([A, B, C])) else 'No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if a + b == c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

all_ = a + b + c

if a == all_ - a or b == all_ - b or c == all_ - c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if a+b == c or a + c == b or b+c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

max_candy = max(candies)

candies.remove(max_candy)

if sum(candies) == max_candy:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if a + b == c or b + c == a or a + c == b :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

if max(a, b, c) == a + b + c - max(a, b, c):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if a == b+c or b == a+c or c == a+b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S=sorted(list(map(int,input().split())))
print("Yes" if sum(S[:2])==S[2] else "No")

Submission status: Accepted

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

max_candy = max(a, b, c)
else_candy = a + b + c - max_candy

if max_candy == else_candy:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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