From 844adf70969cab660a79d86bffc92efb3cdb0c30 Mon Sep 17 00:00:00 2001
From: yoouyeon <jyeon.yoon59@gmail.com>
Date: Tue, 20 Jan 2026 23:38:33 +0900
Subject: [PATCH] =?UTF-8?q?=F0=9F=92=A1=20=ED=94=84=EB=A1=9C=EA=B7=B8?=
 =?UTF-8?q?=EB=9E=98=EB=A8=B8=EC=8A=A4=2012928=20-=20=EC=95=BD=EC=88=98?=
 =?UTF-8?q?=EC=9D=98=20=ED=95=A9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...5\354\210\230\354\235\230_\355\225\251.js" | 30 +++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 "Programmers/Level1/12928_\354\225\275\354\210\230\354\235\230_\355\225\251.js"

diff --git "a/Programmers/Level1/12928_\354\225\275\354\210\230\354\235\230_\355\225\251.js" "b/Programmers/Level1/12928_\354\225\275\354\210\230\354\235\230_\355\225\251.js"
new file mode 100644
index 0000000..40c68a9
--- /dev/null
+++ "b/Programmers/Level1/12928_\354\225\275\354\210\230\354\235\230_\355\225\251.js"
@@ -0,0 +1,30 @@
+/* 
+⭐️ 문제 정보 ⭐️
+문제 : 12928 - 약수의 합
+레벨 : Level 1
+링크 : https://school.programmers.co.kr/learn/courses/30/lessons/12928
+*/
+
+// ANCHOR - 2026.01.20 풀이
+/**
+ * NOTE
+ * 약수는 항상 쌍으로 존재하기 때문에 √n (i * i <= n) 까지만 탐색하면 된다는 점을 잊지 말기
+ */
+function getDivisors(n) {
+  const divisors = [];
+
+  for (let i = 1; i * i <= n; i++) {
+    if (n % i === 0) {
+      divisors.push(i);
+      if (n / i !== i) {
+        divisors.push(n / i);
+      }
+    }
+  }
+
+  return divisors;
+}
+
+function solution(n) {
+  return getDivisors(n).reduce((acc, cur) => acc + cur, 0);
+}