Sum (Codeforces 1742A)
Tags: Implement, implementation

You are given three integers $$$a$$$, $$$b$$$, and $$$c$$$. Determine if one of them is the sum of the other two.

Input: The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 9261$$$) — the number of test cases.The description of each test case consists of three integers $$$a$$$, $$$b$$$, $$$c$$$ ($$$0 \leq a, b, c \leq 20$$$).

Output: For each test case, output "YES" if one of the numbers is the sum of the other two, and "NO" otherwise.You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

Note: In the first test case, $$$1 + 3 = 4$$$.In the second test case, none of the numbers is the sum of the other two.In the third test case, $$$9 + 11 = 20$$$.

Sample Inputs:
7
1 4 3
2 5 8
9 11 20
0 0 0
20 20 20
4 12 3
15 7 8

Sample Outputs:
YES
NO
YES
YES
NO
NO
YES

Solution (Python):
for s in [*open(0)][1:]:
    (a, b, c) = sorted(map(int, s.split()))
    print('YNEOS'[a + b != c::2])

Solution (Python):
for test in [sorted(list(map(int, input().split()))) for _ in '_' * int(input())]:
    print('YES') if test[2] == test[0] + test[1] else print('NO')

Solution (Python):
def add(l):
    a = max(l)
    b = min(l)
    l.remove(a)
    l.remove(b)
    if a - b in l:
        print('YES')
    else:
        print('NO')
n = int(input())
l = []
for _ in range(n):
    l.append(list(map(int, input().split())))
for i in range(n):
    add(l[i])