diff --git a/CSES Problem Set/Money Sums.cpp b/CSES Problem Set/Money Sums.cpp
new file mode 100644
index 0000000..93c4849
--- /dev/null
+++ b/CSES Problem Set/Money Sums.cpp	
@@ -0,0 +1,106 @@
+/* Problem URL: https://cses.fi/problemset/task/1745 */
+ 
+#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 (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t 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;
+    cin >> n;
+    vi fds(n);
+    cin >> fds;
+ 
+    V<V<bool>> dp(n + 1, V<bool>((ll)1e5, false));
+    dp[0][0] = true;
+ 
+    for (size_t i = 1; i <= n; i++) {
+        for (size_t j = 0; j <= (ll)1e5; j++) {
+            dp[i][j] = dp[i - 1][j];
+            if (j >= fds[i - 1] && dp[i - 1][j - fds[i - 1]]) {
+                dp[i][j] = true;
+            }
+        }
+    }
+ 
+    queue<int> q;
+    for (size_t j = 1; j <= (ll)1e5; j++) {
+        if (dp[n][j]) {
+            q.push(j);
+        }
+    }
+    cout << q.size() << '\n';
+    while (!q.empty()) {
+        cout << q.front() << ' ';
+        q.pop();
+    }
+    cout << '\n';
+}