3주차 / 상급반 / 정지태

상급반 / 정지태 / ~3주차

Author: AppliedAlpha

week1/datastructure/N번째_큰_수/JtJint.py

@@ -0,0 +1,21 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+
+l1 = []
+for _ in range(n) :
+    l2 = list(map(int, input().split(" ")))
+    if len(l1) == 0:
+        for i in range(len(l2)) :
+            l1.append(l2[i])
+        l1.sort()
+    else :
+        l2.sort()
+        l2.reverse()
+        for i in range(len(l2)) :
+            if l2[i] > l1[i] :
+                l1[i] = l2[i]
+        l1.sort()
+        
+print(l1[0])

week1/datastructure/괄호의_값/JtJint.py

@@ -0,0 +1,48 @@
+import sys
+from collections import deque
+
+def divide3(a) :
+    if a%3 == 0:
+        return a//3
+    else :
+        return None
+
+def divide2(a) :
+    if a%2 ==0 :
+        return a//2
+    else :
+        return None
+        
+def minus1(a) :
+    return a-1
+
+n = int(input())
+
+que = deque([n])
+visited = set([n])
+cnt =0
+q = 0
+if n == 1 :
+    print(cnt)
+    quit()
+
+while que :
+    cnt+=1
+    for _ in range(len(que)) :
+        current = que.popleft()
+        value1 = divide3(current)
+        value2 = divide2(current)
+        value3 = minus1(current)
+        for i in [value1, value2, value3] :
+            if i is None or i in visited :
+                continue
+            if i == 1 :
+                print(cnt)
+                quit()
+            
+            que.append(i)
+            visited.add(i)    
+        
+    
+print(cnt)
+        

week1/datastructure/문제_추천_시스템_Version_1/JtJint.py

@@ -0,0 +1,11 @@
+def backtrack(start, path):
+    if len(path) == M: 
+        print(*path)
+        return
+    
+    for i in range(start, N + 1):  
+        backtrack(i, path + [i])  
+
+N, M = map(int, input().split())
+
+backtrack(1, [])

week1/datastructure/스택_수열/JtJint.py

@@ -0,0 +1,41 @@
+import sys
+input = sys.stdin.readline
+
+def solveSudoku(sudokuList, i, j):
+    if j == 9:
+        j = 0
+        i += 1
+    if i == 9:
+        return True  # 성공적으로 끝났을 경우
+
+    if sudokuList[i][j] != 0:
+        return solveSudoku(sudokuList, i, j + 1)
+
+    tmpList = [1, 2, 3, 4, 5, 6, 7, 8, 9]
+    tmpList = find3x3(sudokuList, i, j, tmpList)
+    tmpList = findlinear(sudokuList, i, j, tmpList)
+
+    for num in tmpList:
+        sudokuList[i][j] = num
+        if solveSudoku(sudokuList, i, j + 1):
+            return True  # 정답을 찾았으면 바로 return
+
+    sudokuList[i][j] = 0  # 백트래킹 (원상복구)
+    return False
+
+def find3x3(sudokuList, x, y, tmpList):
+    tmpX = (x // 3) * 3
+    tmpY = (y // 3) * 3
+    box = [sudokuList[tmpX + i][tmpY + j] for i in range(3) for j in range(3)]
+    return [num for num in tmpList if num not in box]
+
+def findlinear(sudokuList, x, y, tmpList):
+    deleteset = set(sudokuList[x])  # 가로 검사
+    deleteset.update(sudokuList[j][y] for j in range(9))  # 세로 검사
+    return [num for num in tmpList if num not in deleteset]
+
+l1 = [list(map(int, input().strip().split())) for _ in range(9)]
+solveSudoku(l1, 0, 0)
+
+for row in l1:
+    print(*row)