20-dohyeondol1

dohyeondol1/README.md

@@ -19,4 +19,6 @@
  | 15차시 | 2025.05.22 |  DFS  | [석유 시추](https://school.programmers.co.kr/learn/courses/30/lessons/250136)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/60|
  | 16차시 | 2025.05.24 |  BFS  | [토마토](https://www.acmicpc.net/problem/7576)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/61|
  | 17차시 | 2025.06.26 |  기하학  | [선분 교차 2](https://www.acmicpc.net/problem/17387)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/65|
- | 18차시 | 2025.07.04 |  기하학  | [Water Testing](https://www.acmicpc.net/problem/16057)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/70|
+ | 18차시 | 2025.07.04 |  기하학  | [Water Testing](https://www.acmicpc.net/problem/16057)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/70|
+ | 19차시 | 2025.07.09 |  그래프 이론  | [최소 스패닝 트리](https://www.acmicpc.net/problem/1197)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/76|
+ | 20차시 | 2025.07.10 |  문자열  | [접두사](https://www.acmicpc.net/problem/1141)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/78|

dohyeondol1/문자열/20-dohyeondol1.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+
+string arr[50];
+
+int main() {
+    cin.tie(nullptr)->sync_with_stdio(false);
+
+    int N;
+    cin >> N;
+    for(int i = 0; i < N; i++)
+        cin >> arr[i];
+    sort(arr, arr+N);
+
+    int count = N;
+    for(int i = 0; i < N-1; i++) {
+        string prefix = arr[i+1].substr(0, arr[i].size());
+        if(prefix == arr[i])
+            count--;
+    }
+
+    cout << count << '\n';
+    return 0;
+}