-
Notifications
You must be signed in to change notification settings - Fork 0
/
소수_찾기(완전탐색).cpp
50 lines (42 loc) · 941 Bytes
/
소수_찾기(완전탐색).cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <unordered_map>
using namespace std;
unordered_map<int, int> ump;
vector<int> num;
vector<int> arr;
bool checkPrime(int num) {
int cnt = 0;
for (int j = 1; j <= sqrt(num); j++) {
if (num%j == 0) cnt++;
if (cnt > 1) return false;
}
if (cnt == 1) return true;
else return false;
}
int solution(string numbers) {
int answer = 0;
for (int i = 0; i < numbers.length(); i++) {
arr.push_back(numbers[i] - '0');
}
sort(arr.begin(), arr.end());
for (int i = 0; i < numbers.length(); i++) {
do {
string tmp = "";
for (int j = 0; j <= i; j++) {
tmp += to_string(arr[j]);
}
num.push_back(stoi(tmp));
} while (next_permutation(arr.begin(), arr.end()));
}
for (int i = 0; i < num.size(); i++) {
if (num[i] < 2) continue;
if (checkPrime(num[i]) && ump[num[i]] == 0) {
answer++;
ump[num[i]]++;
}
}
return answer;
}