Add files via upload

Author: Albert-learner

LEVEL2/Day1/MakePrimeNumber.py

@@ -0,0 +1,48 @@
+# 26. 소수 만들기
+
+'''에라토스테네스의 체(거의 다 내가 풀었는데...)'''
+import math
+from itertools import combinations
+
+def is_prime_number(n):
+    arr = [True for i in range(n + 1)]
+
+    for i in range(2, int(math.sqrt(n)) + 1):
+        if n % i == 0:
+            return False
+    return True
+
+
+def solution(nums):
+    answer = 0
+
+    comb_lst = list(combinations(nums, 3))
+    for pair in comb_lst:
+        sum_pair = sum(pair)
+        if is_prime_number(sum_pair):
+            answer += 1
+
+    return answer
+
+nums_1 = [1, 2, 3, 4]
+nums_2 = [1, 2, 7, 6, 4]
+
+# print(solution(nums_1))
+# print(solution(nums_2))
+
+'''더 빠르고 좋은 풀이'''
+def prime_number(n):
+    answer = 0
+
+    for i in range(1, int(n ** 0.5) + 1):
+        if n % i == 0:
+            answer += 1
+    return 1 if answer == 1 else 0
+
+def solution_best(nums):
+    answer = sum([prime_number(sum(c)) for c in combinations(nums, 3)])
+
+    return answer
+
+print(solution_best(nums_1))
+print(solution_best(nums_2))

LEVEL2/Day1/PonketMon.py

@@ -0,0 +1,47 @@
+# 27. 폰캣몬
+
+def solution(nums):
+    answer = 0
+
+    mine = [nums[0]]
+    for one in nums:
+        if len(mine) != len(nums) // 2:
+            if one not in mine:
+                mine.append(one)
+        else:
+            break
+
+    answer = len(mine)
+    return answer
+
+nums_1 = [3, 1, 2, 3]
+nums_2 = [3, 3, 3, 2, 2, 4]
+nums_3 = [3, 3, 3, 2, 2, 2]
+
+# print(solution(nums_1))
+# print(solution(nums_2))
+# print(solution(nums_3))
+
+'''내 풀이'''
+from itertools import combinations
+def solution_mine(nums):
+    answer = 0
+
+    comb_nums = list(combinations(nums, len(nums) // 2))
+    no_dup_comb_nums = sorted([set(item) for item in comb_nums], key=lambda x: len(x),
+                              reverse=True)
+    answer = len(no_dup_comb_nums[0])
+    return answer
+
+# print(solution_mine(nums_1))
+# print(solution_mine(nums_2))
+# print(solution_mine(nums_3))
+
+def solution_best(nums):
+    answer = min(len(nums) // 2, len(set(nums)))
+
+    return answer
+
+print(solution_best(nums_1))
+print(solution_best(nums_2))
+print(solution_best(nums_3))