๋ฐ์ํ
https://school.programmers.co.kr/learn/courses/30/lessons/92335#
ํ์ด
function solution(n, k) {
function isPrime(num) {
if(num === 1)
return false;
for(let i=2; i<Math.sqrt(num); i++) {
if(num%i === 0)
return false;
}
return true;
}
let ans = 0;
let arr = n.toString(k).split("0");
for(let i of arr) {
if(i !== '' && isPrime(parseInt(i)))
ans++;
}
return ans;
}
์ํ์ฐฉ์ค
๋งค๋ฒ ์์ ๊ตฌํ๋ ค๊ณ ๋ฐ๋ณต๋ฌธ ๋๋๊ฒ ๋๋ฌด ๋นํจ์จ์ ์ด๊ฒ ๋ณด์ฌ์
์๋ผํ ์คํ ๋ค์ค์ ์ฒด๋ฅผ ์ด์ฉํ์ฌ ์์์ฌ๋ถ๋ฅผ ๋ฐ๋ก ๋ฐํํด์ฃผ๋ ๋ฐฐ์ด์ ๋ง๋ค์ด์ ํ์ดํ๋๋ฐ
1๋ฒ, 12๋ฒ, 15๋ฒ ํ ์ผ์์ ํ๋ ธ๋ค๊ณ ๊ณ์ ๋ ์ ํฌ๊ธฐํ๋ค ใ ใ
// isPrime[num] = num์ด ์์์ธ๊ฐ?
const INF = 1000000;
let isPrime = [];
for(let i=0; i<=INF; i++) {
isPrime.push(true);
}
isPrime[0] = isPrime[1] = false;
for(let i=2; i<=INF; i++) {
if(!isPrime[i]) {
continue;
}
for(let j=i*i; j<=INF; j*=i) {
isPrime[j] = false;
}
}
๋ฐ์ํ
'๐ ๋ญ? JS๋ก PS๋ฅผ ํ๋ค๊ณ ?' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[ํ๋ก๊ทธ๋๋จธ์ค][JS / Javascript] N๊ฐ์ ์ต์๊ณต๋ฐฐ์ (0) | 2023.05.26 |
---|---|
[ํ๋ก๊ทธ๋๋จธ์ค][JS / Javascript] [3์ฐจ] ์์ถ (0) | 2023.05.25 |
[ํ๋ก๊ทธ๋๋จธ์ค][JS / Javascript] ํ๊ฒ ๋๋ฒ (0) | 2023.05.23 |
[ํ๋ก๊ทธ๋๋จธ์ค][JS / Javascript] ์คํ์ฑํ ๋ฐฉ (0) | 2023.05.19 |
[ํ๋ก๊ทธ๋๋จธ์ค][JS / Javascript] ํ๋ก์ธ์ค (0) | 2023.05.18 |