[PGS] 최고의 집합 / Level3 / ?분

Author: Kojungbeom

kojungbeom/Programmers/Level3/최고의 집합.py

@@ -0,0 +1,13 @@
+def solution(n, s):
+    if n > s:
+        return [-1]
+    answer = [1] * n
+
+    a, b = divmod(s, n)
+    answer = [a]* n
+    for i in range(b):
+        answer[i % n] += 1
+
+    #print(answer)
+    answer.sort()
+    return answer