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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input().split())
for i in range(len(s)):
  s[i]=int(s[i])
if sum(s)-2*max(s)==0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if (a+b)==c 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:
s = list(map(int, input().split()))

s_max = max(s)
s.remove(s_max)

if sum(s) == s_max:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arr = sorted([int(x) for x in input().split()])
print("Yes" if arr[2]==arr[0]+arr[1] else "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 = 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 = sorted(map(int,input().split()))
print("Yes" if sum(a[:2]) == a[2] else "No")

Submission status: Accepted

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

if a + b == c:
    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:
list = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=sorted(map(int,input().split()));print('YNeos'[a+b!=c::2])

Submission status: Accepted

Solution code:

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

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can.sort()

if can[0]+can[1] == can[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 b+c == a or c+a == b else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
packs = [int(x) for x in input().split()]
for p in packs:
    if p == sum(packs) / 2:
        print("Yes")
        break
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

div = (a + b + c) / 2

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

Submission status: Accepted

Solution code:
N = input().split()
A,B,C=int(N[0]),int(N[1]),int(N[2])
if A+B==C or A+C==B or B+C==A:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

mod = 10 ** 9 + 7

li = na()
li.sort()
print('Yes' if li[0] + li[1] == li[2] else 'No')

Submission status: Accepted

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

A.sort()

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

Submission status: Accepted

Solution code:
candy_packs = [int(x) for x in input().split()]
print('Yes' if max(candy_packs) == sum(candy_packs)/2 else '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:
List = [int(i) for i in input().split()]
List.sort()
if List[0]+List[1]==List[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = sorted(list(map(int,input().split())))
print("Yes" if a.pop()==sum(a) else "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):
        return "Yes"
    return "No"

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
if 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, 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())
sum = A + B + C
M = max([A, B, C])
if M == sum - M:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

x = a+b
y = b+c
z = c+a

if x ==c or y ==a or z ==b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print('YNeos'[a+b!=c!=abs(a-b)::2])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print('NYoe s'[c in(a+b,a-b,b-a)::2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print('YNeos'[(a+b!=c)&(b+c!=a)&(c+a!=b)::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = (int(i) for i 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):
  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=sorted(map(int,input().split()))
print("Yes" if A[2]==A[0]+A[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 = 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 = sorted(map(int, input().split()))

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

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
x.sort(reverse=True)
if x[1] + x[2] == x[0]:
  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=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:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b,c = inputMap()
    
    tot = a+b+c
    cc = max(a,b,c)
    
    if tot - cc == cc:
        print("Yes")
    else:
        print("No")
    
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
nyuryoku = [a, b, c]
saidai = max(nyuryoku)
nyuryoku.remove(saidai)

if saidai == sum(nyuryoku):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()));print("NYoe s"[sum(a)/2 in a::2])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print("NYoe s"[(a+b+c)/2 in[a,b,c]::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = sorted([a, b, c])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))
flag = False
if s[0]+s[1] == s[2]:
    flag = True
elif s[0]+s[2]==s[1]:
    flag = True
elif s[0] == s[1]+s[2]:
    flag = True

if flag:
    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:
import sys
import bisect
input = sys.stdin.readline
 
def main():
    s = list(map(int,input().split()))
    s.sort()
    
    if(s[0]+s[1]==s[2]):
        print("Yes")
    else:
        print("No")
    
main()

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 = [int(i) for i in input().split()]

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

Submission status: Accepted

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

print("Yes" if A+B == C else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(map(int, input().split()))
max_num_id = N.index(max(N))
max_num = max(N)
del N[max_num_id]
if sum(N) == max_num:
    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 = sorted(map(int, input().split()))
print('Yes' if a[2] == a[0] + a[1] else '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=sorted(list(map(int,input().split())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

cand_max = max(inp)
inp.remove(cand_max)

if cand_max == inp[0] + inp[1]:
    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 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 = sorted(map(int, input().split()))
print('YNeos'[a+b!=c::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print("Yes" if sum(a)/2 in a and sum(a) % 2 == 0 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = sorted([int(x) for x in input().split()])
if A + B == C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

X_sort=sorted(X, reverse=True)
if X_sort[0]==X_sort[1]+X_sort[2]:
    print('Yes')
    
else:
    print('No')

Submission status: Accepted

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

if li[0]-li[1]==li[2]:
  print("Yes")
else :
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

candy_sum = sum(candy)

res = 0
for i in candy:
    if candy_sum - i == i:
        res = 1

if res == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = sorted(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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a= sorted(list(map(int, input().split())))
if a[2]==a[1]+a[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:
num = input().split()
a,b,c = int(num[0]),int(num[1]),int(num[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 0

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import bisect



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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: int, b: int, c: int):
    ret = NO
    s = a + b + c
    if s % 2 == 0 and (a == s // 2 or b == s // 2 or c == s // 2):
        ret = YES
    print(ret)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc=[int(x) for x in input().split()]
abc.sort()
if sum(abc)==abc[-1]*2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(a: int, b: int, c: int):
    s = (a + b + c) / 2

    if s in [a, b, c]:
        print('Yes')
    else:
        print('No')
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    b = int(next(tokens))  # type: int
    c = int(next(tokens))  # type: int
    solve(a, b, c)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

# solve
l.sort()

# output
print('Yes' if sum(l[0:2]) == l[-1] else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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