문제: https://school.programmers.co.kr/learn/courses/30/lessons/388352 코드from itertools import combinationsdef solution(n, q, ans): count = 0 num = list(range(1, n + 1)) correct = list(combinations(num, 5)) for cor in correct: is_correct = True for code, answer in zip(q, ans): if len(set(cor) & set(code)) != answer: is_correct = False ..

문제 : https://www.acmicpc.net/problem/7569 나의 풀이import sysfrom collections import dequeinput = sys.stdin.readlineM, N, H = map(int, input().split())boxes = [[list(map(int, input().split())) for _ in range(N)] for _ in range(H)]def bfs(): q = deque() # 처음부터 익은 토마토 큐에 추가 for tomato in tomatoes: q.append(tomato) dz = [1, -1, 0, 0, 0, 0] dy = [0, 0, 1, -1, 0, 0] dx = [0, 0,..

문제 : https://www.acmicpc.net/problem/3190 나의 풀이import sysfrom collections import dequeinput = sys.stdin.readlineN = int(input())K = int(input())apples = [list(map(int, input().split())) for _ in range(K)]L = int(input())rotation = [list(input().split()) for _ in range(L)]board = [[0] * N for _ in range(N)]for a, b in apples: board[a-1][b-1] = 1def bfs(start): dx = [0, 1, 0, -1] dy = [..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/12946 코드def solution(n): result = [] def hanoi(n, start, end, temp): if n == 1: result.append([start, end]) return hanoi(n-1, start, temp, end) result.append([start, end]) hanoi(n-1, temp, end, start) hanoi(n, 1, 3, 2) return result

문제 : https://www.acmicpc.net/problem/15683 나의 풀이import sysinput = sys.stdin.readlinen, m = map(int, input().split())Map = [list(map(int, input().split())) for _ in range(n)]dx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]cctv_type = { 1: [[0], [1], [2], [3]], # 상, 하, 좌, 우 2: [[0, 1], [2, 3]], # 상+하, 좌+우 3: [[0, 3], [3, 1], [1, 2], [2, 0]], # 상+우, 우+하, 하+좌, 좌+..

문제 : https://www.acmicpc.net/problem/2252 나의 풀이from collections import dequeimport sysinput = sys.stdin.readlinen, m = map(int, input().split())graph = [[] for _ in range(n+1)]indegree = [0] * (n+1)for _ in range(m): a, b = map(int, input().split()) graph[a].append(b) indegree[b] += 1queue = deque()for i in range(1, n+1): if indegree[i] == 0: queue.append(i)result = []wh..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/17678 코드from collections import dequedef to_minutes(time): h, m = map(int, time.split(":")) return h * 60 + m def to_timestr(minutes): h = minutes // 60 m = minutes % 60 return f"{h:02d}:{m:02d}" def solution(n, t, m, timetable): timetable = sorted([to_minutes(minute) for minute in timetable]) shuttles = [..

문제 : https://www.acmicpc.net/problem/2206 나의 풀이import sysfrom collections import dequeinput = sys.stdin.readlinen, m = map(int, input().split())Map = [list(map(int, input().rstrip())) for _ in range(n)]visited = [[[False] * 2 for _ in range(m)] for _ in range(n)]queue = deque([(0, 0, 0, 1)])visited[0][0][0] = Truedx = [-1, 1, 0, 0]dy = [0, 0, -1, 1]ans = -1while queue: x, y, broken, dist =..