[20250805] BAJ / 골드4 / 좋은수열 / 양진혁

JinHyeok/202508/01 BAJ 저울.md

@@ -0,0 +1,40 @@
+```
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+    int N, M;
+    cin >> N >> M;
+
+    vector<vector<bool>> heavier(N + 1, vector<bool>(N + 1, false));
+
+    for (int i = 0; i < M; i++) {
+        int a, b;
+        cin >> a >> b;
+        heavier[a][b] = true;
+    }
+
+    for (int k = 1; k <= N; k++) {
+        for (int i = 1; i <= N; i++) {
+            for (int j = 1; j <= N; j++) {
+                if (heavier[i][k] && heavier[k][j]) {
+                    heavier[i][j] = true;
+                }
+            }
+        }
+    }
+
+    for (int i = 1; i <= N; i++) {
+        int cnt = 0;
+        for (int j = 1; j <= N; j++) {
+            if (i == j) continue;
+            if (!heavier[i][j] && !heavier[j][i]) cnt++;
+        }
+        cout << cnt << '\n';
+    }
+
+    return 0;
+}
+
+```

JinHyeok/202508/04 BAJ 호텔.md

@@ -0,0 +1,40 @@
+```
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main() {
+    int C, N;
+    cin >> C >> N;
+
+    vector<pair<int, int>> city(N);
+    for (int i = 0; i < N; i++) {
+        cin >> city[i].first >> city[i].second;
+    }
+
+    vector<int> dp(C + 101, 1e9);
+    dp[0] = 0;
+
+    for (int i = 0; i <= C + 100; i++) {
+        for (int j = 0; j < N; j++) {
+            int cost = city[j].first;
+            int customer = city[j].second;
+            if (i >= customer) {
+                dp[i] = min(dp[i], dp[i - customer] + cost);
+            }
+        }
+    }
+
+    int answer = 1e9;
+    for (int i = C; i <= C + 100; i++) {
+        answer = min(answer, dp[i]);
+    }
+
+    cout << answer << '\n';
+    return 0;
+}
+
+
+```

JinHyeok/202508/05 BAJ 좋은수열.md

@@ -0,0 +1,41 @@
+```
+#include <iostream>
+#include <string>
+using namespace std;
+
+int N;
+bool found = false;
+
+bool check(const string &s) {
+    int len = s.length();
+    for (int i = 1; i <= len / 2; i++) {
+        if (s.substr(len - i, i) == s.substr(len - 2 * i, i)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+void dfs(string s) {
+    if (found) return;
+
+    if (s.length() == N) {
+        cout << s << '\n';
+        found = true;
+        return;
+    }
+
+    for (char c = '1'; c <= '3'; c++) {
+        s.push_back(c);
+        if (check(s)) dfs(s);
+        s.pop_back();
+    }
+}
+
+int main() {
+    cin >> N;
+    dfs("");
+    return 0;
+}
+
+```