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: Wrong Answer

Solution code:
ary = sorted([int(x) for x in input().split()])
if ary[0] + ary[1] == ary[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

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

if 2*m == a+b+c:
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
d = a + b + c
if d % 3 == 0:
    print("Yes")
else: print("NO")

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, raw_input().split())
total = a + b + c
if total % 2 != 0:
  print('No')
half = total // 2
if a == half or b == half or c == half or a+b == half or b+c == half or a+c == half:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b = a.sort

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if half == a+b or half == a+c or half == b+c:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

if a>b:
    if a>c:
        max = a
    else:
        max = c
else:
    if a<b:
        if c<b:
            max = b
        else:
            max = c

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

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

Submission status: Wrong Answer

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

if a>b:
    if a>c:
        max = a
    else:
        max = c
else:
    if a<b:
        if c<b:
            max = b
        else:
            max = c

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(l)
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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

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

Submission status: Wrong Answer

Solution code:
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

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

Submission status: Wrong Answer

Solution code:
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = [int(x) for x in input().split()]
print("Yes" if sum(num)%3 == 0 else "No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
print(['No','Yes'][(a+b+c)%3==0])

Submission status: Wrong Answer

Solution code:
print("Yes" if (lambda x: x[0] == sum(x[1:]) or sum(x[0:2]) == x[2])([int(i) for i in input().split()]) else "No")

Submission status: Wrong Answer

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

Ans = ( a + b + c ) / 3

if Ans == int(Ans):
	print("Yes")
	
else:
	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
sum = sum(list(map(int, input().split())))
if sum % 3 == 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
a.sort(key=int, reverse=True)
if a[0] == a[1] + a[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
print(["Yes","No"][sum(map(int,input().split()))&1])

Submission status: Wrong Answer

Solution code:

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

a = sorted(a)

if a[0] + a[1] == a[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
candy = input()
x = candy.split()
y = [0,0,0]
for i in range(3):
    y[i] = int(x[i])
i = 0
for v in y:
    if max(y) == v and y[(i+1)%3] + y[(i+2)%3] == v:
            print('YES')
            break
    i = i+1
if i >= 3:
    print('NO')

Submission status: Wrong Answer

Solution code:
candy = input()
x = candy.split()
y = [0,0,0]
for i in range(3):
    y[i] = int(x[i])
i = 0
for v in y:
    if max(y) == v and y[(i+1)%3] + y[(i+2)%3] == v:
            print('YES')
            break
    i = i+1
if i >= 2:
    print('NO')

Submission status: Wrong Answer

Solution code:
# coding: utf-8

a, b, c = map(int, input().split())
print( 'Yes' if (a+b+c)%3==0 else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
def solve():
    a, b, c = map(int, input().split())
    if a == b + c:
        ans = "YES"
    elif b == a + c:
        ans = "YES"
    elif c == a + b:
        ans = "YES"
    else:
        ans = "NO"
    print(ans)

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

import numpy as np
maxi = np.argmax(L)
maxv = L.pop(maxi)

if maxv == sum(L):
    print('Yes')

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(['Yes','No'][sum(map(int,input().split()))&1])

Submission status: Wrong Answer

Solution code:
import sys
 
for line in sys.stdin:
    card = line.split(" ")
    if card[0] > card[1]:
        print("Alice")
    elif card[0] < card[1]:
        print("Bob")
    else:
        print("Draw")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
print(s.count('WB') + s.count('BW'))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#prepare
f = True
List = []
#input
List = map(int,raw_input().split())

#evaluate
List.sort()

if not List[0]+List[1] == List[2]:
    f = False

#output
if f:
    print 'YES'
else:
    print 'NO'

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
a=[int(x) for x in a]
if sum(a)%2==0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def S(): return input()


def main():
    a = LI()
    if sum(a)  == max(a)*2:
        return 'YES'
    return 'NO'


print(main())

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def S(): return input()


def main():
    a = LI()
    if sum(a) % 3 == 0:
        return 'YES'
    return 'NO'


print(main())

Submission status: Wrong Answer

Solution code:
s=map(int,raw_input().split());print"No"*(sum(s)<2*max(s))or"Yes"

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if ((a+b+c)%3) ==0:
 print("Yes")
else:
 print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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




a,b,c = map(int,raw_input().split())
j = 0


if a + b == c or a + c == b or b + c== a:
    j=1

if(j == 1):
    print 'YES'
else:
    print 'NO'

Submission status: Wrong Answer

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




a,b,c = map(int,raw_input('>>>').split())
j = 0


if a + b == c or a + c == b or b + c== a:
    j=1

if(j == 1):
    print 'YES'
else:
    print 'NO'

Submission status: Wrong Answer

Solution code:
l = list(map(int, 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: Wrong Answer

Solution code:
l = sum(map(int, input().split()))
n = l%3
if n == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys

a, b, c = map(int, sys.stdin.readline().split())
ave = (a + b + c) / 2
if ave == a or ave == b or ave == c:
    print 'Yes'
else:
    print 'No'

Submission status: Wrong Answer

Solution code:
data = list(map(lambda x:int(x),input().split()))
data.sort()
data.reverse()

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

Submission status: Wrong Answer

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

sum = 0
for i in data:
        sum += int(i)

if sum % 2 == 0 :
        print('Yes')
else :
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = list(map(lambda x:int(x),list(input().split(' '))))
x,y,z = i
a =x+y+z
if a%3 is 0:
   print('Yes')
else:
   print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
"""Fighting over Candies

@author: hijiri.n
@modified: 11-19-2016

"""


def solve():
    candies = list(map(int, input().split()))
    ach = sum(candies) // 2
    for c in candies:
        if c == ach:
            return "Yes"
    return "No"
 

print(solve())

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
def solve_a():
    candies = list(map(int, input().split()))
    amount_half = sum(candies) // 2
    for c in candies:
        if c == amount_half:
            return "Yes"
    return "No"
 
print(solve_a())

Submission status: Wrong Answer

Solution code:
line=input()
line.split(" ")

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力

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

# 判定

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = [int(x) for x in input().split()]
print('yes' if (a+b+c)%2 else 'no')

Submission status: Wrong Answer

Solution code:
s = raw_input()
count  = 0
now = s[0]
for i in xrange(1,len(s)):
    if s[i] != now:
        now = s[i]
        count += 1
print count

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print 'No' if sum(map(int, raw_input().split()))%2 else 'Yes'

Submission status: Wrong Answer

Solution code:
print 'No' if sum(map(int, raw_input().split())) else 'Yes'

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==1:
    print("No")
else:
    print(a,half)
    if a==half or b==half or c==half:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

print a + b == c or b + c == a or a + c == b

Submission status: Wrong Answer

Solution code:
# Beginner 47
a, b, c = map(int, raw_input().split())

print a + b == c or b + c == a or c == a + b

Submission status: Wrong Answer

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

print (a+b+c) % 2 == 0

Submission status: Wrong Answer

Solution code:
s=input()
turn=s[0]
res=0
for i in range(1,len(s)):
    if s[i]!=turn:
        res+=1
        turn=s[i]
print(res)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==1:
    print("hNo")
else:
    print(a,half)
    if a==half or b==half or c==half or (a+b)==half or (b+c)==half or (c+a)==half:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

l = input().split()
l.sort()

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==0:
    print("No")
else:
    if a==half or b==half or c==half or a+b==half or b+c==half or c+a==half:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
# import time

# starttime=time.clock()

A,B,C =input().split()
a=int(A)
b=int(B)
c=int(C)
print(a+c)
 
if a>b:
    temp = a
    a = b
    b = temp
if b>c:
    temp = b
    b = c
    c = temp
if (a+b)==c:
    print("Yes")
#     endtime = time.clock()
#     print(endtime-starttime)
else:
    print("No")
#     endtime = time.clock()
#     print(endtime-starttime)
#

Submission status: Wrong Answer

Solution code:
S = raw_input()
prev = ""
count = -1
for s in S:
    if s != prev:
        prev = s
        count += 1

print count

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, raw_input().split())
if a>b:
	temp = a
	a = b
	b = temp

if b>c:
	temp = b
	b = c
	c = temp

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

Submission status: Wrong Answer

Solution code:
def canDiv(a,b,c):
    s = (a+b+c) 
    if a * 2 == s:
        return True
    if b * 2 == s:
        return True
    if c * 2 == s:
        return True
    return False

def main():
    a,b,c = map(int,raw_input())
    res = canDiv(a,b,c)
    if res == True:
        print "Yes"
    else:
        print "No"

Submission status: Wrong Answer

Solution code:
def canDiv(a,b,c):
    s = (a+b+c) 
    if a * 2 == s:
        return True
    if b * 2 == s:
        return True
    if c * 2 == s:
        return True
    return False

def main():
    #a,b,c = map(int,raw_input())
    a ,b,c = 1,3,3
    res = canDiv(a,b,c)
    if res == True:
        print "Yes"
    else:
        print "No"

Submission status: Wrong Answer

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

a.sort()
for i in range(len(a)):
	a[i]=int(a[i])
if a[0]+a[1]==a[2]:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
candies = list(map(int, input().split()))
print('yes' if max(candies) * 2 == sum(candies) else 'no')

Submission status: Wrong Answer

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

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

Submission status: Time Limit Exceeded

Solution code:
a, b, c = input().split()        
a, b, c = int(a), int(b), int(c) 
fl = False                       
ab = a+b                         
ac = a+c                         
bc = b+c                         
while(1):                        
    if ab == c:                  
        fl = True                
        break                    
    if bc == a:                  
        fl = True                
        break                    
    if ac == b:                  
        fl = True                
        break                    
if fl:                           
    print('Yes')                 
else:                            
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    iroha()

Submission status: Accepted

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

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

if m == (s - m):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
l1 = sorted(l, reverse = True)
s = sum(l1)
if l1[0] == s/2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
"""
ABC047 A - キャンディーと2人の子供
https://atcoder.jp/contests/abc047/tasks/abc047_a
"""

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

Submission status: Accepted

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

Submission status: Accepted

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

li = sorted([a, b, c])
ans = 'No'
if sum(li[:2])==li[2]:
    ans ='Yes'
print(ans)

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())
list=[a,b,c]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(250000)

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



#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)


# if b > c * 2 :
    #     b_price = c
    #
    # input_array_list = []
    #
    # while True:
    #     input_array = input().split()
    #     if input_array[0] == "0" and input_array[1] == "0":
    #         break
    #     else:
    #         input_array_list.append(input_array)
    #
    # for item in input_array_list:
    #     n = int(item[0])
    #     k_sum = int(item[1])
    #
    #     count = 0
    #     for i in range(1,n + 1- 2):
    #         for j in range(i+1, n + 1 - 1):
    #             for k in range (j+1, n+ 1):
    #                 if i + j + k == k_sum :
    #                     count = count + 1
    #     print(count)

    #
    # for item in input_array_list:
    #     if item[1] == "+":
    #         print(str(int(item[0])+int(item[2])))
    #     elif item[1] =="-":
    #         print(str(int(item[0])-int(item[2])))
    #     elif item[1] == "/":
    #         print(str(int(item[0])//int(item[2])))
    #     elif item[1] == "*":
    #         print(str(int(item[0])*int(item[2])))
    #

# import sympy as sp

# input_list = []
# a,b,c = map(int, input().split())
# divisors = sp.divisors(c)
#
# count = 0
#
# for divisor in divisors:
#     if a <= divisor and divisor <= b:
#         count = count + 1
# print(count)
#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)
#
# for pair_int in input_list:
#     if pair_int[0] <= pair_int[1]:
#         print("{} {}".format(pair_int[0], pair_int[1]))
#     else:
#         print("{} {}".format(pair_int[1], pair_int[0]))

#for i in range(10000):
#    print("Hello World")
#a = input().split()
#a_int = [int(s) for s in a]
#a_sorted = sorted(a_int)
#print(' '.join(map(str, a_sorted)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(map(int,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 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())
ma = max(a, b, c)
rem = a + b + c - ma
if ma == rem:
    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:
#ABC047A
a = list(map(int,input().split()))
a = sorted(a)
print("Yes" if a[0]+a[1]==a[2] else "No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split())) # a, b, cをそれぞれa[0], a[1], a[2]とする

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

if __name__ == '__main__':
    main()

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 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 print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    a, b, c = map(int, input().split())
    if a == b + c or b == a + c 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())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=list(map(int,input().split()))
L.sort()
print('Yes' if sum(L[:2])==L[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())

ans = "No"
if a + b == c:
  ans = "Yes"
if a + c == b:
  ans = "Yes"
if b + c == a:
  ans = "Yes"

print(ans)