[#6] 그리디, 수학문제

Boj/그리디/11047.py

@@ -0,0 +1,13 @@
+n, k = map(int, input().split())
+list = []
+for i in range(n):
+    list.append(int(input()))
+
+list.sort(reverse=True)
+
+ans = 0
+for i in list:
+    ans += k//i
+    k = k % i
+
+print(ans)

Boj/기본 수학2/4153.py

@@ -0,0 +1,13 @@
+while True:
+    data = list(map(int, input().split()))
+    if data[0] == 0 and data[1] == 0 and data[2] == 0:
+        break
+    maxNum = max(data)
+    data = set(data) - set([maxNum])
+    sum = 0
+    for i in data:
+        sum += i*i
+    if sum == maxNum * maxNum:
+        print("right")
+    else:
+        print("wrong")