아...그 뭐였더라..

https://www.acmicpc.net/problem/27961import sysinput = sys.stdin.readlinen = int(input())answer = 0cat = 1if n == 0: print(0)elif n == 1: print(1)else: while cat != n: if cat >= n - cat: # 고양이 수가 n-cat보다 클경우 > 4마리 있는데 n이 6마리일 때 cat += n - cat answer += 1 else: # 고양이 수가 n-cat보다 작을경우 cat += cat answer += 1 print(answ..

https://www.acmicpc.net/problem/7569from collections import dequeimport sysinput = sys.stdin.readlinem,n,h = map(int, input().split())tomato = [[list(map(int, input().split())) for _ in range(n)] for _ in range(h)]# for _ in range(h):# for _ in range(n):# tomato.append(list(map(int, input().split())))days = 0dx = [1,-1,0,0,0,0]dy = [0,0,1,-1,0,0]dz = [0,0,0,0,1,-1]visited = [[[False]..

https://www.acmicpc.net/problem/25195import sysinput = sys.stdin.readlinesys.setrecursionlimit(10**7)n,m = map(int, input().split())graph = [[] for _ in range(n+1)]for _ in range(m): u, v = map(int, input().split()) graph[u].append(v)s = int(input())bearList = list(map(int, input().split()))flag = Falsedef dfs(v): global flag if v in bearList: # 팬을 만난 경우 return if graph..

https://www.acmicpc.net/problem/18352from collections import dequeimport sysinput = sys.stdin.readlinen, m, k, x = map(int, input().split())graph = [[] for _ in range(n+1)]distance = [0] * (n+1)visited = [False] * (n+1)answer = []for _ in range(m): a, b = map(int, input().split()) graph[a].append(b)def bfs(v): que = deque() que.append(v) visited[v] = True while que: now ..

https://www.acmicpc.net/problem/7562from collections import dequeimport sysinput = sys.stdin.readlinedx = [1,2,2,1,-1,-2,-2,-1]dy = [2,1,-1,-2,-2,-1,1,2]n = int(input())def bfs(x,y,moveX,moveY): que = deque() que.append([x,y]) #graph[x][y] = 1 while que: a, b = que.popleft() if a == moveX and b == moveY: return graph[a][b] for i in range(8): ..

https://www.acmicpc.net/problem/2644import sysinput = sys.stdin.readlinen = int(input())a, b = map(int, input().split())m = int(input())graph = [[] for _ in range(n+1)]visited = [False] * (n+1)flag = False # 촌수 찾았는지 확인for _ in range(m): x,y = map(int, input().split()) graph[x].append(y) graph[y].append(x)def dfs(v, cnt): global flag visited[v] = True if v == b: flag = Tr..

https://school.programmers.co.kr/learn/courses/30/lessons/84512 프로그래머스SW개발자를 위한 평가, 교육, 채용까지 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krfrom itertools import productdef solution(word): answer = 0 vowels = ['A', 'E', 'I', 'O', 'U'] dict = [] for i in range(1,6): for v in product(vowels, repeat=i): dict.append(''.join(v)) dict.sort() answer = dict..

https://www.acmicpc.net/problem/2805import sysinput = sys.stdin.readlinen, m = map(int, input().split())trees = list(map(int, input().split()))start = 0end = max(trees)answer = 0 # 절단기 높이while start mid: total += t - mid if total >= m: start = mid + 1 answer = mid else: end = mid - 1print(answer)m과 n의 범위를 보고 이분탐색을 생각할 수 있다.절단기 높이의 최댓값을 구하는 것이기 때문에 굳이 mi..

https://www.acmicpc.net/problem/24444from collections import dequeimport sysinput = sys.stdin.readlinesys.setrecursionlimit(10**7)n, m, r = map(int, input().split())graph = [[] for _ in range(n+1)]visited = [0] * (n+1)seq = 1que = deque()for _ in range(m): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u)def bfs(r): global seq visited[r] = seq seq += 1 q..

https://www.acmicpc.net/problem/24479import syssys.setrecursionlimit(10**6)input = sys.stdin.readlinen, m, r = map(int, input().split())graph = [[] for _ in range(n+1)]visited = [0] * (n+1)seq = 1 # 방문순서def dfs(r): global seq visited[r] = seq graph[r].sort() for i in graph[r]: if visited[i] == 0: seq += 1 dfs(i)for _ in range(m): u, v = map(int, input(..