From f3f720ee0f7891cfe0c48806f955e50182409b03 Mon Sep 17 00:00:00 2001
From: sh0723 <pshpark12345@naver.com>
Date: Thu, 2 Jul 2026 13:17:10 +0900
Subject: [PATCH] =?UTF-8?q?14391=20:=20=EC=A2=85=EC=9D=B4=EC=A1=B0?=
 =?UTF-8?q?=EA=B0=81=20solve?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/week4/BOJ14391/BOJ14391_V1.cpp | 75 ++++++++++++++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 src/week4/BOJ14391/BOJ14391_V1.cpp

diff --git a/src/week4/BOJ14391/BOJ14391_V1.cpp b/src/week4/BOJ14391/BOJ14391_V1.cpp
new file mode 100644
index 0000000..906cda2
--- /dev/null
+++ b/src/week4/BOJ14391/BOJ14391_V1.cpp
@@ -0,0 +1,75 @@
+#include <bits/stdc++.h>
+using namespace std;
+int N,M;
+bool selected[16];
+int arr[4][4];
+int ret = INT_MIN;
+int calculate() {
+    int sum = 0;
+    for (int i=0; i<N; i++) {
+        string s = "";
+        for (int j=0; j<M; j++) {
+            if (selected[i*M + j]) {
+                if (s == "") continue;
+                else {
+                    sum += stoi(s);
+                    s = "";
+                    continue;
+                }
+            }
+            s += to_string(arr[i][j]);
+        }
+        if (s == "") continue;
+        sum += stoi(s);
+    }
+
+    for (int j = 0; j < M; j++) {
+        string s = "";
+        for (int i = 0; i < N; i++) {
+            if (!selected[i*M + j]) {
+                if (s == "") continue;
+                else {
+                    sum += stoi(s);
+                    s = "";
+                    continue;
+                }
+            }
+            s += to_string(arr[i][j]);
+        }
+        if (s == "") continue;
+        sum += stoi(s);
+    }
+
+    return sum;
+}
+void dfs(int num) {
+    if (num == N * M) {
+        ret = max(ret, calculate());
+        return;
+    }
+    dfs(num+1);
+    selected[num] = true;
+    dfs(num+1);
+    selected[num] = false;
+}
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> N >> M;
+
+    for (int i = 0; i < N; i++) {
+        string s;
+        cin >> s;
+        for (int j = 0; j < M; j++) {
+            arr[i][j] = s[j] - '0';
+        }
+    }
+
+    dfs(0);
+
+    cout << ret << '\n';
+    return 0;
+}
\ No newline at end of file