파이썬

문제https://www.acmicpc.net/problem/14888 코드n = int(input())num = list(map(int, input().split()))operation = list(map(int, input().split())) # +, -, *, /maxi = -1e9mini = 1e9def dfs(idx, result, plus, minus, multiply, divide): global maxi, mini if idx == n: maxi = max(result, maxi) mini = min(result, mini) return if plus > 0: dfs(idx + 1, result + num[idx], pl..

문제https://www.acmicpc.net/problem/1012 코드from collections import dequeT = int(input())for _ in range(T): n, m, k = map(int, input().split()) # 가로, 세로, 배추개수 field = [[0 for _ in range(n)] for _ in range(m)] visit = [[False for _ in range(n)] for _ in range(m)] answer = 0 # 배추 지도 그리기 for l in range(k): x, y = map(int, input().split()) field[y][x] = 1 for i in..