Problem:


Score : 100 points

Problem Statement

Two students of AtCoder Kindergarten are fighting over candy packs.

There are three candy packs, each of which contains a, b, and c candies, respectively.

Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.

Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Constraints

1 ≦ a, b, c ≦ 100

Input

The input is given from Standard Input in the following format:

a b c

Output

If it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.

Sample Input 1

10 30 20

Sample Output 1

Yes

Give the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.

Sample Input 2

30 30 100

Sample Output 2

No

In this case, the student who gets the pack with 100 candies always has more candies than the other.

Note that every pack must be given to one of them.

Sample Input 3

56 25 31

Sample Output 3

Yes



Sample input:
10 30 20


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
t=a+b+c
k=0 if a+b==c or a+c==b or b+c==a else 0
print('YNeos'[k::2])

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
t=a+b+c
k=0
k|=0 if t-a in [a,b,c] else 1
k|=0 if t-b in [a,b,c] else 1
k|=0 if t-c in [a,b,c] else 1
print('YNeos'[k::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A+B == C or A+C ==B or B+C == A:
    print('Yec')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
#047_A
s=list(map(int,input().split()))
print('Yes' if sum(s)%2==0 else 'No')

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = [int(v) for v in input().split()]

    half = (a + b + c) // 2

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


main()

Submission status: Wrong Answer

Solution code:
def main():
    candy = [int(v) for v in input().split()]

    candy.sort()

    total = sum(candy)

    half = total // 2

    ac = 0
    for c in candy:
        ac += c
        if ac == half:
            print("Yes")
            exit()

    print("No")


main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if sum(total_list[:1]) == total_list[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
# スペース区切りの整数の入力
a, b, c = map(int, input().split())

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

Submission status: Wrong Answer

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

total = a+b+c
if total%2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=list(input());a.sort()
if a[0]+a[1]==a[2]:
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
import copy
a = list(map(int,input().split()))
nokori  = copy.copy(a)
count = max(a)
nokori.remove(count)
if a[0] == a[1] == a[2]:
    print("No")
if int(nokori[0] + nokori[1]) == count:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import copy
a = list(map(int,input().split()))
nokori  = copy.copy(a)
count = max(a)
nokori.remove(count)
if a[0] == a[1] == a[2]:
    print("NO")
if int(nokori[0] + nokori[1]) == count:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
list = input().split()
list.sort(reverse=True)
list = [int(n) for n in list]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

sm = sum([a, b, c])

if sm//2 in set([a, b, c]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 2, Feb, 2020
"""

import sys
import itertools

import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

candies = []
candies.append(a)
candies.append(b)
candies.append(c)

max_candy = max(candies)

candies.remove(max_candy)

if sum(candies) == max_candy:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, B, C = map(int,input().split())
 
if A+B==C or A+C==B or B+C==A:
  r = True
else:
  r = False
print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(lambda x: int(x), input().split())
lis = [a, b, c]
lis.sort()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
if a == b == c:
    print('1')
elif a == b != c:
    print('2')
elif a != b == c:
    print('2')
elif b != c == a:
    print('2')
else:
    print('3')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

sum = a + b + c
if sum % 3 == 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a = input().split()
a.sort()
if int(a[0]) + int(a[1]) == int(a[2]):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a = input().split()
b = max(a)
c =0
for i in a:
  if int(i) < int(b):
    c += int(i)

if c == int(b):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:

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

P = [a,b,c]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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)%3!=0::2])
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:




# a, b, c = map(int, input().split())
# for i in itertools.permutations([a, b, c], 3):
#     if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

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




# a, b, c = map(int, input().split())
# for i in itertools.permutations([a, b, c], 3):
#     if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



# a, b, c = map(int, input().split())
# for i in itertools.permutations([a, b, c], 3):
#     if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys ,fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



# a, b, c = map(int, input().split())
# for i in itertools.permutations([a, b, c], 3):
#     if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, itertools ,fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0



# a, b, c = map(int, input().split())
# for i in itertools.permutations([a, b, c], 3):
#     if i[0] == sum(i[1:]) or sum(i[:2]) == i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
print(0)
for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# import sys, math, itertools, heapq, collections, bisect, fractions
# input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
# sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
print(0)
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")z

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# import sys, math, itertools, heapq, collections, bisect, fractions
# input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
# sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
print(0)
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys#, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
print(0)
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
print(0)
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys#, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

# a,b,c=map(int,input().split())
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

# a,b,c=map(int,input().split())
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ame=[int(i) for i in input().split()]
m=max(ame)
ame.remove(m)
count=0
for i in ame:
    count+=i

if(count==m):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ave = (a+b+c)//3

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

Submission status: Wrong Answer

Solution code:
# DPで解く

packs = [int(candies) for candies in input().split()]
N = int(len(packs))
half = int(sum(packs) / 2)

dp = [[False] * (half + 1)] * (N + 1)
dp[0][0] = True

for i in range(N):
    for j in range(half+1):
        if dp[i][j]:
            dp[i+1][j] = dp[i][j]
        elif j >= packs[i]:
            dp[i+1][j] = dp[i][j - packs[i]]

if dp[N][half]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = a+b+c

if ans%2==0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if sum(abc)%3 == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
can = list(map(int,input().split()))
if sum(can)/2 == max(can):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
ls = list(map(int, input().split()))
s = sum(ls)
for i in range(3):
    if ls[i] == s // 2:
        print('Yes')
        break
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a == b + c\
  or b == c + a\
  or c == b + c:
    print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
nums = list(int(i) for i in input().split())
nums.sort()
if nums[2] == nums[1] + nums[0]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a, b, c = input_
a, b, c = int(a), int(b), int(c)

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

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:

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

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

can.sort()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = [int(x) for x in input().split()]
print('Yes' if max(l) == sum(l)//2 else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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