From 96254947699986c59f0dc63d69fd4b76bd3ed43e Mon Sep 17 00:00:00 2001
From: Sebastiano Tronto <sebastiano@tronto.net>
Date: Mon, 6 Jul 2026 19:08:08 +0200
Subject: Initial commit

---
 03_dynamic_programming/minimizing_coins_1634.cpp | 33 ++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 03_dynamic_programming/minimizing_coins_1634.cpp

(limited to '03_dynamic_programming/minimizing_coins_1634.cpp')

diff --git a/03_dynamic_programming/minimizing_coins_1634.cpp b/03_dynamic_programming/minimizing_coins_1634.cpp
new file mode 100644
index 0000000..f6189da
--- /dev/null
+++ b/03_dynamic_programming/minimizing_coins_1634.cpp
@@ -0,0 +1,33 @@
+#include <algorithm>
+#include <iostream>
+#include <queue>
+#include <vector>
+
+int f(const std::vector<int>& c, int x) {
+	static constexpr int max = 999999999;
+	std::vector<int> a(x+1, max);
+	std::queue<int> q;
+	a[0] = 0;
+	q.push(0);
+	while (!q.empty()) {
+		auto i = q.front();
+		q.pop();
+		for (auto k : c) {
+			if (i + k > x || a[i+k] <= a[i]+1) continue;
+			if (i + k == x) return a[i] + 1;
+			a[i+k] = a[i] + 1;
+			q.push(i + k);
+		}
+	}
+	return -1;
+}
+
+int main() {
+	int n, x;
+	std::cin >> n >> x;
+	std::vector<int> c(n);
+	for (int i = 0; i < n; i++)
+		std::cin >> c[i];
+
+	std::cout << f(c, x) << "\n";
+}
-- 
cgit v1.3