[Add] Baekjoon > 3 solutions

Author: Joie-Kim

Baekjoon/Q14888.py

@@ -0,0 +1,34 @@
+# link: https://www.acmicpc.net/problem/14888
+# 다시 풀어볼 것
+
+import sys
+
+input = sys.stdin.readline
+N = int(input())
+num = list(map(int, input().split()))
+op = list(map(int, input().split()))
+
+maximum = -1e9
+minimum = 1e9
+
+
+def dfs(depth, total, plus, minus, multiply, divide):
+    global maximum, minimum
+    if depth == N:
+        maximum = max(total, maximum)
+        minimum = min(total, minimum)
+        return
+
+    if plus:
+        dfs(depth + 1, total + num[depth], plus - 1, minus, multiply, divide)
+    if minus:
+        dfs(depth + 1, total - num[depth], plus, minus - 1, multiply, divide)
+    if multiply:
+        dfs(depth + 1, total * num[depth], plus, minus, multiply - 1, divide)
+    if divide:
+        dfs(depth + 1, int(total / num[depth]), plus, minus, multiply, divide - 1)
+
+
+dfs(1, num[0], op[0], op[1], op[2], op[3])
+print(maximum)
+print(minimum)

Baekjoon/Q14891.py

@@ -0,0 +1,63 @@
+# link: https://www.acmicpc.net/problem/14891
+# 다시 풀어보자..
+
+from collections import deque
+
+def rotate(a,array):
+    temp = [0]*8
+    if a == -1: #반시계방향
+        temp[7] = array[0]
+        for i in range(1,len(array)):
+            temp[i-1] = array[i]
+    if a == 1: #시계방향
+        temp[0] = array[7]
+        for i in range(len(array)-1):
+            temp[i+1] = array[i]
+    return temp
+
+
+score = [1,2,4,8]
+topni = []
+
+
+for _ in range(4):
+    topni.append(list(map(int,input()))) 
+k = int(input())
+
+def check(a,dir):
+    rotate_list = []
+    visitied = [False]*4
+    queue = deque()
+    queue.append((a-1,dir))
+    visitied[a-1] = True
+    rotate_list.append((a-1,dir))
+    while queue:
+        x,dir = queue.popleft()
+        #왼쪽톱니바퀴와 맞닿을때
+        nx = x-1
+        if (0<=nx<4 and topni[nx][2] != topni[x][6] and not visitied[nx]):
+            queue.append((nx,-dir))
+            rotate_list.append((nx,-dir))
+            visitied[nx] = True
+        #오른쪽 톱니바퀴와 맞닿을때
+        nx = x+1
+        if(0<=nx<4 and topni[nx][6] != topni[x][2] and not visitied[nx]):
+            queue.append((nx,-dir))
+            rotate_list.append((nx,-dir))
+            visitied[nx] = True
+    return rotate_list
+
+for _ in range(k):
+    number,direc = map(int,input().split())
+    rotate_list= check(number,direc)
+    for i,j in rotate_list:
+        topni[i] = rotate(j,topni[i])
+
+
+sum = 0    
+for i in range(len(topni)):
+    if topni[i][0] == 0:
+        sum+=0
+    if topni[i][0] == 1:
+        sum+=score[i]
+print(sum)

Baekjoon/Q18870.py

@@ -0,0 +1,13 @@
+# link: https://www.acmicpc.net/problem/18870
+
+import sys
+
+input = sys.stdin.readline
+n = int(input())
+nums = list(map(int, input().split()))
+
+sortedNums = sorted(list(set(nums)))
+numDic = {sortedNums[i]: i for i in range(len(sortedNums))}
+
+for num in nums:
+    print(numDic[num], end=' ')