Add a lot more of my solutions.

I don't remember which ones doesn't pass though

CSES Problem Set/Sum of Three Values.cpp

@@ -0,0 +1,114 @@
+/* Problem URL: https://cses.fi/problemset/task/1641 */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n;
+    ll x;
+    cin >> n >> x;
+
+    if (n < 3) {
+        cout << "IMPOSSIBLE\n";
+        return 0;
+    }
+
+    V<pair<ll, int>> fds(n);
+    rep(i, n) {
+        fds[i].second = i;
+        cin >> fds[i].first;
+    }
+
+    sortv(fds);
+
+    nrep(i, 1, n) {
+        int l = 0;
+        int r = n - 1;
+
+        while (l != r) {
+            if (fds[l].first + fds[r].first == x - fds[i].first && l != i && r != i) {
+                cout << fds[l].second + 1 << ' ' << fds[r].second + 1 << ' ' << fds[i].second + 1 << '\n';
+                    return 0;
+            }
+
+            if (fds[l].first + fds[r].first < x - fds[i].first) {
+                l++;
+                continue;
+            }
+            r--;
+        }
+    }
+
+
+    cout << "IMPOSSIBLE\n";
+}