Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 52e1a21

Browse files
Add 소수-찾기.js
1 parent 1b3cb7b commit 52e1a21

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

‎level-1/소수-찾기.js

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -12,4 +12,23 @@ function solution(n) {
1212
for (const isPrime of isPrimeArr) if (isPrime) answer += 1
1313
answer -= 2 //인덱스 0과 1 제외
1414
return answer;
15+
}
16+
17+
//정답 2 - chaerin-dev
18+
// 소수인지 판별하는 함수
19+
function isPrime(x) {
20+
for (let i = 2; i <= Math.sqrt(x); i++) {
21+
if (x % i === 0) return false;
22+
}
23+
return true;
24+
}
25+
function solution(n) {
26+
// 소수의 개수를 저장할 변수
27+
let answer = 0;
28+
// 1은 소수가 아니므로 2부터 n까지 모든 수에 대해
29+
for (let i = 2; i <= n; i++) {
30+
// 소수이면 소수의 개수에 1 추가
31+
if (isPrime(i)) answer++;
32+
}
33+
return answer;
1534
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /