Merge pull request #257 from Suxxxxhyun/Suxxxxhyun

[Failed] PRG_피로도(복습필요), PRG_n^2 배열 자르기(복습필요), [Failed] PRG_k진수에서 소수 개수 구하기(복습필요)

Author: Suxxxxhyun

Week6/공통/k진수에서_소수개수_구하기/suhyun.py

@@ -0,0 +1,36 @@
+# 문자열 뒤집기
+# 문자열[::-1]
+import math
+def isPrime(x):
+    if int(x) == 1:
+        return False
+    else:
+        for i in range(2, int(math.sqrt(int(x))) + 1):
+            if int(x) % i == 0:
+                return False
+        return True
+
+def k_num(n,k):
+    if k == 10:
+        return n
+    else:
+        new_n = ''
+        while n > 0:
+            new_n += str(n % k)
+            n //= k
+        return new_n[::-1]
+
+def solution(n, k):
+    answer = 0
+    num = k_num(n,k)
+    # print(num)
+    nums = str(num).split("0")
+    print(nums)
+    
+    for x in nums:
+        if x and isPrime(x):
+            answer += 1
+        
+    return answer
+
+print(solution(437674, 3))

Week6/공통/k진수에서_소수개수_구하기/test.java

@@ -0,0 +1,9 @@
+def solution(n, left, right):
+    answer = []
+    
+    for i in range(left, right+1):
+        answer.append(max((i // n), (i % n)) + 1)
+    
+    return answer
+
+print(solution(3, 2, 5))

Week6/공통/n의제곱_배열자르기/suhyun.py

@@ -0,0 +1,30 @@
+# 내장함수 이용해서 해보자. -> permutations()
+# from itertools import permutations
+# repeat을 쓰는 것은 product뿐임!
+# 8!
+# 던전을 최대로 탐험하고 싶음.
+from itertools import permutations
+import math
+answer = 0
+d_len = 0
+
+def solution(k, dungeons):
+    global answer
+    selected = [0] * len(dungeons) # 던전을 탐험하는 순서
+    d_len = len(dungeons)
+    
+    for a in permutations(range(d_len), d_len):
+        cnt = 0
+        pe = k
+        # print(a)
+        for p in a:
+            if dungeons[p][0] <= pe:
+                pe -= dungeons[p][1]
+                cnt += 1
+        
+        if answer < cnt:
+            answer = cnt
+        
+    return answer
+
+print(solution(80, 	[[80,20],[50,40],[30,10]]))