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:
a = [int(x) for x in 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+c ==b or b+c == a :
  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())
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:
lst = list(map(int, input().split()))
lst.sort()
if sum(lst[:2]) == lst[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

if candy[0] + candy[1] == candy[2]:
    print("Yes")

elif candy[0] + candy[2] == candy[1]:
    print("Yes")
    
elif candy[1] + candy[2] == candy[0]:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    if a == b + c:
        print("Yes")
    elif b == a + c:
        print("Yes")
    elif c == a + b:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

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=sorted(list(map(int, input().split())))
print('YNeos'[l[0]+l[1]-l[2]!=0::2])

Submission status: Accepted

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

if nums[0] + nums[1] == nums[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())
l = [a,b,c]
ld = sorted(l, reverse=True)
max = ld[0]
mix = ld[1]+ld[2]
if max==mix :
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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()))
a.sort()
if a[0] + a[1] == a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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 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:
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:
candies = input().split()
if (int(candies[0]) + int(candies[1]) == int(candies[2])) or (int(candies[1]) + int(candies[2]) == int(candies[0])) or (int(candies[0]) + int(candies[2]) == int(candies[1])):
  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:
s = list(map(int, input().split()))
if sum(s) == max(s)*2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

def solve():
    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")

if __name__ == "__main__":
    solve()

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,b,c = map(int,input().split())
d = (a+b+c)/2
if a==d or b==d or c==d:
    print('Yes')
else:
    print('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 = list(map(int,input().split()))
b = sorted(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
a, b, c = map(int, input().split())
l = [a,b,c]
if max(l) == sum(l) - max(l):
    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 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, b, c= map(int, input().split())

Inp = [a,b,c]
Sum = 0
max_num = max(Inp)
Inp.remove(max_num)
for i in Inp: Sum += i
if max_num == Sum: print('Yes') 
else: print('No')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
if sum(a)==2*max(a):
	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 = list(map(int, input().split()))
l = [a+b==c, b+c==a, c+a==b]
if any(l):
	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:
    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())

d = max(a,b,c)

sum = a+b+c

if d == sum-d:
    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 = [int(x) for x in input().split()]
a.sort()
if sum(a[0:2]) == a[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b, c = nl()

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

Submission status: Accepted

Solution code:
lst = list(map(int, input().split()))
if max(lst)==sum([i for i in lst if i!=max(lst)]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if max(a,b,c) == sum([a,b,c])-max(a,b,c):
    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()))
a.sort()

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

Submission status: Accepted

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

t = max(x, y, z) - min(x, y, z)

if t == x or t == y or t == z:
    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 = list(map(int,input().split()))
a.sort()
if a[-1]==sum(a[0:2]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
l=[a,b,c]
MAX=max(l)
SUM=sum(l)
if MAX==SUM-MAX:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
L = [int(i) for i in input().split()]
if sum(L) == 2 * max(L):
    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,b,c=(int(x) for x in 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:
c = list(map(int,input().split()))
print('Yes' if max(c) == sum(c) - max(c) else 'No')

Submission status: Accepted

Solution code:
ls = sorted(list(map(int, input().split())),reverse=True)
if ls[0] == sum(ls[1:]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
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:
import itertools

a = list(map(int,(input().split(' '))))
c = list(itertools.combinations(a, 2))
#b = int(input())
#h = int(input())
#print(c)
a.sort()

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

Submission status: Accepted

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


abc()

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())

ans = "No"

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
[x,y,z]=sorted([a,b,c], reverse=True)
if y+z==x:
    print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=[int(i) for i in input().split()]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int,raw_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 = [int(x) for x in input().split()]
print('Yes') if A == (B+C) or B == (A+C) or C == (A+B) else print('No')

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in input().split()]
if(2*max(a,b,c)-(a+b+c)==0):
    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:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A問題
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()))

S = sorted(candy, reverse = True)
if S[0] == S[1] + S[2]:
    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:
a,b,c=map(int,input().split())
d=max(a,max(b,c))
if 2*d==(a+b+c):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

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

Submission status: Accepted

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

abc_list = list(map(int, input().split()))
# print(abc_list)

abc_list.sort()

# print(abc_list)

a, b, c = abc_list

# print(a)
# print(b)
# print(c)

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a = f()
    if sum(a) - max(a) == max(a):
        print('Yes')
    else:
        print('No')

solve()

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

Submission status: Accepted

Solution code:
a, b, c = sorted([ int(v) for v in 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 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:
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:
l=list(map(int,input().split()))
if max(l)*2==sum(l):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - キャンディーと2人の子供 / Fighting over Candies
https://atcoder.jp/contests/abc047/tasks/abc047_a

"""
import sys


def solve(a, b, c):
    candies = sorted([a, b, c])
    if candies[0] + candies[1] == candies[2]:
        return 'Yes'
    return 'No'


def main(args):
    a, b, c = map(int, input().split())
    ans = solve(a, b, c)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split(' '))
print('Yes' if a == b + c or b == c + a or c == b + a 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:
a, b, c = map(int, input().split())
if a + b + c in [2 * a, 2 * b, 2 * c]:
    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=sorted(map(int,input().split()))
print('Yes' if a[-1]==sum(a[:-1]) else '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:
values = list(map(int, input().split()))
values = sorted(values)
if values.pop() == sum(values):
    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:
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:
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:
a = list(map(int, input().split()))
a.sort()
b = a[0]
c = a[1]
d = a[2]
if b + c == d:
    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:
l=list(map(int,input().split()))
l.sort()

print("YNeos"[l[0]+l[1]!=l[2]::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))
l.sort()
m = l[-1]
l.pop()
if sum(l) == m:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
*a, = map(int,input().split())
if sum(a) == 2*max(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:
nums=list(map(int,input().split()))

answer=sorted(nums,reverse=True)

if sum(answer)%2==0 and answer[0]==answer[1]+answer[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) 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:
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:
candy = list(map(int, input().split()))

max_ = max(candy)

print("Yes" if (sum(candy)-max_ == max_) 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:
import copy

l = [int(n) for n in input().split()]
l_ = copy.copy(l)

for i in range(3):
    l_ = copy.copy(l)
    k = l_[i]
    del l_[i]
    if sum(l_) == k:
        print('Yes')
        break
    
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

S = [int(i) for i in input().split()]
T = sum(S)/2

for i in range(3):
  if S[i] == T:
    print("Yes")
    sys.exit()
    
print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = [int(s) for s in input().split()]
abc.sort()

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

Submission status: Accepted

Solution code:
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:
a=list(map(int,input().split()));print("YNeos"[sum(a)!=max(a)*2::2])

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 max(a,b,c)*2 == a+b+c else print('No')

Submission status: Accepted

Solution code:
lists = list(map(int,input().split()))
lists.sort()
c= lists.pop()
a,b= lists.pop(),lists.pop()
if 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 = sorted(list(map(int, input().split())))

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

S = a + b + c
if ((S % 2 == 0) and ((S / 2 == a) or (S / 2 == b) or (S / 2 == c))):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

max = 0
sum = 0

for i in range(3):

    if i == 0:
        max = int(candy[i])
    else:
        if int(candy[i]) > max:
            sum = sum + max
            max = int(candy[i])
        else:
            sum = sum + int(candy[i])


if max == sum:
    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:
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:
l, m, h = sorted(map(int, input().split()))
print(['No', 'Yes'][h == (l+m)])

Submission status: Accepted

Solution code:
C = list(map(int, input().split()))
m = max(C)
s = sum(C) - m
print(['No', 'Yes'][m == s])

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:
# -*- coding: utf-8 -*-

def solve(a, b, c):
    X = [a, b, c]
    flag = False
    
    for i in range(1<<3):
        A = B = 0
        for j in range(3):
            if((i>>j)&1):
                A += X[j]
            else:
                B += X[j]
        if(A == B):
            flag = True
                
    print("Yes" if flag else "No")
    
if __name__ == '__main__':
    a, b, c = map(int, input().split())
    
    solve(a, b, c)

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:


def read_input():
    a, b, c = map(int, input().split())
    return a, b, c

def submit():
    a, b, c = read_input()

    candies = [a, b, c]
    candies.sort(reverse=True)

    if candies[0] == sum(candies[1:]):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

if sum(abc) % 2:
    print('No')
else:
    abc.sort()
    a, b, c = abc
    if a == b+c or 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')