-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQ35.cpp
More file actions
63 lines (51 loc) · 1.11 KB
/
Copy pathQ35.cpp
File metadata and controls
63 lines (51 loc) · 1.11 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <string>
#include <vector>
#include <iostream>
#include <cmath>
#include <sstream>
using namespace std;
bool isPrime(long long number) {
if (number < 2) {
return false;
}
if (number == 2) {
return true;
}
if (number % 2 == 0) {
return false;
}
for (long long i = 3; i <= sqrt(number); i += 2) {
if (number % i == 0) {
return false;
}
}
return true;
}
vector<long long> split(string num) {
stringstream ss(num);
string buf;
vector<long long> result;
while (getline(ss, buf, '0')) {
if (buf.size() == 0) {
continue;
}
result.push_back(stoll(buf));
}
return result;
}
int solution(int n, int k) {
int answer = 0;
int number = n;
string knumber = "";
while (number > 0) {
knumber = to_string(number % k) + knumber;
number /= k;
}
vector<long long> sNumber = split(knumber);
for (long long num : sNumber) {
if (isPrime(num)) {
answer++;
}
}
return answer;
}