Update '최고의 집합'

Author: kde0820

Level_2/최고의 집합/main.py

@@ -0,0 +1,11 @@
+def solution(n, s):
+    if s//n == 0:
+        return [-1]
+    answer = [s//n for i in range(n)]
+    remain = s % n
+    index = -1
+    while remain > 0:
+        answer[index] += 1
+        remain -= 1
+        index -= 1
+    return answer