Quartz sync: Aug 6, 2025, 8:24 PM

Author: codeyoma

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/18111/18111.md

@@ -1,20 +1,30 @@
 ---
-tags: ["ps/boj/silver/2", "ps/boj/silver", "cs/algorithms/bruteforcing/ps","cs/algorithms/implementation/ps"]
+tags:
+  [
+    "ps/boj/silver/2",
+    "ps/boj/silver",
+    "cs/algorithms/bruteforcing/ps",
+    "cs/algorithms/implementation/ps",
+  ]
 ---
 
 # Problem
+
 - [https://www.acmicpc.net/problem/18111](https://www.acmicpc.net/problem/18111)
 
 # Logic
+
 - bruteforce
-  - $m * n * 256 < 1억 $ = bruteforce
+  - $m _ n _ 256 < 1억 $ = bruteforce
   - 모든 높이에 대해서 최소 도출
 - optimize
   - 평균을 기준으로 이동
     - 구현이 많아서 비추천
 
 # My Code
 
+## cpp
+
 ```cpp title="boj/18111.cpp"
 
 #include <vector>
@@ -61,4 +71,20 @@ void solution()
 }
 
 
+```
+
+## python
+
+```python title="boj/18111.py"
+
+
+sys.setrecursionlimit(10**9)
+input = sys.stdin.readline
+output = sys.stdout.write
+
+
+def solve():
+    return
+
+
 ```

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/23968/23968.md

@@ -0,0 +1,39 @@
+---
+tags:
+  [
+    "ps/boj/bronze/1",
+    "ps/boj/bronze",
+    "cs/algorithms/implementation/ps",
+    "cs/algorithms/sorting/ps",
+    "cs/algorithms/simulation/ps",
+  ]
+---
+
+# Problem
+
+- [https://www.acmicpc.net/problem/23968](https://www.acmicpc.net/problem/23968)
+
+# Logic
+
+# My Code
+
+## cpp
+
+```cpp title="boj/23968.cpp"
+
+#include <vector>
+void solution()
+{
+}
+
+
+```
+
+## python
+
+```python title="boj/23968.py"
+
+def solve():
+    return
+
+```

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/30804/30804.md

@@ -0,0 +1,74 @@
+---
+tags: ["ps/boj/silver/2", "ps/boj/silver", "cs/algorithms/implementation/ps","cs/algorithms/bruteforcing/ps","cs/algorithms/two-pointer/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/30804](https://www.acmicpc.net/problem/30804)
+
+# Logic
+
+# My Code
+
+## cpp
+
+```cpp title="boj/30804.cpp"
+
+#include <unordered_map>
+#include <vector>
+void solution()
+{
+    int n, max_dist = C_MIN, l_pos = 0, l_num, r_num;
+    unordered_map<int, int> two;
+
+    cin >> n;
+    for (int r_pos = 0; r_pos < n; ++r_pos) {
+        int temp;
+        cin >> temp;
+
+        if (two.count(temp)) {
+            two[temp] = r_pos;
+        } else {
+            if (two.size() < 2) {
+                if (!l_num)
+                    l_num = temp;
+                else
+                    r_num = temp;
+
+            } else {
+                if (two[r_num] > two[l_num]) {
+                    l_pos = two[l_num] + 1;
+                    two.erase(l_num);
+                    l_num = r_num;
+                    r_num = temp;
+                } else {
+                    l_pos = two[r_num] + 1;
+                    two.erase(r_num);
+                    r_num = temp;
+                }
+            }
+
+            two[temp] = r_pos;
+        }
+        max_dist = max(max_dist, (r_pos - l_pos) + 1);
+    }
+    cout << max_dist;
+}
+
+
+```
+
+## python
+
+```python title="boj/30804.py"
+
+
+sys.setrecursionlimit(10**9)
+input = sys.stdin.readline
+output = sys.stdout.write
+
+
+def solve():
+    return
+
+
+```

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/31403/31403.md

@@ -0,0 +1,45 @@
+---
+tags: ["ps/boj/bronze/4", "ps/boj/bronze", "cs/algorithms/mathematics/ps","cs/algorithms/string/ps","cs/algorithms/arithmetic/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/31403](https://www.acmicpc.net/problem/31403)
+
+# Logic
+
+# My Code
+
+## cpp
+
+```cpp title="boj/31403.cpp"
+
+#include <vector>
+void solution()
+{
+    int a, b, c;
+    cin >> a >> b >> c;
+
+    cout << a + b - c << endl;
+    cout << ((stoi(to_string(a).append(to_string(b))))-c) << endl;
+    log(stoi(to_string(a).append(to_string(b))) - c);
+    log("b", stoi(to_string(a).append(to_string(b))) - c);
+}
+
+
+```
+
+## python
+
+```python title="boj/31403.py"
+
+
+sys.setrecursionlimit(10**9)
+input = sys.stdin.readline
+output = sys.stdout.write
+
+
+def solve():
+    return
+
+
+```