본문 바로가기
  • KEEP HUSTLE!

전체 글73

[백준 12015] 가장 긴 증가하는 부분 수열 2 - Python(파이썬) from bisect import bisect_left import sys def solution(i): x = bisect_left(result, i) if len(result) 2021. 3. 9.
[백준 1300] K번째 수 - Python(파이썬) import sys def solution(mid): temp = mid // N cnt = temp * N for i in range(temp + 1, N+1): cnt += mid // i if cnt >= k: break return cnt N = int(sys.stdin.readline().strip()) k = int(sys.stdin.readline().strip()) start, end = 1, N*N while start = k: end = middle - 1 else: start = middle + 1 print(start) 2021. 3. 9.
[백준 2805] 나무 자르기 - Python(파이썬) from collections import Counter import sys def solution(arr, middle): result = 0 for each, cnt in arr.items(): if each > middle: result += (each - middle) * cnt if result >= M: break return result N, M = map(int, sys.stdin.readline().split()) my_arr = Counter(map(int, sys.stdin.readline().split())) start, end = 0, max(my_arr) while start = M: start = my_middle + 1 else: end = my_middle - 1 print.. 2021. 3. 9.
[백준 7576] 토마토 - Python(파이썬) from collections import deque import sys M, N = map(int, sys.stdin.readline().split()) arr = [] my_deq = deque() dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] cnt = 0 for i in range(N): arr.append(list(map(int, sys.stdin.readline().split()))) for j in range(M): if arr[i][j] == 1: cnt += 1 my_deq.append((i, j)) elif arr[i][j] == -1: cnt += 1 answer = -1 while my_deq: my_len = len(my_deq) for _ in range(m.. 2021. 3. 9.
[백준 1012] 유기농 배추 - Python(파이썬) from collections import deque import sys T = int(sys.stdin.readline().strip()) dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] for tc in range(T): M, N, K = map(int, sys.stdin.readline().split()) arr = [[0] * M for _ in range(N)] check = [[0] * M for _ in range(N)] to_go = [] for _ in range(K): a, b = map(int, sys.stdin.readline().split()) arr[b][a] = 1 to_go.append((a, b)) answer = 0 for to in to_go: j, .. 2021. 3. 9.
[백준 2606] 바이러스 - Python(파이썬) import sys def solution(idx): for i in arr[idx]: if check[i] == 0: check[i] = 1 solution(i) N = int(sys.stdin.readline().strip()) arr = {n: [] for n in range(1, N+1)} D = int(sys.stdin.readline().strip()) check = [0] * (N + 1) for _ in range(D): a, b = map(int, sys.stdin.readline().split()) arr[a].append(b) arr[b].append(a) check[1] = 1 solution(1) print(sum(check) - 1) 2021. 3. 9.