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:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a,b,c=map(int,input().split())
s=a+b+c
h=math.ceil(s/2)
if s%2!=0:
    print('No')
elif h==a or h==b or h==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 = tuple(map(int, input().split()))

def judge():
    if a + b == c:
        return True
    elif b + c == a:
        return True
    elif a + c == b:
        return True
    else:
        return False


if judge():
    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 b==c+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:
import sys
import numpy as np

# a b c キャンディーの数
a, b, c = map(int, input().split())

candy = np.array([a, b, c])

# キャンディーの数順でソート
candy.sort()

# 少ない２つと一番多いので比較
if (candy[0] + candy[1] == candy[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
arr = input().split()
a = int(arr[0])
b = int(arr[1])
c = int(arr[2])

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    r = stdin.readline()[:-1]
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #n = int(r)
    #a = r.split()
    #a,b,c = r.split()
    a = list(map(int, r.split()))
    #a,b,c,d = map(int, r.split())
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]
    #res = 0

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

check = False
for i in l:
  if (i == (sum(l) - i)):
    check = True
    break

result = 'Yes' if check else 'No'
print(result)

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

Submission status: Accepted

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

a=sorted(a)

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

Submission status: Accepted

Solution code:
a,b,c = [int(i) for i in 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(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())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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=sorted(map(int, input().split()))

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

Submission status: Accepted

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

avg = sum(li)//3
max_index = li.index(max(li))

ans = [x for x in li if x!=li[max_index] ]

if sum(ans)==li[max_index]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
S = sum(A)//2

if S in A and sum(A)%2==0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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())
T=0
if a+b==c:
  T=1
elif b+c==a:
  T=1
elif a+c==b:
  T=1
if T==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:
  r = 'Yes'
else:
  r = 'No'
print(r)

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

Submission status: Accepted

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

n_i = [int(s) for s in n]

n_l = sorted(n_i)

if (n_l[0] + n_l[1] == n_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:
import sys


def solve(inp):
    A = list(map(int, inp.readline().strip().split(' ')))

    A = sorted(A)
    if A[0] + A[1] == A[2]:
        return "Yes"
    else:
        return "No"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

if candies[0]+candies[1] == candies[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):
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

sum = a + b + c
large = max(a, b, c)

if sum == large * 2:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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(lambda x: int(x), input().split())
lis = [a, b, c]
lis.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
import sys
input = sys.stdin.readline

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

tot = a + b + c

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):
  candy = list(map(int, input().split()))
  
  new_candy = sorted(candy)
  
  if new_candy[0] + new_candy[1] == new_candy[2]:
    print('Yes')
    
  else:
    print('No')

    
    
  return 0


if __name__ == '__main__':
  sys.exit(main())

Submission status: Accepted

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

al = sorted(al)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
import numpy as np
import itertools


def main(argv=sys.argv):
  
    packs = list(map(int, input().split(' ')))
    packs = sorted(packs)
    if packs[2] - packs[1] - packs[0] == 0:
        print('Yes')
    else:
        print('No')
  
    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 047 - A
# -*- encoding: UTF-8 -*-
a,b,c = map(int, input().split())

result = "No"

av = (a + b + c) / 2

if av == a or av == b or av == c :
  result = "Yes"


print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def main():
    x = [y for y in map(int,input().split())]
    x.sort()
    if x[0]+x[1]==x[2]:
        print("Yes")
    else:
        print("No")
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
a,b,c= [int(i) for i in input().split()]

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

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

Submission status: Accepted

Solution code:
import math

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())
 
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 = list(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:
import sys

a, b, c = map(int, sys.stdin.readline().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:
    print("Yes")
elif (b+c)==a:
    print("Yes")
elif (c+a)==b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = sorted([int(i) for i in 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 b + c == a or a + c == b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
A=list(map(int,input().split()));print(("No","Yes")[sum(A)/2 in A])

Submission status: Accepted

Solution code:
candies=list(map(int,input().split()))
for i in range(2**3):
  divide=[0]*2
  for j in range(3):
    divide[(i>>j)&1]+=candies[j]
  if divide[0]==divide[1]:
    print("Yes")
    break
else:
  print("No")

Submission status: Accepted

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

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:
import sys

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

def main():
    candies.sort()
    if candies[0] + candies[1] == candies[2]:
        return 'Yes'
    return 'No'

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

hantei_flag = 0

if(x == (y+z)):
    hantei_flag=1
elif(y == (z+x)):
    hantei_flag=1
elif(z == (x+y)):
    hantei_flag=1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

P = [a,b,c]

P.sort(reverse=True)
if P[0] == P[1] +P[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# 
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c = nm()
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()))

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

Submission status: Accepted

Solution code:
candy_bag = list(map(int, input().split()))
max_bag_num = max(candy_bag)
bag = 0
small_bag_sum = 0
for bag in candy_bag:
	if bag == max_bag_num:
		continue
	else:
		small_bag_sum += bag

if max_bag_num == small_bag_sum:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
n = list(int(x) for x in input().split())

n.sort()

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

Submission status: Accepted

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

m = max(lst)
if sum(lst) == 2*m:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

packs.sort()

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

Submission status: Accepted

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

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

if lis[0] == lis[1] + lis[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())
s=a+b+c

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

count=[a,b,c]
d =max(count)
v=0
count.remove(d)
for i in range(len(count)):
    v += count[i]

if v ==d :
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
# ABC047a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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:
list=sorted(list(map(int,input().split())))
print("Yes" if list[0]+list[1]==list[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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LI()
    print("YNeos"[sum(A)/2 not in A::2])
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
from string import ascii_lowercase
 
line = input()
a, b, c = [int(x) for x in line.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())

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

Submission status: Accepted

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

Submission status: Accepted

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

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

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

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

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