From 8b9b0c964ebce896cc57409b7e681bd88e6b40f1 Mon Sep 17 00:00:00 2001
From: urjimyu <92876819+urjimyu@users.noreply.github.com>
Date: Sun, 3 Dec 2023 23:54:50 +0900
Subject: [PATCH] soluton: week8 solutions

---
 "\354\247\200\353\257\274/week8/12977.js"  | 24 +++++++++++++++++++++
 "\354\247\200\353\257\274/week8/135808.js" |  9 ++++++++
 "\354\247\200\353\257\274/week8/43840.js"  | 25 ++++++++++++++++++++++
 3 files changed, 58 insertions(+)
 create mode 100644 "\354\247\200\353\257\274/week8/12977.js"
 create mode 100644 "\354\247\200\353\257\274/week8/135808.js"
 create mode 100644 "\354\247\200\353\257\274/week8/43840.js"

diff --git "a/\354\247\200\353\257\274/week8/12977.js" "b/\354\247\200\353\257\274/week8/12977.js"
new file mode 100644
index 0000000..f1ab7ee
--- /dev/null
+++ "b/\354\247\200\353\257\274/week8/12977.js"
@@ -0,0 +1,24 @@
+// Level 1 - 소수 만들기
+// 다른 풀이
+
+function primecheck(n) {
+	for (var i = 2; i <= Math.sqrt(n); i++) {
+		if (n % i == 0) {
+			return false;
+		}
+	}
+	return true;
+}
+function solution(nums) {
+	var cnt = 0;
+	for (var i = 0; i < nums.length - 2; i++) {
+		for (var j = i + 1; j < nums.length - 1; j++) {
+			for (var w = j + 1; w < nums.length; w++) {
+				if (primecheck(nums[i] + nums[j] + nums[w])) {
+					cnt++;
+				}
+			}
+		}
+	}
+	return cnt;
+}
diff --git "a/\354\247\200\353\257\274/week8/135808.js" "b/\354\247\200\353\257\274/week8/135808.js"
new file mode 100644
index 0000000..e98f176
--- /dev/null
+++ "b/\354\247\200\353\257\274/week8/135808.js"
@@ -0,0 +1,9 @@
+//Level 1 - 과일 장수
+function solution(k, m, score) {
+	let sorted_apples = score.sort().reverse();
+	let sum = 0;
+	for (i = 1; i < Math.floor(score.length / m) + 1; i++) {
+		sum += sorted_apples[i * m - 1] * m;
+	}
+	return sum;
+}
diff --git "a/\354\247\200\353\257\274/week8/43840.js" "b/\354\247\200\353\257\274/week8/43840.js"
new file mode 100644
index 0000000..dd2072f
--- /dev/null
+++ "b/\354\247\200\353\257\274/week8/43840.js"
@@ -0,0 +1,25 @@
+//Level 1 - 모의고사
+//접근이 틀려서 다른 풀이 가져옴
+function solution(answers) {
+	var answer = [];
+	var a1 = [1, 2, 3, 4, 5];
+	var a2 = [2, 1, 2, 3, 2, 4, 2, 5];
+	var a3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5];
+
+	var a1c = answers.filter((a, i) => a === a1[i % a1.length]).length;
+	var a2c = answers.filter((a, i) => a === a2[i % a2.length]).length;
+	var a3c = answers.filter((a, i) => a === a3[i % a3.length]).length;
+	var max = Math.max(a1c, a2c, a3c);
+
+	if (a1c === max) {
+		answer.push(1);
+	}
+	if (a2c === max) {
+		answer.push(2);
+	}
+	if (a3c === max) {
+		answer.push(3);
+	}
+
+	return answer;
+}