๋ฌธ์ ํ๋ก๊ทธ๋๋จธ์ค N-Queenhttps://school.programmers.co.kr/learn/courses/30/lessons/12952' ํ๋ก๊ทธ๋๋จธ์ค์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์
๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์
๋ค์ ๋งค์นญ ๋ฐ์ผ์ธ์.programmers.co.kr ์ฝ๋def solution(n): global answer v1 = [0 for _ in range(n)] # ์ด v2 = [0 for _ in range(n * 2)] # ๋๊ฐ์ ์๋ฐฉ v3 = [0 for _ in range(n * 2)] # ๋๊ฐ์ ํ๋ฐฉ answer = 0 def dfs(row): global answ..
์ฝ๋ฉํ ์คํธ๐ก
๋ฌธ์ ํ๋ก๊ทธ๋๋จธ์ค ์์์ฐพ๊ธฐhttps://school.programmers.co.kr/learn/courses/30/lessons/42839 ํ๋ก๊ทธ๋๋จธ์ค์ฝ๋ ์ค์ฌ์ ๊ฐ๋ฐ์ ์ฑ์ฉ. ์คํ ๊ธฐ๋ฐ์ ํฌ์ง์
๋งค์นญ. ํ๋ก๊ทธ๋๋จธ์ค์ ๊ฐ๋ฐ์ ๋ง์ถคํ ํ๋กํ์ ๋ฑ๋กํ๊ณ , ๋์ ๊ธฐ์ ๊ถํฉ์ด ์ ๋ง๋ ๊ธฐ์
๋ค์ ๋งค์นญ ๋ฐ์ผ์ธ์.programmers.co.kr ์ฝ๋import itertoolsdef sosu(num): if num == 0 or num == 1: return False for i in range(2, int(num ** 0.5) + 1): if num % i == 0: return False return Truedef solution(n): answe..
๋ฌธ์ ๋ฐฑ์ค ๋ด์ค ์ ํ๊ธฐ https://www.acmicpc.net/problem/1135 ์ฝ๋n = int(input())parent_list = list(map(int, input().split()))child_list = [list() for _ in range(n)]for child in range(1, n) : parent = parent_list[child] child_list[parent].append(child)def dfs(node) : if not child_list[node] : return 0 result = list() for child in child_list[node] : result.append(dfs(child)) result.sort( reverse =..
๋ฌธ์ ๋ฐฑ์ค 1927 ์ต์ ํ https://www.acmicpc.net/problem/1927๋ฐฑ์ค 11279 ์ต๋ ํ https://www.acmicpc.net/problem/11279 ์ต์ ํ ์ฒ์ ์ฝ๋ (์๊ฐ์ด๊ณผ)๋ฐฐ์ด์์ min()์ ์ด์ฉํ์ฌ ์ต์๊ฐ์ ์ฐพ์๋ค.n = int(input())x = []for _ in range(n): num = int(input()) if num == 0: if x: print(min(x)) x.remove(min(x)) else: print(0) else: x.append(num) ์ต์ ํ ์ฝ๋import sysimport heapqn = int(input()..
๋ฌธ์ 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..
๋ฌธ์ ๋ฆฟ์ฝ๋ 1338. Reduce Array Size To The Halfhttps://leetcode.com/problems/reduce-array-size-to-the-half/description/ ์ฝ๋class Solution(object): def minSetSize(self, arr): answer = 0 count_num = {} for num in arr: if num not in count_num.keys(): count_num[num] = 1 else: count_num[num] += 1 values = sorted(list(..
๋ฌธ์ ๋ฆฟ์ฝ๋ 1845. Seat Reservation Managerhttps://leetcode.com/problems/seat-reservation-manager/ ์ฝ๋import heapqclass SeatManager: def __init__(self, n): self.can_reserve = list(range(1, n + 1)) heapq.heapify(self.can_reserve) def reserve(self): return heapq.heappop(self.can_reserve) def unreserve(self, seatNumber): heapq.heappush(self.can_reserve, seatNumber)..
๋ฌธ์ ๋ฆฟ์ฝ๋ 921. Minimum Add to Make Parentheses Valishttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/ ์ฝ๋class Solution(object): def minAddToMakeValid(self, s): s = deque(s) stack = [] item = s.popleft() stack.append(item) while s: item = s.popleft() if not stack: stack.append(item) else: ..
๋ฌธ์ 2390. Removing Stars From a String https://leetcode.com/problems/removing-stars-from-a-string/ ์ฝ๋class Solution(object): def removeStars(self, s): s = list(s) while '*' in s: for i in range(len(s)-1): if s[i + 1] == '*': s.pop(i+1) s.pop(i) break return ''.join(s) ํ์ดs = list(s)๋งค๊ฐ๋ณ์๋ก ๋ฐ์ ๋ฌธ์..
๋ฌธ์ ๋ฆฟ์ฝ๋ 1823. Find the Winner of the Circular Gamehttps://leetcode.com/problems/find-the-winner-of-the-circular-game/solutions/ ์ฝ๋class Solution: def findTheWinner(self, n: int, k: int) -> int: circle = [i for i in range(1, n+1)] count = 1 turn = 0 while len(circle) != 1: if count == k: circle.pop(turn) count = 1 ..
๋ฌธ์ ๋ฐฑ์ค ๊ฑธ๊ทธ๋ฃน ๋ง์คํฐ ์ค์์ด https://www.acmicpc.net/problem/16165 ์ฝ๋n, m = map(int, input().split()) # ๊ฑธ๊ทธ๋ฃน์ ์, ๋งํ์ผ ํ ๋ฌธ์ ์ ์idol_dic = {}for _ in range(n): team_name = input() team_member_num = int(input()) team_member = [] for _ in range(team_member_num): team_member.append(input()) idol_dic[team_name] = team_memberfor _ in range(m): quiz = input() quiz_type = int(input()) ..
