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

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def solve():
    a = [int(i) for i in input().split()]
    a.sort()

    if a[0] + a[1] == a[2]:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 == 2*max((a,b,c)) else "No")

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
abc = list(map(int,input().split()))
index = abc.index(max(abc))
factor = 0
for tmp in range (0, len(abc)):
    if tmp != index:
        factor += abc[tmp]
    else:
        continue

if abc[index] == factor:
    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([int(i) for i in input().split()])
suma = sum(a) / 2
if sum(a) % 2 == 0 and suma == a[2] or suma == a[0] + a[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = list(map(int , input().split()))
flg = False
for i in range(1<<3):
    v = [0]*2
    tmp = i
    for j in range(3):
        v[tmp%2] += abc[j]
        tmp = tmp // 2
    if v[0] == v[1]:
        flg = True

if flg:
    print("Yes")
else:
    print("No");

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=sorted([int(i) for i in input().split()])
if a[0]+a[1]==a[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:
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:
# -*- coding: utf-8 -*-
# problem A

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

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

if max(a, b, c) * 2 == a+b+c:
    print "Yes"

else:
    print "No"

Submission status: Accepted

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

candy = map(int, raw_input().split())
mx = max(candy)
total = 0
for n in candy:
    if n != mx:
        total += n
if total == mx:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
user = list(map(int, input().split()))
max_index = user.index(max(user))
max_num = user[max_index]
user.pop(max_index)

if max_num == user[0] + user[1]:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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 = 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:
#coding: utf-8
 
def solve(a, b, c):
  if a == b + c:
    return "Yes"
  elif b == c + a:
    return "Yes"
  elif c == a + b:
    return "Yes"
  return "No"
 
print(solve(*list(map(int, input().split()))))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
input_lines = raw_input()

list_inputs = map(int,input_lines.split())

if max(list_inputs) == (sum(list_inputs) - max(list_inputs)):
  print "Yes"
else:
  print "No"

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, sys.stdin.readline().split())
if c == a + b:
    print 'Yes'
elif b == a + c:
    print 'Yes'
elif 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:
# coding: utf-8
"""Fighting over Candies

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

"""

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

def solve(candies):

    ach = sum(candies) / 2
    return ["No", "Yes"][ach in candies]

print(solve(c_in))

Submission status: Accepted

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

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

"""

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

def solve(candies):

    ach = sum(candies) / 2

    for c in candies:
        if c == ach:
            return "Yes"

    return "No"

print(solve(c_in))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
i = map(int, raw_input().split())
s = sum(i)
m = max(i)
if s == m*2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Solution code:
a,b,c=map(int,raw_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 =[int(x) for x in raw_input().split(" ")]

if a+b==c or a+c==b or b+c==a:
	print "Yes"

else:
	print "No"

Submission status: Accepted

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

Solution code:
# coding: utf-8

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

print(solve_a())

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
line=input()
line=line.split(" ")
 
a=int(line[0])
b=int(line[1])
c=int(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: Accepted

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

ans="No"
if x[0]+x[1] == x[2]:
    ans="Yes"
print(ans)

Submission status: Accepted

Solution code:
import sys

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
n = [
    [a, b, c],
    [b, c, a],
    [c, a, b]
]
for row in n:
    if row[0] + row[1] == row[2]:
        print('Yes')
        break
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a, b, c = seq

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

Submission status: Accepted

Solution code:
#abc047_a

s=map(int,raw_input().split())
maxc=max(s)
if sum(s)-maxc==maxc:
 print 'Yes'
else:
 print 'No'

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: UTF8

#input = "10 40 30"
#l = map(int, input.split())
l = list(map(int, input().split()))
l.sort()
a = l[0]
b = l[1]
c = l[2]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==1:
    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: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

A = []

A.append(a)
A.append(b)
A.append(c)

A.sort()

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

else:
    print("No")

Submission status: Accepted

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().split())
    res = canDiv(a,b,c)
    if res == True:
        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 a == b + c or b == c + a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:


l = map(int,raw_input().split())

if l[0] == l[1] + l[2]:
    print 'Yes'

elif l[1] == l[0] + l[2]:
    print 'Yes'

elif l[2] == l[0] + l[1]:
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

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                    
    break                        
if fl:                           
    print('Yes')                 
else:                            
    print('No')

Submission status: Accepted

Solution code:
L = list(map(int, input().split()))
max_index = L.index(max(L))

X = 0
S = 0

for i in range(3):
    if i == max_index:
        X = L[i]
    else:
        S += L[i]

if X == S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def read():
	return [int(i) for i in input().split(' ')]
L = read()
if(L[0] + L[1] == L[2] or L[0] + L[2] == L[1] or L[1] + L[2] == L[0]):
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())
l.sort()

if l[0] + l[1] == l[2]:
    print 'Yes'
else:
    print 'No'

Submission status: Accepted

Solution code:
candies = list(map(int, input().split()))
print('Yes' if max(candies) * 2 == sum(candies) else '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:
#!/usr/bin/env python
# coding: utf-8

def main():
    a, b, c = [int(i) for i in raw_input().split()]
    if a + b == c:
        print 'Yes'
    elif b + c == a:
        print 'Yes'
    elif 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 a+c == b or b+c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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:
def Main():
    A = list(map(int,input().split()))
    A.sort()

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

if __name__ == '__main__':
    Main()

Submission status: Accepted

Solution code:
# encoding: utf-8

a, b, c = map(int,raw_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([int(i) for i in raw_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:
    print('Yes')
elif b == a + c:
    print('Yes')
elif c == a + b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# coding: utf-8

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

if 2 * max(a, b, c) == sum([a, b, c]):
    print "Yes"

else:
    print "No"

Submission status: Accepted

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

Submission status: Accepted

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

A = list(map(int, input().split()))
A.sort()

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

Submission status: Accepted

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

a = l[0] + l[1]
b = l[2]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a, b, c = [int(x) for x in input().split()]
    combos = [a+b, a+c, b+c]
    ans = False
    for num in combos:
        if num == a or num == b or num == c:
            ans = True
    if ans:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
line = sys.stdin.readline()
line = line.split(" ")
inp = []
for i in line:
    inp.append(int(i))

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

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

num_list.sort()

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

Submission status: Accepted

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

t.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:



if __name__=='__main__':
    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:
list = input().split()
a = int(list[0])
b = int(list[1])
c = int(list[2])

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

Submission status: Accepted

Solution code:
dat = raw_input()
(A,B,C) = dat.split(" ")
A = int(A)
B = int(B)
C = int(C)

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
if sum(l) == max(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:
# A
a, b, c = [int(i) for i in 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(' '))
print('Yes' if a==b+c or b==a+c or c==a+b 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 = map(int, raw_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 = list(map(lambda x: int(x), input().split()))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
W, H, N = map(int, input().split())

xy = [0, W, 0, H]
judge = True
for n in range(N):
    x, y, a = map(int, input().split())
    a -= 1
    if a<=1 and judge:
        xy[a] = x
        if xy[0] >= xy[1]:
            judge = False
    else:
        xy[a] = y
        if xy[2] >= xy[3]:
            judge = False
    print(xy)
area = (xy[1] - xy[0]) * (xy[3] - xy[2])
if not judge:
    area = 0
    print(area)

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
# 3個のパックにそれぞれ、a,b,c個のキャンディーが入っている
# キャンディーを2人に分ける際、個数が等しくなるか判定

# 入力
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Runtime Error

Solution code:
#prepare
L = []
Q = []

#input
W, H, N, = map(int,raw_input().split())
for i in range(N):
    L.append(map(int,raw_input().split()))
x1=0
x2=W
y1=0
y2=H

#calculate
Q = [row[2] for row in L]


for k in range(N):
    if Q[k] == 1:
        x1 = max(x1,L[k][0])
    elif Q[k] == 2:
        x2 = min(x2,L[k][0])
    elif Q[k] == 3:
        y1 = max(y1,L[k][1])
    elif Q[k] == 4:
        y2 = min(y2,L[k][1])

print(max(0,x2-x1) * max(0,y2-y1)0

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
array = [list(map(int, input().split())) for i in range(N)]

xmin = 0
xmax = W
ymin = 0
ymax = H
for i in range(N):

    if array[i][2] == 1:
        if array[i][0] > xmin:
            xmin = array[i][0]
    if array[i][2] == 2:
        if array[i][0] < xmax:
            xmax = array[i][0]
    if array[i][2] == 3:
        if array[i][1] > ymin:
            ymin = array[i][1]
    if array[i][2] == 4:
        if array[i][1] < ymax:
            ymax = array[i][1]
area = (xmax-xmin)*(ymax-ymin)
if area <= 0:
    print(0)
else:
    print(area)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ais = sorted(map(int, raw_input()))
print 'Yes' if sum(ais[:2]) == ais[2] else 'No'

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
nums = list(map(int, input().split()))
ans = 0
for i in nums:
  if i == sum(nums.remove(i)):
    ans += 1
    break
if ans > 0:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

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: Runtime Error

Solution code:
a,b,c = 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: Runtime Error

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

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