From 32dd42ca6121976a6c003f0a6923b90c52a8ade7 Mon Sep 17 00:00:00 2001
From: songyc macbook <gitea@gitea>
Date: Sun, 25 Jan 2026 19:40:17 +0900
Subject: [PATCH] baekjoon 20260125

---
 code_study/Baekjoon/java/_11943.java  | 11 +++++++
 code_study/Baekjoon/swift/10844.swift | 25 +++++++++++++++
 code_study/Baekjoon/swift/1562.swift  | 44 +++++++++++++++++++++++++++
 3 files changed, 80 insertions(+)
 create mode 100644 code_study/Baekjoon/java/_11943.java
 create mode 100644 code_study/Baekjoon/swift/10844.swift
 create mode 100644 code_study/Baekjoon/swift/1562.swift

diff --git a/code_study/Baekjoon/java/_11943.java b/code_study/Baekjoon/java/_11943.java
new file mode 100644
index 0000000..cb80986
--- /dev/null
+++ b/code_study/Baekjoon/java/_11943.java
@@ -0,0 +1,11 @@
+import java.util.*;
+
+public class _11943 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int A = sc.nextInt(), B = sc.nextInt(), C = sc.nextInt(), D = sc.nextInt();
+        sc.close();
+
+        System.out.println(Math.min(A+D, B+C));
+    }
+}
\ No newline at end of file
diff --git a/code_study/Baekjoon/swift/10844.swift b/code_study/Baekjoon/swift/10844.swift
new file mode 100644
index 0000000..5fcad34
--- /dev/null
+++ b/code_study/Baekjoon/swift/10844.swift
@@ -0,0 +1,25 @@
+let N: Int = Int(readLine()!)!
+let MOD: Int = 1000000000
+
+var dp: [Int] = Array(repeating: 1, count: 10)
+dp[0] = 0
+
+for _ in 1..<N {
+    var next_dp: [Int] = Array(repeating: 0, count: 10)
+    
+    for i in 0...9 {
+        if i == 0 {
+            next_dp[i] = dp[1]
+        }
+        else if i==9 {
+            next_dp[i] = dp[8]
+        }
+        else {
+            next_dp[i] = (dp[i-1] + dp[i+1])%MOD
+        }
+    }
+    
+    dp = next_dp
+}
+
+print(dp.reduce(0,+)%MOD)
\ No newline at end of file
diff --git a/code_study/Baekjoon/swift/1562.swift b/code_study/Baekjoon/swift/1562.swift
new file mode 100644
index 0000000..bdcb85f
--- /dev/null
+++ b/code_study/Baekjoon/swift/1562.swift
@@ -0,0 +1,44 @@
+import Foundation
+
+let N: Int = Int(readLine()!)!
+let MOD: Int = 1000000000
+
+if N < 10 {
+    print(0)
+    exit(0)
+}
+
+var dp: [[[Int]]] = Array(repeating: Array(repeating: Array(repeating: 0, count: 1024), count: 10), count: N+1)
+for n in 1...9 {
+    dp[1][n][1<<n] = 1
+}
+
+for length in 1..<N {
+    for num in 0...9 {
+        for bit_state in 0..<1024 {
+            if dp[length][num][bit_state] == 0 {
+                continue
+            }
+            
+            var next = num - 1
+            if next >= 0 {
+                let next_bit_state = bit_state | (1<<next)
+                dp[length+1][next][next_bit_state] += dp[length][num][bit_state]
+                dp[length+1][next][next_bit_state] %= MOD
+            }
+            
+            next = num + 1
+            if next < 10 {
+                let next_bit_state = bit_state | (1<<next)
+                dp[length+1][next][next_bit_state] += dp[length][num][bit_state]
+                dp[length+1][next][next_bit_state] %= MOD
+            }
+        }
+    }
+}
+
+var ans = 0
+for n in 0...9 {
+    ans = (ans + dp[N][n][1023])%MOD
+}
+print(ans)