From 0a450d5161a087fe828d23acc2238f4313bc46d4 Mon Sep 17 00:00:00 2001
From: ssi02014 <ssi02014@naver.com>
Date: Thu, 27 Oct 2022 01:04:07 +0900
Subject: [PATCH] =?UTF-8?q?feat:=20=EC=BD=9C=EB=9D=BC=20=EB=AC=B8=EC=A0=9C?=
 =?UTF-8?q?=20=EC=83=88=EB=A1=9C=EC=9A=B4=20=ED=92=80=EC=9D=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...3\235\274-\353\254\270\354\240\234&132267.js" | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 "level-1/\354\275\234\353\235\274-\353\254\270\354\240\234&132267.js"

diff --git "a/level-1/\354\275\234\353\235\274-\353\254\270\354\240\234&132267.js" "b/level-1/\354\275\234\353\235\274-\353\254\270\354\240\234&132267.js"
new file mode 100644
index 0000000..46fb8ba
--- /dev/null
+++ "b/level-1/\354\275\234\353\235\274-\353\254\270\354\240\234&132267.js"
@@ -0,0 +1,16 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//더 좋은 풀이가 존재할 수 있습니다.
+//정답 1 - ssi02014
+function solution(a, b, n) {
+  let result = 0;
+      
+  while (n >= a) {
+    const remain = n % a;
+        
+    n = Math.floor(n / a) * b;
+    result += n;
+    n += remain;
+  }
+  
+  return result;
+}