4 files changed, 69 insertions, 0 deletions
diff --git a/codeforces/Sum/main b/codeforces/Sum/main
new file mode 100755
index 0000000..c66786b
--- /dev/null
+++ b/codeforces/Sum/main
diff --git a/codeforces/Sum/main.cpp b/codeforces/Sum/main.cpp
new file mode 100644
index 0000000..7a56c46
--- /dev/null
+++ b/codeforces/Sum/main.cpp
@@ -0,0 +1,54 @@
+#include <algorithm>
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+void solve() {
+  vi v(3);
+  for (auto &x : v) cin >> x;
+  if (v[0] + v[1] == v[2] || v[1] + v[2] == v[0] || v[0] + v[2] == v[1])  {
+    cout << "YES" << '\n';
+  } else {
+    cout << "NO" << '\n';
+  }
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
diff --git a/codeforces/Sum/main_input0.txt b/codeforces/Sum/main_input0.txt
new file mode 100644
index 0000000..40186dd
--- /dev/null
+++ b/codeforces/Sum/main_input0.txt
@@ -0,0 +1,8 @@
+7
+1 4 3
+2 5 8
+9 11 20
+0 0 0
+20 20 20
+4 12 3
+15 7 8
diff --git a/codeforces/Sum/main_output0.txt b/codeforces/Sum/main_output0.txt
new file mode 100644
index 0000000..3b142ff
--- /dev/null
+++ b/codeforces/Sum/main_output0.txt
@@ -0,0 +1,7 @@
+YES
+NO
+YES
+YES
+NO
+NO
+YES