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:
lst = list(map(int, input().split()))
lst.sort()

if lst[0] + lst[1] == lst[2]:
    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:
*i,=map(int, input().split())
print('Yes' if max(i)*2==sum(i) else '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())
print("Yes" if a + b == c or a + c == b or b + c == a else "No")

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    C = [int(i) for i in input().split()]
    C.sort()
    if C[0] + C[1] == C[2]: print("Yes")
    else: print("No")

    return 0

if __name__ == "__main__":
    solve()

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())
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 2*max([a,b,c]) == sum([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==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())
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()))
a.sort()
if a[0]+a[1]==a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
candy = list(map(int, input().split()))
if max(candy) == sum(candy)-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 a+c==b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
import os
import math
import string
import collections

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    abc = il()
    abc = sorted(abc)
    print('Yes' if abc[2] == (abc[0]+abc[1]) else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
candys = [int(x) for x in input().split()]

output = 'No'
if(max(candys) == sum(candys)/2):
    output = 'Yes'
    
print(output)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
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 = list(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 = 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:
Cnd = list(map(int,input().split()))
Cnd = sorted(Cnd)
result = 'No'
if Cnd[0]==Cnd[1]+Cnd[2]:
	result ='Yes'
if Cnd[0]+Cnd[1]==Cnd[2]:
	result ='Yes'
print(result)

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:
  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 = 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:
c = sorted(list(map(int, input().split())))
if c[0] + c[1] == c[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=sorted([int(i) for i in 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())
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())
S = sorted([A,B,C])

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

Submission status: Accepted

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

if sum(li) == 2*max(li):
  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:
a,b,c=map(int,input().split())
n=[a,b,c]
n.sort()
if n[2]==n[0]+n[1]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if newlist[0]+newlist[1] == newlist[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:
def resolve():
    l=list(map(int, input().split()))
    l.sort(reverse=True)
    if l[0]==l[1]+l[2]:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

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

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=[int(i) for i in 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=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 max(a,b,c)==a+b+c-max(a,b,c):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
A = list(map(int,input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

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 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 c+a==b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#N = int(input())
h = [int(x) for x in input().split()]
for i in range(3):
    if h[i] + h[(i+1)%3] == h[(i+2)%3]:
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
a,b,c = (map(int, input().split()))
s1 = a+b
s2 = b+c
s3 = c+a
if s1==c or s2==a or s3==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 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 sum([a,b,c]) == 2 * max([a,b,c]):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

n.sort(reverse = True)

if n[0] == n[1]+n[2]:
    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:
def resolve():
	p = list(map(int, input().split()))
	m =max(p)
	s = 0
	for i in p:
		if i == m:
			continue
		s += i
	if m == s:
		print("Yes")
	else:
		print("No")
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if int((a+b+c)/a)==2 or int((a+b+c))/b==2 or int((a+b+c))/c==2:
    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 = list(map(int, input().split()))
if max(a) == sum(a) - max(a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

add = a + b + c
big = max(a, b, c)

if add == 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:
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 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 b+c == a or c+a == b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a, b, c = na()

flag = False
if a + b == c or a + c == b or b + c == a:
    flag = True

print("Yes" if flag else "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()))

max_des = max(A)

A.remove(max_des)

if sum(A)==max_des:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
l = sorted([int(i) for i in input().split()])
if l[2] == l[1] + l[0]:
  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 c+b==a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

h = (a + b + c) // 2
A = (a + b + c) % 2

if A != 0:
  print("No")
  exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
icase=47    
if icase==47:
    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 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 a+c==b else 'No')

Submission status: Accepted

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

    flag = False

    if a == b + c :
        flag = True
    if b == a + c :
        flag = True
    if c == b + a :
        flag = True

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

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:
# https://atcoder.jp/contests/abc047/tasks/abc047_a
candy_packs = sorted(map(int, input().split()))
if candy_packs[2] == (candy_packs[0] + candy_packs[1]):
    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=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())
print("Yes" if a+b==c or b+c==a or c+a==b else "No")

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
lst = sorted(lst)
print('Yes' if lst[0] + lst[1] == lst[2] 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=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())

AB = A+B
BC = B+C
CA = C+A

if AB==C or BC==A or CA==B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

a = li[0]
b = li[1]
c = li[2]

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

else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

C.sort()

if C[2] == C[1] + C[0]:
  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())
C = a + b
A = b + c
B = c + a

if a == A or b == B or C == c: print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
X = max([a, b, c])
if (X == a+b+c-X):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    a, b, c = map(int, input().split())
    ans = "No"
    if a == b + c:
        ans = "Yes"
    if b == c + a:
        ans = "Yes"
    if c == a + b:
        ans = "Yes"
    print(ans)


if __name__ == "__main__":
    main()

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())
print("Yes" if a+b == c or a+c == b or b+c == a else "No")

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
n.sort()
if n[0] + n[1] == n[2]:
    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()))
print("Yes" if max(a)*2==sum(a) 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 = sorted(list(map(int,input().split())))
print('Yes' if a[0]+a[1]==a[2] else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=sorted(list(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())
A=[a,b,c]
B=sorted(A)
if B[2]==B[0]+B[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

a.sort()

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

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
n = [a,b,c]
abc = (a+b+c)/2
if abc in n:
  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:
li = list(map(int, input().split()))
if li[0]+li[1] == li[2] or li[1]+li[2] == li[0] or li[2]+li[0] == li[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

l = [a,b,c]

abc = sum(l)/2

if abc in l:
  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())
d=max(a,b,c)
if d==a:
  if d==b+c:
    print('Yes')
  else:
    print('No')
elif d==b:
  if d==a+c:
    print('Yes')
  else:
    print('No')
elif d==c:
  if d==a+b:
    print('Yes')
  else :
    print('No')

Submission status: Accepted

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

if (tmp - a == tmp/2 or tmp - b == tmp/2 or tmp - c == tmp/2):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c= map(int, input().split())
hantei=0
if a+b==c:
    hantei=1
if a+c==b:
    hantei=1
if b+c==a:
    hantei=1
if hantei==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, 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 or a + c == b or b + c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

print("Yes"if max(a)==sorted(a)[-2]+min(a) else"No")

Submission status: Accepted

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

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

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:
a,b,c = map(int, input().split())
if (a+b)==c:
  print("Yes")
elif (a+c)==b:
  print("Yes")
elif (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) * 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 == b + a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
if max(a) == (sum(a)-max(a)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
m = max(l)
l.remove(max(l))
s = sum(l)
if m == s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if a+b == c or abs(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 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 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==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:
  print('Yes')
elif b + c == a:
  print('Yes')
elif c + a == b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if max(a,b,c) * 2 == sum((a,b,c)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
x.sort()
if x[2]==x[1]+x[0]:
    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 = list(map(int,input().split()))
a.sort()
print('Yes' if a[0]+a[1] == a[2] else 'No')

Submission status: Accepted

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

can.sort()

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

Submission status: Accepted

Solution code:
A, B, C = list(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 = [int(i) for i in 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 = list(map(int,input().split()))

def main():
  L = sorted(A,reverse = True)
  print("Yes" if (L[0] == L[1] + L[2]) else "No")
#  print(L[0],L[1],L[2])
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a == b + c:
	answer = "Yes"
elif b == a + c:
	answer = "Yes"
elif c == a + b:
	answer = "Yes"
else:
	answer = "No"

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
u = max(A)
l = min(A)
s = sum(A)
print('Yes' if u - l == s - (u + l) else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

def main():
    c.sort()
    ans = 'Yes' if c[0] + c[1] == c[2] else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 047: A – キャンディーと2人の子供 / Fighting over Candies
nums = [int(s) for s in input().split()]
nums.sort()

print("Yes" if nums[0] + nums[1] == nums[2] 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=list(sorted(map(int,input().split()))[::-1])
print("Yes" if a[0]==a[1]+a[2] else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,raw_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=sorted(map(int,input().split()));print('YNeos'[A+B!=C::2])

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    a.sort()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
import math
# stdin = open("sample.txt")

a = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sm = a + b + c
if sm - max(a,b,c) == sm // 2:
  print('Yes')


else:print('No')

Submission status: Accepted

Solution code:
import math

a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
if x+y==z or y+z==x or z+x==y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    C = [int(a) for a in input().split()]
    C.sort()
    if C[0] + C[1] == C[2]: print("Yes")
    else: print("No")
    

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def main():
    a, b, c = (int(i) for i in input().split())
    if a+b == c or b+c == a or b == c+a:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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