for i in range(int(input())):
a, b, c = map(int, input().split())
if a+b == c or b+c == a or c+a == b:
print("YES")
else:
print("NO")
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
bool* ans = new bool[t];
for (int k = 0; k < t; k++) {
int a[3], sum = 0;
for (int i = 0; i < 3; i++) {
cin >> a[i];
sum += a[i];
}
ans[k] = false;
for (int i = 0; i < 3; i++)
ans[k] |= (sum == 2 * a[i]);
}
for (int i = 0; i < t; i++)
cout << (ans[i] ? "YES": "NO") << '\n';
}
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |