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:
#!/usr/bin/env python3
import sys, itertools
from fractions import gcd
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, itertools ,fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, itertools 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



a, b, c = map(int, input().split())
for i in itertools.permutations([a, b, c], 3):
    if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
# print(0)
for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if data[0]+data[1]==data[2] or data[0]+data[2]==data[1] or data[1]+data[2]==data[0]:
    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=[int(x) for x 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()))
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 c == a+b or b == a+c or a == b+c:
    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,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 or a+c == b or b+c ==a :
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = [int(a) for a in input().split()]
if sum(A) == max(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 = map(int, input().split())
list = sorted([a, b, c])
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:
    print('Yes')
elif a+c ==b:
    print('Yes')
elif b+c ==a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


# スペース区切りの整数の入力
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,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())
s = a+b+c
m = max(a,b,c)
ans = 'No'
if m == s-m:
    ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x 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 = [int(i)  for i in input().split()]
a.sort()

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

Submission status: Accepted

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

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

ABC.sort()

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

Submission status: Accepted

Solution code:
def examA():
    abc = LI()
    abc.sort()
    if abc[0]+abc[1]==abc[2]:
        ans = "Yes"
    else:
        ans ="No"
    print(ans)


import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
import itertools


def solve():
    ABC = tuple(map(int, input().split()))
    # print(ABC)

    permus = tuple(itertools.permutations((0, 1, 2), 3))
    for a, b, c in permus:
        if ABC[a] == ABC[b] + ABC[c]:
            return True
        if ABC[a] + ABC[b] == ABC[c]:
            return True

    return False


if __name__ == '__main__':
    res = solve()
    if res:
        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:
l=[int(_) for _ in input().split()]
l.sort()
if l[0]+l[1]==l[2]:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
ame=[int(i) for i in input().split()]
m=max(ame)
ame.remove(m)
count=0
for i in ame:
    count+=i

if(count==m):
    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:
l = list(map(int, input().split()))

print('Yes' if max(l) * 2 == sum(l) else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
f=False
if a+b==c or b+c==a or 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==b+c or c+a==b else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
li = list(map(int, input().split()))
li.sort()
if li[0]+li[1] == li[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 b+c == a:
    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 c + a == b:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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 - キャンディーと2人の子供 / Fighting over Candies
a, b, c = [int(s) for s in input().split()]
print('Yes' if a + b == c or b + c == a or c + a == b 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:
  ans = "Yes"
else:
  ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X = 2 #int(input())
packs = [int(candies) for candies in input().split()]
N = int(len(packs))
if sum(packs) % X == 0:
    A = int(sum(packs) / X) # 部分和がAになれば良い
else: 
    print('No')
    exit()
packSum = [sum([packs[x] for x in range(N) if i & (1 << x) != 0]) for i in range(1 << N)]
dp = [False] * (1 << N)
dp[0] = True #どのパックも使わないとき条件を満たす
for i in range(len(dp)): #現在使われてるパックの集合
    if not dp[i]:
        continue
    for j in range(N): #追加するパックの候補
        if i & (1 << j) == 0: #すでに使われていないか調べる
            dp[i | (1 << j)] = dp[i | (1 << j)] or packSum[i] // A == packSum[i | (1 << j)] // A or packSum[i] % A + packs[j] == A
            

if dp[-1]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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 = sorted(list(map(int,input().split())))
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())
 
ave = (a+b+c)//2
 
if (a+b+c)%2 != 0:
  print("No")
elif a == ave or b == ave or c == ave:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if abc[0]==abc[1]+abc[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:
packs = [int(candies) for candies in input().split()]
N = int(len(packs))
X = 2
if sum(packs) % X == 0:
    A = int(sum(packs) / X) 
else: 
    print('No')
    exit()

dp = [[False] * (A + 1)] * (N + 1)
dp[0][0] = True

for i in range(N):
    for j in range(A+1):
        if dp[i][j]:
            dp[i+1][j] = dp[i][j]
        elif j >= packs[i]:
            dp[i+1][j] = dp[i][j - packs[i]]

if dp[N][A]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
# 書き方を少し変えたver

packs = [int(candies) for candies in input().split()]
N = int(len(packs))
if sum(packs) % 2 == 0:
    half = int(sum(packs) / 2)
else: 
    print('No')
    exit()

dp = [[False] * (half + 1)] * (N + 1)
dp[0][0] = True

for i in range(N):
    for j in range(half+1):
        if dp[i][j]:
            dp[i+1][j] = dp[i][j]
        elif j >= packs[i]:
            dp[i+1][j] = dp[i][j - packs[i]]

if dp[N][half]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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:
abc=list(map(int,input().split()))
abc.sort()
if sum(abc[:2]) ==abc[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

sorted_n = sorted(n)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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()))
print('Yes' if sum(A) == max(A)*2 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = list(map(int, input().split()))
max_val = max(c); c.remove(max_val)
total_val = sum(c)
if max_val == total_val:
    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:
from sys import stdin
def main():
    a = list(map(int, input().split()))
    a.sort()
    if a[0] + a[1] == a[2]:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = list(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 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==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==a+c or c==a+b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
l = [a+b,b+c,c+a]
if (a in l) | (b in l) | (c 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 c+a==b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#n = int(input())
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 max(a,b,c)*2 == 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 c+b==a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    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:
kazu=list(map(int, input().split()))
kazu.sort()
if kazu[0]+kazu[1]==kazu[2]:
	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:
i = list(map(int,input().split()))
a = i[0]
b = i[1]
c = i[2]
if a+b==c or b+c==a or a+c==b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
A=a.split()
for i in range(len(A)):
    A[i]=int(A[i])
A.sort()
if A[0]+A[1]==A[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    abc = list(map(int, input().rstrip('\n').split()))
    abc.sort()
    if sum(abc[:2]) == abc[-1] or abc[0] == sum(abc[1:]):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls = list(map(int, input().split()))
s = sum(ls)
for i in range(3):
    if s % 2 == 0 and ls[i] == s // 2:
        print('Yes')
        break
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 = sorted(list(map(int, input().split())))
print('Yes' if a[0] + a[1] == a[2] else 'No')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = list(map(int,input().split()))
if sum(abc) - 2*max(abc) == 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, b, c = tuple(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 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 == c + a 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 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 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:
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:
*ab, c = sorted(map(int, input().split()))
print(['No', 'Yes'][sum(ab) == c])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
nums = list(int(i) for i in input().split())
nums.sort()
if nums[2] == nums[1] + nums[0]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

sm = a + b + c

if sm / a == 2 or sm / b == 2 or sm / c == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a = LIST()
    a.sort()
    if a[0]+a[1]==a[2]:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if set1 == c or set2 == b or set3 == a:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#coding:utf-8

candy = sorted(list(map(int, input().split())), reverse=True)

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

Submission status: Accepted

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

a, b, c = input_
a, b, c = int(a), int(b), int(c)

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:
def main():
  packs = [int(x) for x in raw_input().split()]
  if packs[0] == packs[1]+packs[2]:
      print("Yes")
      return
  if packs[1] == packs[0]+packs[2]:
      print("Yes")
      return
  if packs[2] == packs[0]+packs[1]:
      print("Yes")
      return
  print("No")
  

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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