Merge pull request #252 from Suxxxxhyun/Suxxxxhyun

[Failed] PRG_롤케이크 자르기(복습필요), [Solved] PRG_음양더하기

Author: Suxxxxhyun

Week5/공통/롤케이크_자르기/suhyun2.py

@@ -0,0 +1,25 @@
+# Counter(리스트)
+# {1:4, 2:3}와 같은 형식으로 변함 
+# 딕셔너리에서 원소를 제거하는 방법은 2가지이다.
+# del 딕셔너리[키]
+# 딕셔너리.pop(키) -> pop을 사용하면 해당 키를 제거할때, 그 키에 해당하는 value를 반환한다.
+from collections import Counter
+def solution(topping):
+    answer = 0
+    old = Counter(topping)
+    young = set()
+    
+    for t in topping:
+        old[t] -= 1
+        young.add(t)
+        
+        if old[t] == 0:
+            del old[t]
+        if len(old) == len(young):
+            answer += 1 
+    
+    return answer
+
+topping = [1, 2, 1, 3, 1, 4, 1, 2]
+# topping = [1, 2, 3, 1, 4]
+print(solution(topping))

Week5/공통/음양_더하기/suhyun.py

@@ -0,0 +1,5 @@
+from itertools import combinations_with_replacement
+n, m = map(int, input().split())
+answers = list(combinations_with_replacement(range(1, n+1), m))
+for e in answers:
+    print(' '.join(map(str, e)))

Week5/공통/음양_더하기/test.java

@@ -0,0 +1,27 @@
+package Week6.개인.분수최소개수구하기;
+
+public class suhyun {
+    public static int solution(int n, int[] locations){
+        int max = 0, min = 100001, count = 0;
+        for(int i=0; i<locations.length; i++){
+            int a = Math.max(i+1 - locations[i], 1);
+            int b = Math.min(i+1 + locations[i], n);
+            boolean A = false, B = false;
+            if(min > a){
+                min = a;
+                A = true;
+            }
+            if(max < b){
+                max = b;
+                B = true;
+            }
+            if(A && B){
+                count += 1;
+            }
+        }
+        return count;
+    }
+    public static void main(String[] args){
+        System.out.println(solution(3, new int[]{1,2,1}));
+    }
+}

Week6/개인/n과m4/suhyun1.py

@@ -0,0 +1,32 @@
+def solution(dartResult):
+    answer = 0
+    
+    n = ''
+    score = []
+    for d in dartResult:
+        if d.isnumeric():
+            n += d
+        elif d == 'S':
+            n = int(n) ** 1
+            score.append(n)
+            n = ''
+        elif d == 'D':
+            n = int(n) ** 2
+            score.append(n)
+            n = ''
+        elif d == 'T':
+            n = int(n) ** 3
+            score.append(n)
+            n = ''
+        elif d == '#':
+            score[-1] = -score[-1]
+        elif d == '*':
+            if len(score) > 1:
+                score[-1] = score[-1] * 2
+                score[-2] = score[-2] * 2
+            else:
+                score[-1] = score[-1] * 2
+    
+    return sum(score)
+
+print(solution("1D2S#10S"))

Week6/개인/분수최소개수구하기/suhyun.java

@@ -0,0 +1,29 @@
+from itertools import combinations_with_replacement
+def solution(n, info):
+    answer = [-1]
+    max_gap = -1
+    
+    for combi in combinations_with_replacement(range(11), n):
+        info2 = [0] * 11
+        
+        for c in combi:
+            info2[10-c] += 1
+        
+        a, l = 0, 0
+        for i in range(11):
+            if info[i] == info2[i] == 0:
+                continue
+            elif info[i] >= info2[i]:
+                a += (10 - i)
+            else:
+                l += (10 - i)
+        
+        if l > a:
+            gap = l - a
+            if gap > max_gap:
+                max_gap = gap
+                answer = info2
+                
+    return answer
+
+print(solution(5, [2,1,1,1,0,0,0,0,0,0,0]))