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

Submission status: Accepted

Solution code:
#47
data=list(input().split())
if (int(data[0])>int(data[1]) and int(data[0])>int(data[2])):
    if int(data[0])==int(data[1])+int(data[2]):
        print('Yes')
    else:
        print('No')
elif (int(data[1])>int(data[0]) and int(data[1])>int(data[2])):
    if int(data[1])==int(data[0])+int(data[2]):
        print('Yes')
    else:
        print('No')
elif (int(data[2])>int(data[1]) and int(data[2])>int(data[0])):
    if int(data[2])==int(data[1])+int(data[0]):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 047_a
a, b, c = map(int, input().split())
if (1 <= a <= 100) & (1 <= b <= 100) & (1 <= c <= 100):
    if (a + b == c) | (a == b + c) | (a + c == b):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    from itertools import product
    x = list(map(int, readline().split()))

    def judge():
        for bit in product(range(2), repeat=3):
            first = 0
            second = 0
            for i, b in enumerate(bit):
                if b:
                    first += x[i]
                else:
                    second += x[i]
            if first == second:
                return True
        return False

    if judge():
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# キャンディの個数を取得
a,b,c = map(int,input().split())

#判定結果をもとにメッセージを出力
if a == b + c\
or b == a + c\
or c == a + b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

# 入力
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:
import sys
def input(): return sys.stdin.readline().strip()

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - キャンディーと2人の子供
# https://atcoder.jp/contests/abc047/tasks/abc047_a

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

result = 'No'

if a + b == c or a + c == b or a == b + c:
    result = 'Yes'

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A+B=C か　A+C=B か B+C=Aになるか判定

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:
abc = list(map(int, input().split()))
abc_max = max(abc)
abc2 = abc
abc2.remove(abc_max)

if abc_max == sum(abc2):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

print("Yes" if abc[0]+abc[1] == abc[2] else "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:
# 競プロ幼稚園に通う2人の子供がキャンディーの取り合いをしています。
# 3個のキャンディーパックがあり、それぞれのパックにはキャンディーがa,b,c個入っています。
# えび先生はこの3個のパックを、キャンディーの個数が等しくなるように2人に分けようとしています。そのような分け方が可能かどうかを判定してください。
# ただし、キャンディーをパックから取り出すことはできず、それぞれのパックをそのままどちらかの子供にあげる必要があります。

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 競プロ幼稚園に通う 2人の子供がキャンディーの取り合いをしています。
# 3個のキャンディーパックがあり、
# それぞれのパックにはキャンディーが a, b, c個入っています。
# えび先生はこの 3個のパックを、
# キャンディーの個数が等しくなるように 2人に分けようとしています。
# そのような分け方が可能かどうかを判定してください。
# ただし、キャンディーをパックから取り出すことはできず、
# それぞれのパックをそのままどちらかの子供にあげる必要があります。

# 制約
# 1 ≦ a, b, c ≦ 100

# 標準入力から、a, b, c の値を取得する
a, b, c = map(int,input().split())

result = "ret"
if (a + b) == c:
    result = "Yes"
elif (a + c) == b:
    result = "Yes"
elif (b + c) == a:
    result = "Yes"
else:
    result = "No"

print(result)

Submission status: Accepted

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

# 2等分できるならYes、できないならNo
if a + b == c:
    print('Yes')
elif a + c == b:
    print('Yes')
elif b + c == a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 - キャンディーと2人の子供

# それぞれ数個ずつキャンディーの入ったパックが3個ある
# 二人の子供に、キャンディーを等しい数ずつ分けられるか判定する


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

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

Submission status: Accepted

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

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

else:
    print('No')


# 出力

Submission status: Accepted

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

Submission status: Accepted

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

S_max = max(S_list)
answer = (sum(S_list)) / S_max
if answer == 2:
    result = "Yes"
else:
    result = "No"
print(result)

Submission status: Accepted

Solution code:
#
# abc047 a
#

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """10 30 20"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """30 30 100"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """56 25 31"""
        output = """Yes"""
        self.assertIO(input, output)


def resolve():
    C = list(map(int, input().split()))
    C.sort()

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


if __name__ == "__main__":
    # unittest.main()
    resolve()

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:
candy = sorted([int(x) for x in input().split()])
if candy[0] + candy[1] == candy[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# 047a

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:
str_line = input().split(" ")
num_line = [int(n) for n in str_line]
num_line.sort()
#print(num_line)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#   AtCoder abc047 a
#   ストレッチ課題

#   入力
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:
# 047A

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:
ais = sorted(map(int, raw_input().split()))
print 'Yes' if sum(ais[:2]) == ais[2] else 'No'

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# a,b,cの袋の中のキャンディーの個数を整数で入力
a,b,c = map(int,input().split())
# 袋から出さずに2つの同じ数に分けられるならYes、ダメならNo
if a + b == c or a + c == b or b + c ==a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - キャンディーと2人の子供

# 2人の子供がキャンディーの取り合いをしている
# 3個のキャンデーパックがあり、れぞれのパックには
# キャンディーが  a ,  b ,  c  個入っています

# 先生が、上記3個のパックをキャンディーの個数が等しくなるように
# 2人に分けようとしている

# そのような分け方が可能かどうかを判定する。
# 可能なら Yes  そうでないなら No

# a b c を標準入力から得る
a, b, c = map(int, input().split(maxsplit=3))
# print(a, b, c)

# 以下条件で等しく分けることが可能
# a = b + c
# b = a + c
# c = a + b

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

# 結果を出力
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int, input().split()))
ma = s.index(max(s))

if s.pop(ma) == sum(s):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c= [int(i) for i in input().split()]
d = 0
if a+b==c:
  d+=1
elif a+c==b:
  d+=1
elif b+c==a:
  d+=1
if d==1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c= [int(i) for i in input().split()]
d = 0
if a+b==c:
  d+=1
elif a+c==b:
  d+=1
elif b+c==a:
  d+=1
if d==1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ２人で同じ個数になるように分ける。
# ３つの袋が同じ数かつ偶数の場合も分けれる。

a_box, b_box, c_box = map(int, input().split())

if a_box == b_box + c_box:
    print('Yes')
elif b_box == a_box + c_box:
    print('Yes')
elif c_box == a_box + b_box:
    print('Yes')
elif a_box == b_box == c_box and (a_box + b_box + c_box) % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if candy.count(sum(candy)/2) == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# coding = SJIS

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
s=a+b+c
if s%2==1:
  print("No")
  exit()
n=s//2
if n in [a,b,c]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=[int(i)for i in input().split()]
b=a.pop(a.index(max(a)))
if sum(a)==b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = a.split()
x = int(b[0])
y = int(b[1])
z = int(b[2])

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
l = LI()
l.sort(reverse=True)
if l[0] == l[1] + l[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:
n = sorted(list(map(int,input().split())))
print('Yes' if n[0]+n[1] == n[2] else 'No')

Submission status: Accepted

Solution code:
# A - キャンディーと2人の子供
def main():
    abc = list(map(int, input().split()))


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

if __name__ ==  "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    a, b, c = map(int, readline().split())
    if a + b + c - max(a, b, c) == max(a, b, c):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = [int(x) for x in input().split()]
L.sort()
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 b+c==a or c+a==b:print('Yes')
else:print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    n = map(int, input().split())
    n_sorted = sorted(n)
    if n_sorted[0] + n_sorted[1] == n_sorted[2]:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a+b==c:
    flag+=1
    print("Yes")

if a==b+c:
    flag+=1
    print("Yes")

if a+c==b:
    flag+=1
    print("Yes")

if flag==0:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

ans = "No"

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

num_lists = [a, b, c]
maximum = a
if maximum < b: maximum = b
if maximum < c: maximum = c

max_index = num_lists.index(maximum)
num_lists.pop(max_index)

remainder = num_lists[0] + num_lists[1]
if maximum == remainder:
  ans = 'Yes'
else:
  ans = 'No'
  
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = map(int, input().split())
l = sorted(l, reverse=True)
if l[0] == sum(l[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:
def MAP(): return map(int, input().split())
x = sorted(MAP())
if x[0] + x[1] == x[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if(a+b==c or b+c==a or c+a==b):
    ans="Yes"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

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

    lists.sort()

    if lists[2] == lists[1] + lists[0]:
        print('Yes')

    else:
        print('No')


if __name__ == "__main__":
    main()