10-dohyeondol1

dohyeondol1/README.md

@@ -10,3 +10,5 @@
  | 6차시 | 2025.04.05 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/22|
  | 7차시 | 2025.04.08 |  트리  | [트리 순회](https://www.acmicpc.net/problem/1991)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/26|
  | 8차시 | 2025.04.11 |  덱  | [회전하는 큐](https://www.acmicpc.net/problem/1021)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/32|
+ | 9차시 | 2025.04.30 |  그리디 알고리즘  | [체육복](https://school.programmers.co.kr/learn/courses/30/lessons/42862)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/33|
+ | 10차시 | 2025.04.30 |  완전 탐색  | [소수 찾기](https://school.programmers.co.kr/learn/courses/30/lessons/42839)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/37|

dohyeondol1/완전 탐색/10-dohyeondol1.cpp

@@ -0,0 +1,31 @@
+#include <string>
+#include <vector>
+#include <set>
+#include <cmath>
+#include <algorithm>
+using namespace std;
+
+bool isPrime(int num) {
+    if(num < 2) return false;
+    for(int i = 2; i <= sqrt(num); i++)
+        if(num % i == 0) return false;
+    return true;
+}
+
+int solution(string numbers) {
+    int answer = 0;
+    set<int> numberSet;
+
+    sort(numbers.begin(), numbers.end());
+    do {
+        for(int i = 1; i <= numbers.length(); i++) {
+            int n = stoi(numbers.substr(0, i));
+            numberSet.insert(n);
+        }
+    } while(next_permutation(numbers.begin(), numbers.end()));
+
+    for(int num : numberSet)
+        if(isPrime(num)) answer++;
+
+    return answer;
+}