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

Submission status: Accepted

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

a,b,c = map(int, input().split())
l = [a,b,c]
l2 = heapq.nsmallest(3, l)
if (l2[0] + l2[1]) == max(l):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
cd_list = [i for i in map(int, input().split())]
cd_list.sort(reverse=True)
if cd_list[0] == cd_list[1] + cd_list[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split(" ")
sum1=int(a[0])+int(a[1])
sum2=int(a[0])+int(a[2])
sum3=int(a[1])+int(a[2])

if sum1==int(a[2]) or sum2==int(a[1]) or sum3==int(a[0]):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
packs = input().split()
p_list = []

for i in packs:
    p_list.append(int(i))


list.sort(p_list)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x.sort()

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
if a[0]+a[1]==a[2]:
    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=list(map(int,input().split()))
max=-1000000
i=0
rit=0
for x in a:
    if max<x:
        max=x
for x in a:
    i=i+x
rit=i-max
if max==rit:
    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=[int(_) for _ in input().split()]
a.sort()
if a[0]+a[1]==a[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
i = x + y + z
if i - max(x, y, z) == max(x, y, z) and i % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    l=list(map(int,input().split()))
    for i in range(3):
        if sum(l)-l[i]==l[i]:
            print('Yes')
            exit()
    print('No')
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))

li = LI()

for i in range(len(li)):
    for j in range(i+1,len(li)):
        if li[i]+li[j] == li[3-i-j]:
            print('Yes')
            exit()

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

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
if sum(A)%2:
    print("No")
    exit()
ave = sum(A)//2
if ave in 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:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    L.sort()
    print('Yes') if L[0] + L[1] == L[2] else print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

candy_packs = list(map(int, input().split(" ")))
to_be_candies = np.sum(candy_packs)/2

if to_be_candies in candy_packs:
  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())
whole = a + b + c
print("Yes") if (whole / 2) == max([a, b, c]) else print("No")

Submission status: Accepted

Solution code:
import itertools
A = list(map(int, input().split()))
s = sum(A)
A.sort()
for k in range(len(A)):
    li = list(itertools.combinations(A, k+1))
    for j in range(len(li)):
        if 2 * sum(li[j]) == s:
            print("Yes")
            break
    else:
        continue
    break
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 = map(int,input().split())
b = sorted(a)
if b[0] != 0 and b[1] != 0 and b[2] != 0:
    if b[2] == b[0] + b[1]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
 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')
 
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:50:39 2020

@author: shinba
"""

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

A.sort()

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

Submission status: Accepted

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

def cino(test=False):
    if not test:
        return int(input())
    else:
        return input()
def cina():
  return list(map(int,input().split()))



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

Submission status: Accepted

Solution code:
n=3
a=[0]*n
a[:]=map(int,input().split())
a.sort()
#print(a)
if sum(a)==2*a[n-1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

l = inputIL()

if max(l) == sum(l)/2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def solve(A):
    for a in A:
        if a * 2 == sum(A):
            return True
    return False
 
def main():
    A = list(map(int, input().split()))
    if solve(A):
        print('Yes')
    else:
        print('No')
 
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
candies = list(map(int, input().split()))

print('Yes' if (sum(candies) / 2) in candies else 'No')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
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())
t=a+b+c
k=0 if a+b==c or a+c==b or b+c==a else 1
print(['Yes','No'][k])

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:
c=[int(i)for i in input().split()]
a=0
for i in range(3):
  if c[i]==sum([int(j)for j in c if j is not c[i]]):
  	a+=1
print("Yes" if a>0 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
s_sort = sorted(s)
print('Yes' if s_sort[0]+s_sort[1] == s_sort[2] 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:
num1, num2, num3 = map(int,input().split())

num_group = [num1, num2, num3]

if (num1 + num2 + num3)/2 in num_group:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

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:
import sys
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

li = sorted([a,b,c])
if li[0]+li[1]==li[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

ans = [a,b,c]
sum_1 = 0
sum_2 = 0
for i in range(3):
    if i == ans.index(max(ans)):
        sum_1 += ans[i]
    else:
        sum_2 += ans[i]

if sum_1 == sum_2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
ls_x = x.split()

# 文字配列を整数化
# for i in range(len(ls_x)):
#     ls_x[i] = int(ls_x[i])

# 別の方法　lint_xという箱を作って，intしたものをappendしていく
lint_x = []
for i in ls_x:
    lint_x.append(int(i))

lint_x = sorted(lint_x)

if (lint_x[0] + lint_x[1] == lint_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 a == b + c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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 ABC_47_A():
    A,B,C = map(int, input().split())

    if A > B and A > C:
        if A == B + C:
            print('Yes')
        else:
            print('No')
    elif B > A and B > C:
        if B == A + C:
            print('Yes')
        else:
            print('No')
    else:
        if C == A + B:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':

    ABC_47_A()

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
s = sum(l)
m = s / 2
if m in l:
    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 = list(map(int,input().split()))
B = []

for i in range(0,3):
    for j in range(0,3):
        if j>i:
            temp = A[i] + A[j]
            B.append(temp)
            
if B[0] == A[2] or B[1] == A[1] or B[2] == A[0]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
I=list(map(int, input().split()))
n=0
for i in I:
  if i==sum(I)/2:
    n+=1
print('No' if n==0 else 'Yes')

Submission status: Accepted

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

Submission status: Accepted

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

l = [a, b, c]
l = sorted(l, reverse=True)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def resolve():
    bags = list(map(int, input().split()))
    print("Yes" if max(bags)*2 == sum(bags) else "No")
    


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
#ABC047A https://atcoder.jp/contests/abc047/tasks/abc047_a

a,b,c=(int(x) for x in input().split())

max=a
o1=b
o2=c

if b>max:
    max=b
    o1=a

if c>max:
    max=c
    o2=b

if max==(o1+o2):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

list = [a,b,c]

list.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,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:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    a,b,c=map(int,readline().split())

    li=[a,b,c]
    li.sort(reverse=True)
    if li[0]==li[1]+li[2]:
        print("Yes")
    else:
        print("No")
if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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