newhaneul

# Baekjoon 1759번: 암호 만들기 import sys input = sys.stdin.readline L, C = map(int, input().split()) code = input().split() code.sort() def DFS(cstr, m): global L if m == C: if len(cstr) == L: count = 0 flag = False for char in cstr: if char in 'aeiou': flag = True else: count += 1 if flag == True and 1 < count: print(cstr) return DFS(cstr + code[m], m+1) DFS(cstr, m+1) DFS("", 0) 이번 문제는 백트래킹 문제이다. 문..

# Baekjoon 15686번: 치킨 배달 import sys from collections import deque from itertools import combinations input = sys.stdin.readline N, M = map(int, input().split()) city = [[] for _ in range(N)] market_info = [] house_info = [] tlst = [] for i in range(N): arr = input().split() for j in range(N): city[i].append(int(arr[j])) if arr[j] == '2': market_info.append((i, j)) elif arr[j] == '1': house_info...