From 6a49b56c5349ec264ba1259877c2596be380c3d7 Mon Sep 17 00:00:00 2001
From: songyc macbook <gitea@gitea>
Date: Mon, 2 Feb 2026 21:09:37 +0900
Subject: [PATCH] baekjoon 20260202

---
 code_study/Baekjoon/c/14489.c         | 11 +++
 code_study/Baekjoon/swift/16946.swift | 98 +++++++++++++++++++++++++++
 2 files changed, 109 insertions(+)
 create mode 100644 code_study/Baekjoon/c/14489.c
 create mode 100644 code_study/Baekjoon/swift/16946.swift

diff --git a/code_study/Baekjoon/c/14489.c b/code_study/Baekjoon/c/14489.c
new file mode 100644
index 0000000..e012467
--- /dev/null
+++ b/code_study/Baekjoon/c/14489.c
@@ -0,0 +1,11 @@
+#include <stdio.h>
+
+int a,b,c;
+
+int main() {
+    scanf("%d %d %d",&a, &b, &c);
+
+    printf("%d\n",(a+b >= 2*c) ? (a+b)-2*c : a+b);
+
+    return 0;
+}
\ No newline at end of file
diff --git a/code_study/Baekjoon/swift/16946.swift b/code_study/Baekjoon/swift/16946.swift
new file mode 100644
index 0000000..bba3088
--- /dev/null
+++ b/code_study/Baekjoon/swift/16946.swift
@@ -0,0 +1,98 @@
+func solve() {
+    guard let input1 = readLine() else { return }
+    let NM = input1.split(separator: " ").compactMap{Int($0)}
+    guard NM.count == 2 else { return }
+    let N = NM[0], M = NM[1]
+    
+    var field: [[Int]] = []
+    for i in 0..<N {
+        guard let input2 = readLine() else { return }
+        let row = input2.compactMap{Int(String($0))}
+        field.append(row)
+        for j in 0..<M {
+            if field[i][j] == 1 {
+                field[i][j] = -1
+            }
+        }
+    }
+
+    var groupSize: [Int] = []
+    
+    func BFS(group n: Int, col x: Int, row y: Int) {
+        var qu: [(Int, Int)] = [(x, y)]
+        var front = 0
+        field[y][x] = n
+        var cnt = 1
+        
+        while front < qu.count {
+            let (cx, cy) = qu[front]
+            front += 1
+            
+            for (nx, ny) in [(cx+1, cy), (cx-1, cy), (cx, cy+1), (cx, cy-1)] {
+                if 0 <= nx && nx < M && 0 <= ny && ny < N && field[ny][nx] == 0 {
+                    qu.append((nx, ny))
+                    field[ny][nx] = n
+                    cnt += 1
+                }
+            }
+        }
+        
+        groupSize.append(cnt)
+    }
+    
+    var group = 1
+    for row in 0..<N {
+        for col in 0..<M {
+            if field[row][col] == 0 {
+                BFS(group: group, col: col, row: row)
+                group += 1
+            }
+        }
+    }
+    
+    var ans: [[Int]] = Array(repeating: Array(repeating: 0, count: M), count: N)
+    for row in 0..<N {
+        for col in 0..<M {
+            if field[row][col] != -1 {
+                continue
+            }
+            
+            var nearbyGroup: [Int] = []
+            var cnt = 1
+            
+            for (nc, nr) in [(col+1, row), (col-1, row), (col, row+1), (col, row-1)] {
+                if 0 <= nc && nc < M && 0 <= nr && nr < N && field[nr][nc] != -1 {
+                    let nowGroup = field[nr][nc]
+                    
+                    if nearbyGroup.isEmpty {
+                        nearbyGroup.append(nowGroup)
+                        cnt += groupSize[nowGroup-1]
+                    }
+                    
+                    else {
+                        
+                        var grooupCheck = true
+                        for g in nearbyGroup {
+                            if g == nowGroup {
+                                grooupCheck = false
+                            }
+                        }
+                        
+                        if grooupCheck {
+                            nearbyGroup.append(nowGroup)
+                            cnt += groupSize[nowGroup-1]
+                        }
+                    }
+                }
+            }
+            
+            ans[row][col] = cnt%10
+        }
+    }
+    
+    for row in ans {
+        print(row.compactMap({String($0)}).joined(separator: ""))
+    }
+}
+
+solve()